Method for two-party authentication and key agreement

Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C713S156000, C713S168000, C713S169000, C713S152000, C380S247000, C380S248000, C380S249000, C455S411000

Reexamination Certificate

active

06918035

ABSTRACT:
According to the two party authentication method, a first party generates and transfers a random number to a second party as a first challenge. The second party increments a count value in response to the first challenge, generates a first challenge response by performing a keyed cryptographic function (KCF) on the first challenge and the count value using a first key, and transfers the count value, as a second challenge, and the first challenge response to the first party. The first party verifies the second party based on the first challenge, the second challenge and the first challenge response. The first party also generates a second challenge response by performing the KCF on the second challenge using the first key, and transfers the second challenge response to the second party. The second party verifies the first party based on the second challenge and the second challenge response. For instance, the first and second parties can be a network and mobile, respectively, in a wireless system. Also, based on the first and second challenges, both the first and second parties may generate another key.

REFERENCES:
patent: 5153919 (1992-10-01), Reeds, III et al.
patent: 5351293 (1994-09-01), Michener et al.
patent: 5371794 (1994-12-01), Diffie et al.
patent: 5515439 (1996-05-01), Bantz et al.
patent: 5559886 (1996-09-01), Dent et al.
patent: 5577121 (1996-11-01), Davis et al.
patent: 5594795 (1997-01-01), Dent et al.
patent: 5659617 (1997-08-01), Fischer
patent: 5841866 (1998-11-01), Bruwer et al.
patent: 5991617 (1999-11-01), Powell
patent: 6014085 (2000-01-01), Patel
patent: 19523466 (1997-04-01), None
patent: WO9826534 (1998-06-01), None
Menezes et al, Handbook of Applied Cryptography, Section 10.3, pp. 397-405, 1996.
International Search Report for EP 99 30 5704 Mailed Dec. 22, 2000.
M. Bellare and P. Rogaway, Entity authentication and key distribution,Advances in Cryptology—Crypto, 1993.
S. Bellovin and M. Merritt, Encrypted key exchange: password-based protocols secure against dictionary attacks,IEEE computer society symposium on research in security and privacy, 72-84 May 1992.
R. Bird, I. Gopal, A. Herzberg, P. Janson, S. Kutten, R. Molva, and M. Yung, Systematic design of two-party authentication protocols,Advances in Cryptology—Crypto, 1991.
M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo random bits,SIAM J. Computing, 13 No. 4:850-864, 1984.
R. B. Boppana and R. Hirschfeld, Pseudorrandom generators and complexity classes,Advances in Computing Research, 5 (S. Micali, Ed.), JAI Press, CT.
U.S. Department of Commerce/N.I.S.T.,Digital Signature Standard, FIPS 186, May 1994.
O. Goldreich and L. A. Levin, A hard-core predicate for all one way functions,Proceedings of 21stSTOC, 25-32, 1989.
S. Goldwasser and A. Micali, Probabilistic encryption,Journal of Computer and Systems Science, 28: 270-299, 1984.
L. Gong, T. Lomas, R. Needham and J. Saltzer, Protecting poorly chosen secrets from guessing attacks,IEEE Journal on Selected Areas in Communications, 11(5): 648-656, Jun. 1993.
EIA/TIA, Cellular RadioTelecommunications Intersystem Operations IS-41 Rev. D, 1997.
T. Lomas, L. Gong, J. Saltzer and R. Needham, Reducing Risks from Poorly Chosen Keys,Proceedings of the 12thACM Symposium on Operating System Principles, ACM Operating Systems Review, 23(5): 14-18, Dec. 1989.
S. Patel, Information Leakage in Encrypted Key Exchange,Proceedings of DIMACS workshop on Network Threats, 38: 33-40, Dec. 1996.
S. Patel, Number theoretic attacks on secure password schemes,IEEE symposium on security and privacy, 236-247, May 1997.
S. Patel, Weaknesses of the north american wireless authentication protocol,IEEE Personal Communications, 40-44, Jun. 1997.
A. C. Yao, Theory and applications of trapdoor functions,Proceedings of 23rdFOCD, 80-91, 1982.
M. Beller, L. Chang and Y. Yacobi, Privacy and authentication on a portable communication system,IEEE J. Selected Areas in Communications, 11(6): 821-829, 1993.
C. Carroll, Y. Frankel and Y. Tsiounis, Efficient key distribution for slow computing devices: Achieving fast over the air activation for wireless systems,IEEE symposium on security and privacy, May 1998.
TIA/EIA Interim Standard,Over-the Air Service Provisioning of Mobile Stations in Spread Spectrum Systems, IS-683-A, Jun. 1998.
E. Blossom, The VPI Protocol for Voice Privacy Devices, Dec. 1996.
O. Goldreich, S. Goldwasser and A. Micali, On the cryptographic applications of random functions,Advances in Cryptology—Crypto, 1984.
D. Jablon, Strong Password-Only Authenticated Key Exchange,ACM SIG-COMM Computer Communications Review, Oct. 1996.
S. Lucks, Open Key Exchange: How to defeat dictionary attacks without encrypting public keys, Proceedings of the Security Protocol Workshop '97, 1997.
Oded Goldreich, Shafi Goldwasser, Silvio Micali, How to Construct Random Functions, Journal of the Association for Computing Machinery, vol. 33, No. 4, pp. 792-807, Oct. 1986.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method for two-party authentication and key agreement does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for two-party authentication and key agreement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for two-party authentication and key agreement will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3401627

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.