Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique
Reexamination Certificate
2005-12-20
2005-12-20
Morse, Gregory (Department: 2134)
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Particular communication authentication technique
C713S181000, C713S151000, C380S030000
Reexamination Certificate
active
06978372
ABSTRACT:
The correctness of an exponentiation operation or other type of operation associated with a multi-party cryptographic protocol is verified using first and second proofs based on a randomized instance of the operation. A prover generates signals corresponding to information representative of the first and second proofs based on the randomized instance. The first proof is a so-called “blinded” proof that the operation has been correctly performed, configured so as to prevent leaks of information relating to the cryptographic protocol. The second proof is a proof that the first proof has been correctly performed by the prover. The proof information signals are transmitted from the prover to a verifier, and the verifier uses the signals to determine if the operation associated with the cryptographic protocol is valid. For example, the verifier in an illustrative embodiment generates an indication that the operation was correctly performed if the first and second proofs are acceptable to the verifier, generates an indication that the operation was not correctly performed if the first proof is not acceptable but the second proof is acceptable, and generates an indication of a cheating prover if the second proof is not acceptable. The verification protocol can be used in applications in which the prover is distributed across a number of different machines.
REFERENCES:
patent: 4947430 (1990-08-01), Chaum
patent: 5373558 (1994-12-01), Chaum
patent: 5493614 (1996-02-01), Chaum
patent: 6154841 (2000-11-01), Oishi
patent: 6292897 (2001-09-01), Gennaro et al.
Herzberg et al. “Proactive Public Key and Signature Systems”, CCS 97, ACM.
Jakobsson et al.. “Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers”.
Menezes et al. Handbook of Applied Cryptography, 1997, pp. 474-480, §11.8.
Michels et al. “Efficient Convertible Undeniable Signature Schemes (Extended Abstract)”.
Michels et al. “Breaking and repairing a convertible undeniable signature scheme”, CCs '96, 1996, ACM.
Patterson et al. Computer Architecture: A Quantitative Approach, Second Edition, published 1996, pp. 636-639.
Bellare, Mihir et al. “Fast Batch Verification for Modular Exponentiation and Digital Signatures”, Jun. 1998.
Chaum, David et al. “Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result”.
Gennaro, Rosario et al. “Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography”, 1998.
Jakobsson, Markus. “Efficient Oblivious Proofs of Correct Exponentiation”, 1999.
Wolfram, Stephen. “Mathematica: A System for Doing Mathematics by Computer, First Edition”, 1998.
Lyuu, Yuh-Dauh et al. “Group Undeniable Signatures”, National Taiwan University, 2003.
Lyuu, Yuh-Dauh et al. “Convertible Group Undeniable Signatures”, National Taiwan University, 2003.
D. Chaum, “Zero-Knowledge Undeniable Signatures,” Advances in Cryptology-Proceedings of Euro-Crypt, pp. 458-464, 1990.
T.P. Pedersen, “Distributed Provers with Applications to Undeniable Signatures,” Advances in Cryptology-Proceedings of EuroCrypt, pp. 221-242, 1991.
A. Fujioka et al., “Interactive Bi-Proof Systems and Undeniable Signature Techniques,” Advances in Cryptology-Proceedings of EuroCrypt, pp. 243-256, 1991.
D. Chaum and H. Van Antwerpen, “Undeniable Signatures,” Advances in Cryptology-Proceedings of Crypto '89, pp. 212-216.
M. Jakobsson and M. Yung, “Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers,” Crypto '96, pp. 186-200.
Lucent Technologies - Inc.
Morse Gregory
Simitoski Michael J
LandOfFree
Verification of correct exponentiation or other operations... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Verification of correct exponentiation or other operations..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verification of correct exponentiation or other operations... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3474019