Category: Blog

Testing is a process used to help identify the appropriateness, wholeness and quality of developed computer software. Testing can never completely establish the correctness of computer software. There are many approaches to software testing, but effective testing of complex products is essentially a process of investigation, not merely a matter of creating and following rote procedure. Testing helps is verifying and validating if the Software is working as it is intended to be working. Things involve using Static and Dynamic methodologies to Test the application. Because of the shortcoming of its human designers and its own abstract, complex nature, software development must be accompanied by quality assurance activities. It is not unusual for developers to spend 45% of the total project time on testing. Software testing is a fundamental component of software quality assurance and represents a review of specification, design and coding.
STLC (Software Testing Life Cycle) is simply a testing phase in the SDLC development. Validation and Authentication is tried and tested in this phase. The only limitation of this cycle is that it is limited to respective individual phase and is carried out by a group of skilled testers and technology evangelistic. Testing is the one step in the software process that can be seen by the developer as destructive instead of constructive. Software engineers are typically constructive people and testing requires them to overcome preconceived concepts of correctness and deal with conflicts when errors are recognized.

Testing in the early hours in the life cycle reduces the errors. Test deliverables are associated with every phase of development. The goal of Software Tester is to find bugs, find them as early as possible, and make them sure they are fixed.

This can be difficult to determine. “When to stop testing” is one of the most difficult questions to a test engineer .Common factors in deciding when to stop.
Software testing accounts for a large percentage of effort in the software development process, but we have only recently begun to understand the subtleties of systematic planning, execution and control. For an IT organization, developing a software system that meets the business needs of clients is always a challenge. Software testing is a process without which the Software Development Life Cycle (SDLC) stands incomplete.

It is the process that identifies the correctness, completeness and quality of the software developed during the SDLC process. Software bugs and improperly tested codes cost millions in damages and millions more in time and money to fix the defect.

The two are very closely related. As we’ll see when we start looking at fuzzy logic, the basic connectives in fuzzy judgment are definite in about the same way as the parallel operation in probability theory.
The key difference is meaning.
There are two major schools of considerations in probability theory, and they all allocate a very dissimilar meaning to probability. I’m disappearing to greatly simplify, but the two schools are the frequent and the Bayesians.
First, present are the frequentists. To the frequentists, possibility is defined by trial. If you say that an occasion E has a chance of, say, 60%, what that means to the frequentists is that if you could replicate an research observe the happening or non-occurrence of E an endless number of times, then 60% of the time, E would have occur. That, in spin, is in use to indicate that the incident E has an intrinsic probability of 60%.
In fuzzy logic, we’re annoying to imprison the necessary possessions of indistinctness. If I say that a human whose height is 2.5 meters giant, that’s a accurate declaration. If I say that one more individual whose tallness is only 2 meters is tall, that’s still true – but it’s not as right as it be for the one 2.5 meter tall. I’m not axiom that in a repeatable testing, the first person would be tall more often than the moment.
And, in the other path: fuzzy sense isn’t largely functional for argument regarding fraction details. If you allowable second-order reason, you might have fuzzy meta-predicates that describe your faith about hard first-order predicates.
So probability theory doesn’t imprison the necessary property of sense (partial truth) which is the aim of fuzzy logic – and fuzzy logic doesn’t arrest the essential goods of connotation (partial knowledge) which is the goal of chance premise.

A Mobile Ad hoc Network (MANET) is a self governing network of mobile nodes connected through wireless links. Mobile ad hoc networks (MANET) are infrastructure less networks, dynamically formed by an autonomous system of mobile nodes that are connected via wireless links. Each node in MANET operates not only as a host but also as a router that has the task to forward data. Mobile nodes only can communicate directly via wireless link if they are within each other’s radio range otherwise, they depends on intermediate nodes to forward packets. The success of communication highly depends upon the cooperation of other nodes.
In MANET, data delivery is a major challenge. Due to unpredicted movement of mobile nodes topology of the network changes frequently. The primary goal of any routing protocol is establishing an optimal and efficient route between the communicating nodes. the past few years, much research efforts have been focused on this area and many different kinds of routing protocols have been put forward in the literature, such as Wireless Routing Protocol (WRP), Dynamic Source Routing protocol (DSR), Ad hoc On Demand Distance Vector protocol (AODV) and Location Aided Routing. However, from the beginning of its design, almost none of the routing protocols specify security measures.
To implement Security in MANETs is a complex issue. Nodes in the network are much more vulnerable to attacks compare to wired (traditional) networks due to the open medium, dynamically changing network topology, lack of centralized monitoring and management point, and lack of a clear line of defense. These factors have changed the battle field situations for the ad hoc wireless networks against the security threats. The ad hoc wireless networks the nodes communicate with each other on the basis of mutual trust without any a centralized administration. These characteristic makes ad hoc wireless networks more vulnerable to be exploited by an attacker inside the network. Wireless links also makes the ad hoc wireless networks more susceptible to attacks, which make it easier for the attacker to go inside the network and get access to the ongoing communication.

