Learn More
Computer-aided verification provides effective means of analyzing the security of cryptographic primitives. However, it has remained a challenge to achieve fully automated analyses yielding guarantees that hold against computational (rather than symbolic) attacks. This paper meets this challenge for public-key encryption schemes built from trapdoor(More)
Recent work on structure-preserving signatures studies optimality of these schemes in terms of the number of group elements needed in the verification key and the signature, and the number of pairing-product equations in the verification algorithm. While the size of keys and signatures is crucial for many applications, another important aspect to consider(More)
Information theory and the framework of information dynamics have been used to provide tools to characterise complex systems. In particular, we are interested in quantifying information storage , information modification and information transfer as characteristic elements of computation. Although these quantities are defined for autonomous dynamical(More)
—We present a general approach for the symbolic analysis of security protocols that use Diffie-Hellman expo-nentiation to achieve advanced security properties. We model protocols as multiset rewriting systems and security properties as first-order formulas. We analyze them using a novel constraint-solving algorithm that supports both falsification and(More)
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, in-ductive, trace-based, symbolic approaches with a formal-ization of physical properties of the environment, namely communication, location, and time. In particular, communication is subject to physical constraints, for example, message transmission(More)
Traditional security protocols are mainly concerned with key establishment and principal authentication and rely on predistributed keys and properties of cryptographic operators. In contrast, new application areas are emerging that establish and rely on properties of the physical world. Examples include protocols for secure localization, distance bounding,(More)
We initiate the study of principled, automated, methods for analyzing hardness assumptions in generic group models, following the approach of symbolic cryptography. We start by defining a broad class of generic and symbolic group models for different settings—symmetric or asymmetric (leveled) k-linear groups—and by proving " computational soundness "(More)
Recent research has established that successful collaborative modeling requires a more active role of domain experts in the modeling process. Yet, tool support for this endeavor is still lacking. Large touchscreens could serve as a platform for easy-to-use modeling tools that address this problem. However, these devices pose new challenges for interaction(More)