21 search results - page 1 / 5 » Efficient Constructions of Composable Commitments and Zero-K... |
CRYPTO
2008
Springer
14 years 20 days ago
2008
Springer
CRYPTO
2010
Springer
13 years 12 months ago
2010
Springer
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
TCC
2010
Springer
14 years 5 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...
IACR
2011
12 years 10 months ago
2011
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...
TCC
2010
Springer
13 years 8 months ago
2010
Springer
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...