Perfectly secure password protocols in the bounded retrieval model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3876 LNCS, Issue , 2006, Pages 225-244

  Di Crescenzo, Giovanni ^a   Lipton, Richard ^b   Walfish, Shabsi ^c  

^a TELCORDIA TECHNOLOGIES   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; INFORMATION RETRIEVAL SYSTEMS; MATHEMATICAL MODELS; SECURITY OF DATA; SERVERS;

BANDWIDTH-LIMITED CHANNELS; BOUNDED RETRIEVAL MODEL; CRYPTOGRAPHIC TASKS; PASSWORD PROTOCOLS;

NETWORK PROTOCOLS;

EID: 33745629609     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_12     Document Type: Conference Paper

References (27)

1. S. Axelsson. Research in Intrusion-Detection systems: A Survey, in Technical Report 98-17, Dept. of Comp. Eng., Chalmers, Univ. of Technology, Goteborg, Sweden, 1998, http://citeseer.ist.psu.edu/axelsson98research.html.
2. S. Bellovin and M. Merrit. Encrypted Key Exchange, in Proc. of the 1992 Internet Society Network and Distributed System Security Symposium.
3. S. Bellovin and M. Merrit. Augmented Encrypted Key Exchange, in Proc. of the 1st ACM Conference on Computer and Communication Security, pp. 224-250
4. G. R. Blakley. Safeguarding cryptographic keys. In Proc. of the National Computer Conference, v.48, pp. 242-268, 1979.
5. G. Di Crescenzo, A. Ghosh, and R. Talpade. Towards a Theory of Intrusion Detection. In Proc. of European Symposium on Research in computer Security (ESORICS 2005), vol. 3679 of LNCS, pp. 267-286, Springer-Verlag.
6. Y. Dodis, A. Sahai, A. Smith. On Perfect and Adaptive Security in ExposureResilient Cryptography. In Proc. of EUROCRYPT 2001, vol. 2045 of LNCS, pp. 301-324. Springer-Verlag.
7. Password Protocols provably secure in the Bounded Retrieval Model, first public version of this work, unpublished draft, April 2005.
8. D.C. Feldmeier and P.R. Karn. UNIX Password Security - Ten Years Later, in Proceedings of Crypto'89, LNCS, no. 435, Springer-Verlag, pp. 44-63
9. S. Halevi and H. Krawczyk. Public-key Cryptography and Password Protocols. In Proc. of the 5th annual ACM conference on Computer and Communications Security, pp. 122-131, 1998
10. John Kelsey and Bruce Schneier. Authenticating Secure Tokens Using Slow Memory Access. USENIX Workshop on Smart Card Technology, USENIX Press, pp. 101-106, 1999.
11. Chi-Jen Lu. Encryption against storage-bounded adversaries from on-line strong extractors. Journal of Cryptology, vol. 17, no. 1, pp. 27-42, 2004.
12. Stefan Dziembowski and Ueli Maurer. Optimal Randomizer Efficiency in the Bounded-Storage Model, In Journal of Cryptology, vol. 17, no. 1, pp. 5-26.
13. Ueli Maurer. Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher. Journal of Cryptology, vol. 5, no. 1, pp. 53-66, 1992.
14. Tal Moran, Ronen Shaltiel, Amnon Ta-Shma. Non-interactive Timestamping in the Bounded Storage Model. In Proc. of CRYPTO 2004, vol. 3152 of LNCS, pp. 460-476. Springer-Verlag.
15. R. Morris and K. Thompson. Password Security: A Case History, in Communications of the ACM, Vol. 22, no. 11, 1979, pp. 594-597.
16. N. Nisan and A. Ta-Shma. Extracting Randomness: A Survey and New Constructions, in Journal of Computer and System Sciences, February 1999, vol. 58, no. 1, pp. 148-173(26)
17. N. Nisan and D. Zuckerman. More Deterministic Simulation in Logspace, in Proc. of ACM STOC 93.
18. S. Patel. Number theoretic attacks on secure password schemes, in Proc. of the 1997 IEEE Symposium on Security and Privacy.
19. Benny Pinkas and Tomas Sander. Securing Passwords Against Dictionary Attacks. ACM CCS-9: Computer and Communications Security, Nov., 2002.
20. N. Provos and D. Mazieres, A Future-Adaptable Password Scheme, In Proceedings of the Annual USENIX Technical Conference, 1999.
21. O. Reingold, S. Vadhan, and A. Wigderson. Entropy Waves, The Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors, in Electronic Colloquium on Computational Complexity TR01-018; other versions in Proceedings of FOCS 8000 and Annals of Mathematics, vol. 155, pp. 157-187, 2002.
22. A. Shamir. How to Share a Secret. Communications of the ACM, Volume 22, Issue 11 (November 1979)
23. R. Shaltiel. Recent developments in Explicit Constructions of Extractors. Bulletin of the EATCS, 77:67-95, 2002.
24. M. Sipser. Expanders, Randomness and Time vs. Space, in Journal of Computer and System Sciences, vol. 36, 1988.
25. S. P. Vadhan. On constructing locally computable extractors and cryptosystems in the bounded storage model. Journal of Cryptology, vol. 17, no. 1, pp. 43-77, 2004.
26. T. Wu, The secure remote password protocol, in Proc. of the 1998 Internet Society Network and Distributed System Security Symposium 27. http://money.cnn.com/2003/02/18/technology/creditcards/
27. http://www.detnews.com/2005/technology/0506/18/tech-219662.htm