28 search results - page 1 / 6 » Zero-Knowledge Sets |
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a new flavor of commitment schemes, which we call mercurial commitments. Informally, mercurial commitments are standard commitments that have been extended to allow ...
TCC
2010
Springer
13 years 12 months ago
2010
Springer
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...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
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 Ü ...
IACR
2011
12 years 4 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
EUROCRYPT
2008
Springer
13 years 6 months ago
2008
Springer
