Mercurial commitments with applications to zero-knowledge sets

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 422-439

  Chase, Melissa ^a   Healy, Alexander ^b   Lysyanskaya, Anna ^a   Malkin, Tal ^c   Reyzin, Leonid ^d  

^a BROWN UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

^c Och Spine at New York Presbyterian Hospitals   (United States)

^d BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; KNOWLEDGE ACQUISITION; SET THEORY;

COMMITMENT SCHEMES; MERCURIAL COMMITMENTS; SOFT DECOMMITMENT; ZERO-KNOWLEDGE SETS;

CRYPTOGRAPHY;

EID: 24944472287     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11426639_25     Document Type: Conference Paper

References (16)

1. [BCC88] Gilles Brassard, David Chaum, and Claude Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2), 1988.
2. [BDMP91] Manuel Blum, Alfredo De Santis, Silvio Micali, and Guiseppe Persiano. Non-interactive zero-knowledge. SIAM Journal of Computing, 20(6), 1991.
3. [BY96] Mihir Bellare and Moti Yung. Certifying permutations: non-interactive zero-knowledge based on any trapdoor permutation. J. Cryptology, 9(3), 1996.
4. [Fis01] Marc Fischlin. Trapdoor Commitment Schemes and Their Applications. PhD thesis, University of Frankfurt am Main, December 2001.
5. [FLS99] U. Feige, D. Lapidot, and A. Shamir. Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Computing, 29(1), 1999.
6. [GM05] Rosario Gennaro and Silvio Micali. Independent zero-knowledge sets. Unpublished manuscript, 2005.
7. [GMR88] S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2), 1988.
8. [GO92] Shafi Goldwasser and Rafail Ostrovsky. Invariant signatures and non-interactive zero-knowledge proofs are equivalent. In CRYPTO '92.
9. [HILL99] J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Computing, 28(4), 1999.
10. [LL94] Chae Hoon Lim and Pil Joong Lee. More flexible exponentiation with precomputation. In Advances in Cryptology-CRYPTO '94.
11. [Lys02] Anna Lysyanskaya. Unique signatures and verifiable random functions from the DH-DDH separation. In Advances in Cryptology - CRYPTO 2002.
12. [MRK03] Silvio Micali, Michael Rabin, and Joe Kilian. Zero-knowledge sets. In Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003.
13. [MRV99] S. Micali, M. Rabin, and S. Vadhan. Verifiable random functions. In Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), 1999.
14. [Nao91] Moni Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):51-158, 1991.
15. [ORS04] Rafi Ostrovsky, Charles Rackoff, and Adam Smith. Efficient consistency proof on a committed database. In Proc. of Automata, Languages and Programming: 31st International Colloquium, ICALP 2004.
16. [Ped92] Torben Pryds Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology - CRYPTO '91.