Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes

Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jan Camenisch , Markus Michels

Citations:

99 - 11 self

BibTeX

@MISC{Camenisch98provingin,
    author = {Jan Camenisch and Markus Michels},
    title = {Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes},
    year = {1998}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

This paper presents the first efficient statistical zero-knowledge protocols to prove statements such as: A committed number is a pseudo-prime.

Citations

759	A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics - Cohen - 1993
512	Efficient signature generation for smart cards - Schnorr - 1991
298	Non-interactive and information-theoretic secure verifiable secret sharing - Pedersen - 1998
267	Wallet databases with observers - Chaum, Pedersen - 1993
264	Minimum Disclosure Proofs of Knowledge - Brassard, Chaum, et al. - 1988
229	Efficient group signature schemes for large groups - Camenisch, Stadler - 1997
221	Proofs of Partial Knowledge and Simplified Design of Witness Hiding - Cramer, Damg˚ard, et al. - 1994
201	Untraceable Off-line cash in wallet with observers - Brands - 1993
181	Riemann’s hypothesis and tests for primality - Miller - 1976
163	Probabilistic algorithm for testing primality - Rabin - 1980
122	A fast Monte-Carlo test for primality - Solovay, Strassen - 1977
118	T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations - Fujisaki, Okamoto - 1997
112	Efficient generation of shared rsa keys - Boneh, Franklin
68	RSA-based undeniable signature - Gennaro, Rabin, et al. - 2000
66	Robust and efficient sharing of RSA functions - Gennaro, Jarecki, et al.
63	Easy come - easy go divisible cash - Chan, Frankel, et al. - 1998
61	Theorems of factorization and primality testing - Pollard - 1974
53	Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem - Camenisch - 1998
49	de Graaf. An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations - Chaum, Evertse, et al. - 1988
42	Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge Be for Free - Cramer, Damg˚ard - 1998
41	Proof systems for general statements about discrete logarithms - Camenisch, Stadler - 1997
38	New public-key schemes based on elliptic curves over the ring zn - Koyama, Maurer, et al.
36	M.: A group signature scheme based on an RSAvariant - Camenisch, Michels - 1998
36	A p+1 method of factoring - Williams - 1982
31	Rapid Demonstration of Linear Relations Connected by Boolean Operators - Brands - 1997
29	Demonstrating Possession of a Discrete Logarithm Without Revealing It - Chaum, Evertse, et al. - 1987
28	Practical zero-knowledge proofs: Giving hints and using deficiencies - Boyar, Friedl, et al. - 1991
28	A practical and provably secure scheme for publicly verifiable secret sharing and its applications - Fujisaki, Okamoto - 1998
27	A simple and secure way to show the validity of your public key - Graaf, Peralta - 1987
23	An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products - Gennaro, Rabin - 1998
23	How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design - Goldreich, Micali, et al. - 1987
21	Primality and Cryptography - Kranakis
19	Factoring with cyclotomic polynomials - Bach, Shallit - 1989
9	Digital Signatures using reversible public key cryptography for the financial services industry (rDSA - 31 - 1998
8	Strong RSA keys - Gordon - 1984
7	R.: A Statistical Limited-Knowledge Proof for Secure RSA Keys - Liskov, Silverman - 1998
4	On primality tests - Lehmann - 1979
2	Verifable Partial Sharing of Integer Factors - Mao - 1998
1	Revised version available as GTE - Verlag - 1998