Zero-knowledge proving system and method

Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C380S028000

Reexamination Certificate

active

07003541

ABSTRACT:
A zero-knowledge proving system includes a proving mechanism for proving equality or inequality of two discrete logarithms and a verifying mechanism for verifying said equality or inequality. The proving mechanism stores public information including a designated operation scheme, two input numbers α and β, and two predetermined bases g and h, private information x which is a discrete logarithm of α to the base g. After converting α, β and h to produce α′, β′ and γ′ as follows: α′=αr; β′=βr; and γ′=hxr, the equality of a logαα′ and logββ′ and the equality of loggα′ and loghγ′ are proved. The verifying mechanism verifies the equality of a logαα′ and logββ′ and the equality of loggα′ and loghγ′. Then, the received β′ and γ′ are checked to determine the equality or inequality thereof, and it is determined whether the proof is acceptable, depending on the verification and the check results.

REFERENCES:
patent: 6154841 (2000-11-01), Oishi
patent: 6282295 (2001-08-01), Young et al.
patent: 6411715 (2002-06-01), Liskov et al.
patent: 6651167 (2003-11-01), Terao et al.
patent: 2001/0024501 (2001-09-01), Furukawa
patent: WO 00/48359 (2000-08-01), None
patent: WO 01/20562 (2001-03-01), None
European Search Report dated Mar. 25, 2004.
Markus Michels, et al., “Efficient Convertible Undeniable Signature Schemes”, International Workshop on Selected Areas in Cryptography, Aug. 31, 1997, pp. 231-244, XP002268141.
Hyung-Kyu Yang et al., “Self-Certified Identity Information using the minimum knowledge”, 1996 IEEE Tencon, Digital Signal Processing Applications, Nov. 26, 1996, pp. 641-647, XP010236752.
“Zero-knowledge Undeniable Signatures”, David Chaum, Advances in Cryptology, Proceedings of Eurocrypt' 1990, LNCS473, Springer-Verlag, pp. 458-464, 1991.
“Efficient Convertible Undeniable Signature Schemes”, Proceeding of 4th Annual Workshop on Selected Areas in Cryptography, SAC'97, Aug. 1997.

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

Zero-knowledge proving system and method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Zero-knowledge proving system and method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zero-knowledge proving system and method will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3660982

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