Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique
Reexamination Certificate
2011-08-16
2011-08-16
Orgad, Edan (Department: 2439)
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Particular communication authentication technique
C713S168000, C380S028000, C380S029000, C380S030000
Reexamination Certificate
active
08001384
ABSTRACT:
A verification device stores verification information and first random information in a storage. The verification information depends upon contents of comparative information, and not upon an information volume of the comparative information. The verification device generates an authentication information generation factor using the first random information and transmits the factor to a proving device, which generates authentication information using the authentication information generation factor and held information and transmits the authentication information to the verification device. The authentication information depends upon contents of the authentication information generation factor and the held information, and not upon the information volume of the held information. A decision section of the verification device decides whether a predetermined relationship is established between the authentication information and the verification information and the first random information. Thereby, the verification device verifies the held information stored in the proving device is the same as the comparative information.
REFERENCES:
patent: 5497423 (1996-03-01), Miyaji
patent: 6076163 (2000-06-01), Hoffstein et al.
patent: 6480605 (2002-11-01), Uchiyama et al.
patent: 6567916 (2003-05-01), Terao et al.
patent: 6666381 (2003-12-01), Kaminaga et al.
patent: 2005/0114662 (2005-05-01), Meyer et al.
patent: 2005/0117751 (2005-06-01), Furukawa
patent: 06-188874 (1994-07-01), None
patent: 07-281595 (1995-10-01), None
A. Menezes, et al.,“Identification and Entity Authentication”, Handbook of Applied Cryptography, XP-002262234, Jan. 1, 1997, pp. 385-424.
A. Menezes, et al., “Handbook of Applied Cryptography, passage”, Handbook of Applied Cryptography, XP-002326542, Jan. 1, 1997, pp. 425-488.
David Pointcheval, “The Composite Discrete Logarithm and Secure Authentication”, Lecture Notes in Computer Science, vol. 1751, pp. 113-128, 1 Cover page.
Go Yamamoto, et al., “An Efficiently-Verifiable Zero-Knowledge Argument for Proofs of Knowledge”, IEICE Technical Report, vol. 105, No. 194, Jul. 2005 pp. 41-45.
Tetsu Iwata, et al., “OMAC: One-Key CBC MAC”, LNCS 2887, 2003, pp. 129-153.
Gary Miller, “Riemann's Hypothesis and Tests for Primality”, Journal of Computer Systems Science, vol. 13, 1976, pp. 234-239.
Joy Algesheimer, et al., “Efficient Computation Modulo A Shared Secret With Application to the Generation of Shared Safe-Prime Products”, Crypto 2002, 2002, pp. 417-432.
H. Anton, et al., “Elementary Linear Algebra With Applications”, John Wiley and Sons, 2005, pp. 211-217.
O. Goldreich, “Foundations of Cryptography”, Cambridge University Press, vol. 1, 2001, pp. 262-267.
Ronald Cramer, “Modular Design of Secure Yet Practical Cryptographic Protocols”, CWI and University of Amsterdam, Nov. 1996, pp. 1-187.
Mihir Bellare, et al., “The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols”, Advances in Cryptology . . . Crypto 2004, 2004, pp. 273-289.
Uriel Feige, et al., “Zero-Knowledge Proofs of Identity”, Journal of Cryptology, vol. 1, 1988, pp. 77-94.
Satoshi Hada, et al., “On the Existence of 3-Round Zero-Knowledge Protocols”, Advances in Cryptology '98, 1998, pp. 408-423.
Dan Boneh, et al., “Efficient Generation of Shared RSA Keys”, Crypto '97, vol. 1294, 1997, pp. 425-439.
Ivan Damgard, et al., “A Statistically-Hiding Integer Commitment Scheme Based on Groups With Hidden Order”, Asiacrypt 2002, vol. 2501, 2002, pp. 125-142.
Eiichiro Fujisaki, et al., Statistical Zero Knowledge Protocols to Prove Modular Polynominal Relations, Advances in Cryptology '97, 1997, pp. 16-30.
Guillaume Poupard, et al., “Generation of Shared RSA Keys by Two Parties”, Asiacyrpt '98, vol. 1514, 1998, pp. 11-24.
C.P. Schnorr, “Efficient Signature Generation by Smart Cards”, Journal of Cryptology, vol. 4, 1991, pp. 161-175.
Go Yamamoto, et al., “Efficient Protocols for Verification of Massive Secret Data and Their Application”, SCIS 2006, Jan. 2006, 27 pages, (with full English Translation).
Josh Benaloh, et al. “One-Way Acumulators: A Decentralized Alternative to Digital Signatures”. In Advances In Cryptology-Eurocrypt '93, vol. 765 of Lecture Notes in Computer Science, pp. 274-285, 1993.
Michael T. Goodrich, et al. “An Efficient Dynamic and Dsitributed Cryptographic Accumulator”. In Information Security, vol. 2433 of Lecture Notes in Computer Science, pp. 372-388, 2002.
Jan Camenisch, et al. “Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials”. In Advances in Cryptology-Crypto 2002, vol. 2442 of Lecture Notes in Computer Science, pp. 61-76, 2002.
Fujisaki Eiichiro
Yamamoto Go
Nippon Telegraph and Telephone Corporation
Oblon, Spivak McClelland, Maier & Neustadt, L.L.P.
Orgad Edan
Shaw Yin-Chen
LandOfFree
Authentication system, authentication method, attesting... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Authentication system, authentication method, attesting..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Authentication system, authentication method, attesting... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2774046