Sciweavers

20 search results - page 1 / 4
» Weak Key Authenticity and the Computational Completeness of ...
Sort
View
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
13 years 11 months ago
Weak Key Authenticity and the Computational Completeness of Formal Encryption
Abstract. A significant effort has recently been made to rigorously relate the formal treatment of cryptography with the computational one. A first substantial step in this dire...
Omer Horvitz, Virgil D. Gligor
FC
2005
Springer
98views Cryptology» more  FC 2005»
13 years 11 months ago
Secure Biometric Authentication for Weak Computational Devices
This paper presents computationally “lightweight” schemes for performing biometric authentication that carry out the comparison stage without revealing any information that can...
Mikhail J. Atallah, Keith B. Frikken, Michael T. G...
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
14 years 6 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
PKC
2009
Springer
240views Cryptology» more  PKC 2009»
14 years 6 months ago
Distributed Public-Key Cryptography from Weak Secrets
Abstract.We introduce the notion of distributed password-based publickey cryptography, where a virtual high-entropy private key is implicitly dened as a concatenation of low-entrop...
Céline Chevalier, David Pointcheval, Michel...
JDCTA
2010
150views more  JDCTA 2010»
13 years 13 days ago
Provable Password-Authenticated Key Exchange Protocol against Imposter Attack on Ad Hoc Networks
In wireless ad hoc networks environment, Bellovin and Merritt first developed a password-based Encrypted Key Exchange (EKE) protocol against offline dictionary attacks using both ...
Ang Gao