Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique
Patent
1997-10-20
2000-06-13
Swann, Tod R.
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Particular communication authentication technique
713170, 713176, 380 28, 380 30, H04L 932, H04L 928, H04L 930
Patent
active
060761636
ABSTRACT:
Methods and apparatus for providing secure user identification or digital signatures based on evaluation of constrained polynomials. In an exemplary user identification technique, a prover sends a verifier a commitment signal representative of a first polynomial satisfying a first set of constraints. The verifier sends the prover a challenge signal representative of a second polynomial satisfying a second set of constraints. The prover generates a response signal as a function of (i) information used to generate the commitment signal, (ii) a challenge signal, and (iii) a private key polynomial of the prover, such that the response signal is representative of a third polynomial satisfying a third set of constraints. The verifier receives the response signal from the prover, and authenticates the identity of the prover by evaluating a function of information contained in at least a subset of (i) the commitment signal, (ii) the challenge signal, (iii) the response signal and (iv) a public key of the prover. In a digital signature technique, the challenge signal may be generated by the prover applying a hash function to (i) a message and (ii) information used to generate the commitment signal, and the prover sends the message to the verifier. The verifier uses a result of applying the hash function to the message and the commitment signal to authenticate a digital signature of the prover. The constraints on the polynomials are selected such that an attacker will find it very difficult to recover the private key polynomial from the partial information sent between the prover and verifier.
REFERENCES:
patent: 4956863 (1990-09-01), Goss
patent: 5202921 (1993-04-01), Herzberg et al.
patent: 5231668 (1993-07-01), Kravitz
patent: 5297206 (1994-03-01), Orton
patent: 5345507 (1994-09-01), Herzberg et al.
patent: 5375170 (1994-12-01), Shamir
patent: 5442707 (1995-08-01), Miyaji et al.
patent: 5497423 (1996-03-01), Miyaji
patent: 5799088 (1998-08-01), Raike
patent: 5889865 (1999-03-01), Vanstone et al.
Brickell et al., "Interactive Identification and Digital Signatures", AT&T Technical Journal, pp. 73-86, Nov./Dec. 1991.
Guillou et al., "A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory", Centre Commun d'Etudes de Telediffusion et Telecommunications, pp. 123-128.
Schnorr, "Efficient Identification and Signatures For Smart Cards", European Patent Appln. 89103290.6, pp. 239-252, Feb. 24, 1989.
Hoffstein Jeffrey
Kaliski, Jr. Burton S.
Lieman Daniel Bennett
Robshaw Matthew John Barton
Yin Yiqun Lisa
Darrow Justin T.
RSA Security Inc.
Swann Tod R.
LandOfFree
Secure user identification based on constrained polynomials does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Secure user identification based on constrained polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure user identification based on constrained polynomials will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2079158