A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
SIAM Journal on Computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
SIAM Journal on Computing
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science
A Distributed Implementation of the Certified Information Access Service
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
A Generic Scheme for Zero-Knowledge Sets
Proceedings of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005
Distributed certified information access for mobile devices
WISTP'07 Proceedings of the 1st IFIP TC6 /WG8.8 /WG11.2 international conference on Information security theory and practices: smart cards, mobile and ubiquitous computing systems
Zero-knowledge sets with short proofs
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
A new efficient construction for non-malleable zero-knowledge sets
WISA'10 Proceedings of the 11th international conference on Information security applications
Algebraic construction for zero-knowledge sets
Journal of Computer Science and Technology
Independent zero-knowledge sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Updatable zero-knowledge databases
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Universally composable zero-knowledge sets
International Journal of Grid and Utility Computing
BGN authentication and its extension to convey message commitments
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Mercurial commitments: minimal assumptions and efficient constructions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Journal of Systems and Software
Providing a data location assurance service for cloud storage environments
Journal of Mobile Multimedia
Hi-index | 0.00 |
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 for soft decommitment. Soft decommitments, on the one hand, are not binding but, on the other hand, cannot be in conflict with true decommitments. We then demonstrate that a particular instantiation of mercurial commitments has been implicitly used by Micali, Rabin and Kilian to construct zero-knowledge sets. (A zero-knowledge set scheme allows a Prover to (1) commit to a set S in a way that reveals nothing about S and (2) prove to a Verifier, in zero-knowledge, statements of the form x ∈ S and x ∉ S.) The rather complicated construction of Micali et al. becomes easy to understand when viewed as a more general construction with mercurial commitments as an underlying building block. By providing mercurial commitments based on various assumptions, we obtain several different new zero-knowledge set constructions.