Sciweavers

Share
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
9 years 6 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
STACS
2005
Springer
9 years 6 months ago
Deciding Properties of Contract-Signing Protocols
Abstract. We show that for infinite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style certain fundamental branching properties are decidable. ...
Detlef Kähler, Ralf Küsters, Thomas Wilk...
RTA
2005
Springer
9 years 6 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
PPDP
2005
Springer
9 years 6 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...
EUROCRYPT
2005
Springer
9 years 7 months ago
Secure Remote Authentication Using Biometric Data
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafai...
ACSAC
2005
IEEE
9 years 7 months ago
Code Security Analysis of a Biometric Authentication System Using Automated Theorem Provers
Understanding the security goals provided by cryptographic protocol implementations is known to be difficult, since security requirements such as secrecy, integrity and authentici...
Jan Jürjens
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
9 years 7 months ago
Universally Composable Security with Global Setup
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi W...
RTA
2007
Springer
9 years 7 months ago
Intruders with Caps
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
Siva Anantharaman, Paliath Narendran, Michaël...
LPAR
2007
Springer
9 years 7 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
CRYPTO
2007
Springer
110views Cryptology» more  CRYPTO 2007»
9 years 7 months ago
Cryptography in the Multi-string Model
The common random string model introduced by Blum, Feldman and Micali permits the construction of cryptographic protocols that are provably impossible to realize in the standard m...
Jens Groth, Rafail Ostrovsky
books