Independent zero-knowledge sets

被引:0
|
作者
Gennaro, Rosario [1 ]
Micali, Silvio
机构
[1] IBM Corp, Div Res, TJ Watson Res Ctr, Yorktown Hts, NY 10598 USA
[2] MIT, CSAIL, Cambridge, MA 02139 USA
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We define and construct Independent Zero-Knowledge Sets (ZKS) protocols. In a ZKS protocols, a Prover commits to a set S, and for any x, proves non-interactively to a Verifier if x is an element of S or x is not an element of S without revealing any other information about S. In the independent ZKS protocols we introduce, the adversary is prevented from successfully correlate her set to the one of a honest prover. Our notion of independence in particular implies that the resulting ZKS protocol is non-malleable. On the way to this result we define the notion of independence for commitment schemes. It is shown that this notion implies non-malleability, and we argue that this new notion has the potential to simplify the design and security proof of non-malleable commitment schemes. Efficient implementations of ZKS protocols are based on the notion of mercurial commitments. Our efficient constructions of independent ZKS protocols requires the design of new commitment schemes that are simultaneously independent (and thus non-malleable) and mercurial.
引用
收藏
页码:34 / 45
页数:12
相关论文
共 50 条
  • [41] Zero-knowledge proofs of retrievability
    Yan Zhu
    HuaiXi Wang
    ZeXing Hu
    Gail-Joon Ahn
    HongXin Hu
    [J]. Science China Information Sciences, 2011, 54 : 1608 - 1617
  • [42] Updatable zero-knowledge databases
    Liskov, M
    [J]. ADVANCES IN CRYPTOLOGY ASIACRYPT 2005, 2005, 3788 : 174 - 198
  • [43] Zero-Knowledge for Anonymous Authentication
    Hajny, Jan
    Pelka, Tomas
    Malina, Lukas
    [J]. TSP 2010: 33RD INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING, 2010, : 213 - 218
  • [44] On Efficient Zero-Knowledge PCPs
    Ishai, Yuval
    Mahmoody, Mohammad
    Sahai, Amit
    [J]. THEORY OF CRYPTOGRAPHY (TCC 2012), 2012, 7194 : 151 - 168
  • [45] Zero-knowledge proofs of retrievability
    Zhu Yan
    Wang HuaiXi
    Hu ZeXing
    Ahn, Gail-Joon
    Hu HongXin
    [J]. SCIENCE CHINA-INFORMATION SCIENCES, 2011, 54 (08) : 1608 - 1617
  • [46] Zero-knowledge and correlation intractability
    Hada, Satoshi
    Tanaka, Toshiaki
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (10) : 2894 - 2905
  • [47] NONINTERACTIVE ZERO-KNOWLEDGE WITH PREPROCESSING
    DESANTIS, A
    MICALI, S
    PERSIANO, G
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 403 : 269 - 282
  • [48] SORTING OUT ZERO-KNOWLEDGE
    BRASSARD, G
    CREPEAU, C
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 434 : 181 - 191
  • [49] A General Zero-Knowledge Scheme
    Burmester M.
    Desmedt Y.G.
    Piper F.
    Walker M.
    [J]. Designs, Codes and Cryptography, 1997, 12 (1) : 13 - 37
  • [50] Hashing to Prime in Zero-Knowledge
    Gross, Thomas
    [J]. SECRYPT 2021: PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY, 2021, : 62 - 74