Abstract
We consider an imbalanced wireless network setup in which a low-power client communicates with a powerful server. We assume that public key cryptographic operations such as Diffie-Hellman key exchange conducted over a large multiplicative group is too computationally intensive for a low-power client to implement. In this paper, we propose an authenticatedk ey exchange protocol such that it is efficient enough to be implemented on most of the target low-power devices such as devices in sensor networks, smart cards and low-power Personal Digital Assistants. In addition, it is secure against dictionary attacks. Our scheme requires less than 2.5 seconds of pure computation on a 16MHz Palm V andab out 1 secondfor data transmission if the throughput of a network is 8 kbps. The computation time can be improvedto 300 msec and the transmision time can also be reduced to 300 msec if caching is allowed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62–73, Fairfax, 1993. ACM.
S. M. Bellovin and M. Merritt. Encrypted key exchange: Password based protocols secure against dictionary attacks. In Proceedings 1992 IEEE Symposium on Research in Security and Privacy, pages 72–84. IEEE Computer Society, 1992.
Victor Boyko, Philip MacKenzie, and Sarvar Patel. Provably secure passwordauthenticated key exchange using diffie-hellman. In Proc.EUR OCRYPT 2000, pages 156–171, 2000.
J. Daemen and V. Rijmen. AES proposal: Rijndael. AES Algorithm Submission, Sep 1999. http://www.nist.gov/aes.
L. Gong, M. A. Lomas, R. M. Needham, and J. H. Saltzer. Protecting poorly chosen secrets from guessing attacks. IEEE Journal on Selected Areas in Communications, 11(5):648–656, 1993.
David P. Jablon. Strong password-only authenticated key exchange. Computer Communication Review, ACM, 26(5):5–26, 1996.
Jonathan Katz, Rafail Ostrovsky, and Moti Yung. Efficient password-authenticated key exchange using human-memorable passwords. In Proc.EUR OCRYPT 2001. Springer-Verlag, 2001. Lecture Notes in Computer Science No. 2045.
Taekyoung Kwon. Ultimate solution to authentication via memorable password. Contribution to the IEEE P1363 Study Group, May 2000.
H. W. Lenstra, Jr. Divisors in residue classes. Mathematics of Computation, 42(165):331–340, 1984.
Stefan Lucks. Open key exchange: How to defeat dictionary attacks without encrypting public keys. In Proc. of the Security Protocols Workshop, pages 79–90, 1997. LNCS 1361.
Philip MacKenzie, Sarvar Patel, and Ram Swaminathan. Password-authenticated key exchange basedon RSA. In Proc. ASIA CRYPT 2000, pages 599–613, 2000.
Philip MacKenzie and Ram Swaminathan. Secure network authentication with password identification. Submitted to IEEE P1363a, 1999.
Duncan S. Wong. On the design andanalysis of authenticated key exchange schemes for low power wireless computing platforms. Ph.D. Thesis, July 2002.
Duncan S. Wong, Hector Ho Fuentes, and Agnes H. Chan. The performance measurement of cryptographic primitives on palm devices. In Proc. of the 17th Annual Computer Security Applications Conference, Dec 2001.
Thomas Wu. The secure remote password protocol. In 1998 Internet Society Symposium on Network and Distributed System Security, pages 97–111, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, F., Wong, D.S., Chan, A.H., Ye, R. (2002). Password Authenticated Key Exchange Based on RSA for Imbalanced Wireless Networks. In: Chan, A.H., Gligor, V. (eds) Information Security. ISC 2002. Lecture Notes in Computer Science, vol 2433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45811-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-45811-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44270-7
Online ISBN: 978-3-540-45811-1
eBook Packages: Springer Book Archive