Method to generate, verify and deny an undeniable signature

Details Method to generate, verify and deny an undeniable signature Method to generate, verify and deny an undeniable signature

2004-02-13

2008-12-02

Simitoski, Michael J (Department: 2134)

Electrical computers and digital processing systems: support

Multiple computer communication using cryptography

Particular communication authentication technique

C380S028000

Reexamination Certificate

active

07461261

ABSTRACT:
The aim of the invention is to propose the generation, verification and denial of an undeniable signature which has a size smaller than the currently available undeniable signatures, i.e. less than 80 bits. This aim is achieved by the method to generate an undeniable signature (y1, . . . , yt) on a set of data, this method comprising the following steps: (1) transforming the set of data (m) to a sequence of a predetermined number (t) of blocks (x1, . . . , xt), these blocks being members of an Abelian group, this transformation being a one way function, and (2) applying to each block (xi) a group homomorphism (f) to obtain a resulting value(yi), in which the number of elements of the initial group (G) is larger than the number of elements (d) of the destination group (H).

REFERENCES:
patent: 5373558 (1994-12-01), Chaum
patent: 6292897 (2001-09-01), Gennaro et al.
patent: 0 318 097 (1989-05-01), None
patent: 1 185 025 (2002-03-01), None
Chaum, David. “Zero-Knowledge Undeniable Signatures (Extended Abstract)”, EUROCRYPT '90.
Menezes, Alfred J. et al. Handbook of Applied Cryptography, 1997 CRC Press, Inc., pp. 408-409, 425-438 and 451-562.
Google Answers. “Q: Homomorphism Hash Function?”, Nov. 2002, <http://answers.google.com/answers/threadview?id=100823>.
Johnson, Robert et al. “Homomorphic Signature Schemes”, 2002.
Yun, Sung-Hyun et al. “Convertible Undeniable Signature Scheme”, 1997 IEEE.
Libert, et al., “Identity Based Undeniable Signatures”, Cryptology ePrint Archive, Report 2003/206, 2003.
Gennaro, et al., “RSA-Based Undeniable Signatures”, Journal of Cryptology, p. 13, 1996.
Scheidler, “A Public-Key Cryptosystem Using Purely Cubic Fields”, Journal of Cryptology, 11, pp. 109-124, Springer, 1998.
Gennaro, et al., “Robust and Efficient Sharing of RSA Functions”, Journal of Cryptology, vol. 13, No. 2, pp. 157-172, 1996.
Chaum, “Zero-Knowledge Undeniable Signatures—In Eurocrypt '90”, LNCS 473, p. 10, Springer-Verlag, Berlin, 1991.

Affiliated with

Also associated with

Rating

Method to generate, verify and deny an undeniable signature does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method to generate, verify and deny an undeniable signature, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method to generate, verify and deny an undeniable signature will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4029093