Sciweavers

12 search results - page 2 / 3
» Short Non-interactive Zero-Knowledge Proofs
Sort
View
TCC
2010
Springer
163views Cryptology» more  TCC 2010»
13 years 11 months ago
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
Benoît Libert, Moti Yung
EUROCRYPT
2008
Springer
13 years 6 months ago
Zero-Knowledge Sets with Short Proofs
Dario Catalano, Dario Fiore, Mariagrazia Messina
SECRYPT
2007
126views Business» more  SECRYPT 2007»
13 years 6 months ago
Additive Proofs of Knowledge - A New Notion for Non-Interactive Proofs
In this paper, we study the opacity property of verifiably encrypted signatures (VES) of Boneh et al. (proposed in Eurocrypt 2003). Informally, opacity implies that although some...
Amitabh Saxena
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
CRYPTO
2005
Springer
110views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....
Joël Alwen, Giuseppe Persiano, Ivan Visconti