Sciweavers

139 search results - page 15 / 28
» Zero-Knowledge
Sort
View
EUROCRYPT
1999
Springer
14 years 2 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels
EUROCRYPT
1997
Springer
14 years 1 months ago
Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function
Mihir Bellare, Markus Jakobsson, Moti Yung
CRYPTO
1989
Springer
99views Cryptology» more  CRYPTO 1989»
14 years 1 months ago
How to Explain Zero-Knowledge Protocols to Your Children
Jean-Jacques Quisquater, Myriam Quisquater, Muriel...
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
14 years 1 months ago
Perfect Zero-Knowledge in Constant Rounds
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
Mihir Bellare, Silvio Micali, Rafail Ostrovsky