An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products

Full text

Pdf (622 KB)

Source

Conference on Computer and Communications Security archive
Proceedings of the 5th ACM conference on Computer and communications security table of contents

San Francisco, California, United States

Pages: 67 - 72

Year of Publication: 1998

ISBN:1-58113-007-4

Authors

Rosario Gennaro	I.B .M. T.J . Watson Research Center, P.O. Box, 704, Yorktown Heights, NY
Daniele Micciancio	MIT Laboratory for Computer Science, 545 Technology square, Cambridge MA
Tal Rabin	I.B.M. T.J. Watson Research Center, P.O. BOX 704, Yorktown Heights, NY

Sponsor

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 35, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/288090.288108 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Manuel Blum , Alfredo De Santis , Silvio Micali , Giuseppe Persiano, Noninteractive zero-knowledge, SIAM Journal on Computing, v.20 n.6, p.1084-1118, Dec. 1991 [doi>10.1137/0220068]
	2	Eiichiro Fujisaki , Tatsuaki Okamoto, Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, p.16-30, August 17-21, 1997
	3	Rosario Gennaro , Hugo Krawczyk , Tal Rabin, RSA-Based Undeniable Signatures, Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, p.132-149, August 17-21, 1997
	4	S. Goldwasser , S. Micali , C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, v.18 n.1, p.186-208, Feb. 1989 [doi>10.1137/0218012]
	5	Oded Goldreich , Silvio Micali , Avi Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Journal of the ACM (JACM), v.38 n.3, p.690-728, July 1991 [doi>10.1145/116825.116852]
	6	Jeroen van de Graaf , René Peralta, A Simple and Secure Way to Show the Validity of Your Public Key, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.128-134, August 16-20, 1987
	7	Silvio Micali, Fair Public-Key Cryptosystems, Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, p.113-138, August 16-20, 1992
	8	R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]