Mercurial commitments with applications to zero-knowledge sets

DOI10.1007/s00145-012-9122-9zbMath1279.94061MaRDI QIDQ2377062

Tal Malkin, Melissa Chase, Leonid Reyzin, Anna Lysyanskaya, Alexander D. Healy

Publication date: 27 June 2013

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-012-9122-9

zbMATH Keywords

outsourced databases; database privacy; commitments; zero-knowledge sets; verifiable queries

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

Related Items

Non-malleable vector commitments via local equivocability, Non-malleable vector commitments via local equivocability, Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Minimum disclosure proofs of knowledge
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• Independent Zero-Knowledge Sets
• Statistically Hiding Sets
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Noninteractive Zero-Knowledge
• A Pseudorandom Generator from any One-way Function
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Mercurial Commitments with Applications to Zero-Knowledge Sets
• Updatable Zero-Knowledge Databases
• Zero-Knowledge Sets with Short Proofs
• Automata, Languages and Programming
• Theory of Cryptography