首页 | 本学科首页   官方微博 | 高级检索  
     


Mercurial Commitments with Applications to Zero-Knowledge Sets
Authors:Melissa Chase  Alexander Healy  Anna Lysyanskaya  Tal Malkin  Leonid Reyzin
Affiliation:1. Microsoft Research, Redmond, WA, 98052, USA
2. Division of Engineering and Applied Sciences, Harvard University, Cambridge, MA, 02138, USA
3. Department of Computer Science, Brown University, Providence, RI, 02912, USA
4. Department of Computer Science, Columbia University, New York, NY, 10027, USA
5. Department of Computer Science, Boston University, Boston, MA, 02215, USA
Abstract: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 xS 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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号