Sciweavers

3 search results - page 1 / 1
» Non-malleable Encryption: Equivalence between Two Notions, a...
Sort
View
CRYPTO
1999
Springer
87views Cryptology» more  CRYPTO 1999»
13 years 9 months ago
Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
We prove the equivalence of two definitions of non-malleable encryption appearing in the literature— the original one of Dolev, Dwork and Naor and the later one of Bellare, Desa...
Mihir Bellare, Amit Sahai
ICALP
2005
Springer
13 years 10 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi
LPAR
2007
Springer
13 years 10 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune