The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Growth Of Verification Complexity ASIC/SOC design size and complexity is growing at unprecedented rates, and this is driving more than exponential growth in the verification effort for these designs. This in turn is driving increasing investment in the HW infrastructure needed to support verification - to the point of becoming unsustainable. Even when companies can afford the cost of such expansion,...
In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rusinowitch and M. Turuani [1] stated for the untimed case. We show that the extension to time and the increased power of the intruder model we propose do not affect the complexity of the problem which remains NP-Complete.
Today's communication systems are often vulnerable to wormhole or relaying attacks, leading to severe security problems. Distance Bounding (DB) protocols are authentication protocols designed to protect against these attacks. They determine an upper bound on the physical distance between two communication parties-the verifier V (e.g. a door requiring an access key) and the prover P (e.g. a wireless...
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on their transitions. A system is K-step opaque if the entrance of the system state within the last K observations to a set of secret states remains opaque to an intruder who has complete knowledge of the system model and observes...
Live streaming is one of many applications where data is continuously created, and has to be quickly distributed among a large number of users. The peer-to-peer paradigm is thereby attracting interest with the prospect of overcoming scalability issues of more centralized approaches. Since data blocks travel along multiple (possibly malicious) peers, authenticating the origin of blocks becomes of prime...
This paper presents principles and results of dynamic testing of an SRAM-based FPGA using time- resolved fault injection with a pulsed laser. The synchronization setup and experimental procedure are detailed. Fault injection results obtained with a DES crypto-core application implemented on a Xilinx Virtex II are discussed.
This paper proposed a two layer authorization mechanism, including traditional password system and rhythm recognition. The whole system includes two phases: preprocessing and usual operation for users. In preprocessing phase, users type password in a specific rhythm in order to record and analyse the characteristics of behaviour of users. In the second phase, how to verify a user in usual operation...
Expected growth in use and implementation of wireless sensor networks (WSNs) in different environments and for different applications creates new security challenges. In WSNs, a malicious node may initiate incorrect path information, change the contents of data packets, and even hijack one or more genuine network nodes. As the network reliability completely depends on individual nodespsila presence...
Zero-day attacks - especially those that hide the attack exploit by using code obfuscation and encryption - remain a formidable challenge to existing network defenses. Many techniques have been developed that can address known attacks and similar new attacks that may arise in the future. Some methods, like Earlybird and Polygraph, focus on string-based content prevalence in payloads; others focus...
Packet sampling supports a range of Internet measurement applications including characterizing the spatial flow of traffic through a network for traffic engineering purposes, identifying the flows utilizing a link for billing purposes or for intrusion detection, and monitoring end-to-end data-path quality. However, packet-sampling mechanisms must be robust to adversarial hosts that craft packet streams...
New definitions are proposed for the security of Transient-Key Cryptography (a variant on Public-Key Cryptography) that account for the possibility of super-polynomial-time, Monte Carlo cryptanalytic attacks. The basic question we address is: how can one relate the amount of time a cryptanalyst is willing to spend decoding cryptograms to his likelihood of success? This question and others are partially...
It seems very difficult to give a formal definition of computational security for Public Key Cryptography. We define a slightly different notion, called Transient-Key Cryptography, for which a natural definition of security against chosen-plaintext-attacks can be given. The main result presented here is the existence of a relativized model of computation under which there exists a provably secure...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.