how to prove that a committed number is prime

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1716, Issue , 1999, Pages 208-218

  Van Le, Tri ^a   Nguyen, Khanh Quoc ^b   Varadharajan, Vijay ^b  

^a University of Wisconsin Milwaukee   (United States)

^b UNIVERSITY OF WESTERN SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BUILDING BLOCKES; CRYPTOGRAPHIC PROTOCOLS; GROUP SIGNATURES; NEW PROTOCOL; PRIMALITY TESTING; SECURITY PARAMETERS; UNDENIABLE SIGNATURE;

CRYPTOGRAPHY;

EID: 84956853783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48000-6_17     Document Type: Conference Paper

References (17)

1. J. Boyar, K. Friedl and C. Lund, Practical zero-knowledge proofs: giving hints and using deficiencies, Journal of Cryptology, 4(3):185-206, 1991.
2. S. Brands, “Rapid Demonstration of Linear Relations Connected by Boolean Operators”, Proceedings of Eurocrypt’97, LNCS 1223, pp. 318-333.
3. J. Camenisch and M. Michels, “Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes”, Proceedings of Eurocrypt’99, LNCS 1592, pp. 106–121. Also appeared as BRICS Technical Report RS-98-29.
4. J. Camenisch and M. Stadler, “Efficient group signature schemes for large groups”, Proceedings of CRYPTO’97, LNCS 1294, pages 410-424.
5. A. Chan, Y. Frankel and T. Tsiounis, “Easy come-easy go divisible cash”, Proceedings of Eurocrypt’98, LNCS, pp. 561-575.
6. R.Cramer and I. Damgard, “Zero-knowledge for Finite Field Arithmetic or: Can Zero-knowledge be for Free?”, In Proceedings of CRYPTO’98, LNCS 1462, pp. 424–441, 1998.
7. R.Cramer, I.Damgard and B.Schoenmakers, Crypto’94, “Proofs of partial knowledge and simplified design of witness hiding protocols”, Proceedings of CRYPTO’94, LNCS 839, pp.174-187.
8. A. De Santis, G. Di Crescenzo and G. Persiano, “Secret sharing and perfect zero-knowledge”, Proceedings of CRYPTO’ 93, LNCS 773, pp.73-84.
9. A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
10. E. Fujisaki and T. Okamoto, “Statistical zero-knowledge protocols to prove modular polynomial relation”, Proceedings of CRYPTO’97, LNCS 1294, pp. 16-30.
11. T. Okamoto An efficient divisible electronic cash scheme, Proceedings of CRYPTO’95, LNCS, pp. 439-451.
12. J. van de Graaf and R. Peralta, “A simple and secure way to show the validity of your public key”, Proceedings of CRYPTO’87, LNCS 293, pp. 128-134. 208
13. R. Gennaro, H. Krawczyk and T. Rabin, “RSA-based undeniable signatures”, Proceedings of CRYPTO’97, LNCS 1294, pp. 132-149. 208, 208
14. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, “Robust and efficient sharing of RSA functions”, Proceedings of CRYPTO’96, LNCS 1109, pp. 157-172. 208, 208
15. n”, Proceedings of CRYPTO’91, pp.252-266 208
16. R. Gennaro, D. Micciancio and T. Rabin, “An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products”, in Proceedings of 5rd ACM conference on Computer and Communication Security, 1998. 208, 214, 216
17. M. Stadler, “Cryptographic Protocols for Revocable Privacy”, Ph.D Thesis, Swiss Federal Institute of Technology, Zurich 1996. 209