The word steganography comes from the Greek word Steganos, which mean covered or secret and graphy means writing or drawing. Therefore, steganography means, literally, covered writing. Steganography is the art and science of hiding information such that its presence cannot be detected and a communication is happening. Secret information is encoded in a manner such that the very existence of the information is concealed. Paired with existing communication methods, steganography can be used to carry out hidden exchanges. The main goal of steganography is to communicate securely in a completely undetectable manner and to avoid drawing suspicion to the transmission of a hidden data It is not to keep others from knowing the hidden information, but it is to keep others from thinking that the information even exists. The main goal or steganography is to communicate securely in a completely undetectable manner and to avoid drawing suspicion to the transmission of a hidden data]. During the process, characteristics of these methods are to change in the structure and features so as not to images, videos, sound files, and other computer files that contain perceptually irrelevant or redundant information can be used as “covers” or carriers to hide secret messages. After embedding a secret message into the cover-image, a so-called stego-image is obtained. The basic model of steganography consists of Carrier, Message, Embedding algorithm and Stego key. The model for steganography is shown in Figure 1. Carrier is also known as a cover-object, which embeds the message and serves to hide its presence.
Steganography Concept:
Although steganography is an ancient subject, the modern formulation of it is often given in terms of the prisoner’s problem proposed by Simmons, where two inmates wish to communicate in secret to hatch an escape plan. All of their communication passes through a warden who will throw them in solitary confinement should she suspect any covert communication. The warden, who is free to examine all communication exchanged between the inmates, can either be passive or active. A passive warden simply examines the communication to try and determine if it potentially contains secret information. If she suspects a communication to contain hidden information, a passive warden takes note of the detected covert communication, reports this to some outside party and lets the message through without blocking it. An active warden, on the other hand, will try to alter the communication with the suspected hidden information deliberately, in order to remove the information.

Previous week the HEAT-hosted summer educate on FHE and multi-linear map took place. On the final day we learned about in distinguish ability obfuscation from the eminent cryptographer Amit Sahai. The talk was allowed ‘Obfuscation: thrashing secret in Software’ and a synopsis is presented here.

Suppose you want to keep a secret, but some rival has in use more than your mind: whenever you think about the surreptitious, the enemy is clever to study it. While this Orwellian frightening is not realizable for us (at the moment!), in software this happen all the point. This is the primary question of obfuscation; i.e., Can we keep a secret from some adversary if all of the functionality is known? In distinguish ability obfuscation is an attempt to realize this.
However, rear in 2001, black pack obfuscation was optional and ruled out in the same paper, it cannot be achieve for all program. The author goes on to explain and define in-distinguish ability obfuscation (iO) — obfuscating two programs with the equal functionality so the agenda are computationally in tell between clever. Entertainingly, if P=NP then any trail can be obfuscated, and so iO cannot fabricate solidity itself.

This famous document was the first building of iO for NC1 circuit. The author explain a useful possible application: cripple ware. Suppose you are a software vendor and have written a program with lots of functionality, and you want to share out a check report of the software which is somewhat constrained In order to block out trial users from using happy for which they have not yet salaried, one possibility is for you to go through the rules and physically eliminate the block of system for which a full license should be required. In a huge agenda this incredibly rate- and time-inefficient. However, if in its place you purely confine the functionality of the customer boundary and release an obfuscated story of the agenda, this description will not have some functionality outside that which was planned.

Very lately, there have been many attack on multi-linear map, many of which rely on obtain top-level encodings of nil. Since in obfuscation the adversary not at all has admission to encodings of zero, it is resistant to these attacks.