Sciweavers

25 search results - page 3 / 5
» Soundness of Formal Encryption in the Presence of Active Adv...
Sort
View
ICALP
2005
Springer
13 years 11 months ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
Mathieu Baudet, Véronique Cortier, Steve Kr...
TGC
2007
Springer
14 years 8 days ago
Computational Soundness of Equational Theories (Tutorial)
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...
Steve Kremer
CCS
2008
ACM
13 years 8 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier
ESORICS
2009
Springer
14 years 6 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
ESOP
2005
Springer
13 years 11 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi