Implicit certificate verification

Details Implicit certificate verification Implicit certificate verification

2007-11-15

2011-11-29

Zee, Edward (Department: 2435)

Electrical computers and digital processing systems: support

Multiple computer communication using cryptography

Central trusted authority provides computer authentication

C713S171000

Reexamination Certificate

active

08069346

ABSTRACT:
A method of computing a cryptographic key to be shared between a pair of correspondents communicating with one another through a cryptographic system is provided, where one of the correspondents receives a certificate of the other correspondents public key information to be combined with private key information of the one correspondent to generate the key. The method comprises the steps of computing the key by combining the public key information and the private key information and including in the computation a component corresponding to verification of the certificate, such that failure of the certificate to verify results in a key at the one correspondent that is different to the key computed at the other correspondent.

REFERENCES:
patent: 5889865 (1999-03-01), Vanstone et al.
patent: 6122736 (2000-09-01), Vanstone et al.
patent: 6243467 (2001-06-01), Reiter et al.
patent: 6792530 (2004-09-01), Qu et al.
patent: 7702105 (2010-04-01), Gura et al.
patent: 2003/0044003 (2003-03-01), Chari et al.
patent: 2005/0114651 (2005-05-01), Qu et al.
patent: 2005/0193219 (2005-09-01), Vanstone
patent: 2007/0064932 (2007-03-01), Struik et al.
patent: WO 99/20020 (1999-04-01), None
patent: WO 99/49612 (1999-09-01), None
patent: WO 00/44127 (2000-07-01), None
Aditva, R. et al.; “Batch Verification for Equality of Discrete Log-arithms and threshold Decryptions”, in Proceedings of Applied Cryptography and Network Security; 2004; Jakobsson, M; Yung, M; Zhou, J. (Eds); ACNS 2004; Lecture Notes in Computer Science, 2004; pp. 494 to 508, vol. 3089; Springer-Verlag, New York.
Cao, T. et al.; “Security Analysis of Some Batch Verifying Signatures from Pairings”, International Journal of Network Security; Sep. 2006; pp. 138 to 143; vol. 3, No. 2.
Cheon, J.H.; Lee, D.H.; “Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations”; International Association for Cryptologic Research; IEEE Transactions on Computers; Dec. 2006; pp. 1536 to 1542; vol. 55, No. 12; copy retrieved from http://eprint.iacr.org/2005/276.pdf.
Chevallier-Mames, B. et al.; “Low-Cost Solutions for Preventing Simple Side Channel Analysis: Side-Channel Atomicity” International Association for Cryptologic Research, IEEE Transactions on Computer; Jun. 2004; pp. 760 to 768; vol. 53, No. 6; copy retrieved from http://eprint.iacr.org/2003/237.pdf.
Chevallier-Mames, B.; “Self-Randomized Exponentiation Algorithms” in Proceedings of Topics in Cryp-tology—CT-RSA 2004; Okamota T. (Ed.); Lecture Notes in Computer Science; 2004; pp. 236 to 248; vol. 2964, Springer-Verlag, New York.
Diffie, W. and Hellman, Martin E., “New Directions in Cryptography”: IEEE Transactions on Information Theory; Nov. 1976; pp. 644 to 654; vol. IT-22, No. 6.
Johnson, D. et al.: “The Elliptic Curve Digital Signature Algorithm (ECDSA)”; Aug. 1, 2001; pp. 36 to 63; International Journal of Information Security; vol. 1, No. 1; Published on-line Jul. 27, 2001.
Kocher, Paul C.; “Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems”; Advances in Cryptology—CRYPTO '96, Lecture Notes in Computer Science; 1996; pp. 104 to 113; vol. 1109, Springer-Verlag, New York.
Law, Laurie et al.; “An Efficient Protocol for Authenticated Key Agreement”; Designs, Codes and Cryptography; 2003; pp. 119 to 134; Kluwer Academic Publishers.
Lamacchia, B. et al.; “Stronger Security of Authenticated Key Exhange”; Provable Security; Susilo et al (Eds.); 2007; pp. 1 to 16; Lecture Notes in Computer Science; vol. 4784; Springer-Verlag, New York; copy retrieved from http://eprint.iacr.org/2006/073.pdf.
Lim, C.H. and Lee, P.J.; “On the Security of Interactive DSA Batch Verification”; Electronic Letters; Sep. 15, 1994; pp. 1592 to 1593, vol. 30, No. 19.
Proos, J.; “Joint Sparse Forms and Generating Zero Columns when Combing”; Centre for Applied Cryptographic Research; Corr 2003-23; 2003; University of Waterloo; Ontario, Canada.
Solinas, J., “Low-weight Binary Representations for Pairs of Integers”; Centre for Applied Cryptographic Research, Corr 2001-41; 2001; Univeristy of Waterloo; Ontario, Canada.
Public Key Cryptography for the Financial Services Industry, Key Agreement and Key Transport Using Elliptic Curve Cryptography; X9.63-2001; Nov. 20, 2001; pp. 47 to 117; American National Standards Institute; American Bankers Association.
Hankerson, Darrel et al.; Guide to Elliptic Curve Cryptography; 2004; pp. 98 to 101; Springer-Verlag, New York.
Antipa, A. et al.; “Accelerated Verification of ECDSA Signatures”; Proceedings of Selected Areas in Cryptography—SAC2005; Lecture Notes In Computer Science; 2006; pp. 307 to 318, vol. 3897; Springer, New York.
Bellare, M. et al.; “Fast Batch Verification for Modular Exponentiation and Digital Signatures”; Proceedings of Advances in Cryptology—Eurocrypt'98; Lecture Notes in Computer Science; 1998; pp. 236 to 250, vol. 1403; Springer-Verlag, New York.
Engel, Lawrence J.; International Search Report from PCT/CA2007/002049 completed Feb. 7, 2008 and received by the applicant on Mar. 17, 2008.
Menezes, A. et al.; Handbook of Applied Cryptography; 1997; pp. 397 to 399; CRC Press, U.S.A.
San Millan Maeso, J.; Search Report from corresponding European Application No. 07845519.3, search completed Jul. 2, 2010.

Affiliated with

Also associated with

Rating

Implicit certificate verification does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Implicit certificate verification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Implicit certificate verification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4278845