Sciweavers

62 search results - page 1 / 13
» Zero-Knowledge Sets with Short Proofs
Sort
View
TCC
2010
Springer
163views Cryptology» more  TCC 2010»
13 years 10 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 5 months ago
Zero-Knowledge Sets with Short Proofs
Dario Catalano, Dario Fiore, Mariagrazia Messina
FOCS
2003
IEEE
13 years 9 months ago
Zero-Knowledge Sets
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
Silvio Micali, Michael O. Rabin, Joe Kilian
IACR
2011
134views more  IACR 2011»
12 years 3 months ago
Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
Dario Catalano, Dario Fiore
ASIACRYPT
2010
Springer
13 years 1 months ago
Short Non-interactive Zero-Knowledge Proofs
We show that probabilistically checkable proofs can be used to shorten non-interactive zero-knowledge proofs. We obtain publicly verifiable non-interactive zero-knowledge proofs fo...
Jens Groth