Zero-Knowledge Accumulators and Set Algebra

被引:17
|
作者
Ghosh, Esha [1 ]
Ohrimenko, Olga [2 ]
Papadopoulos, Dimitrios [3 ]
Tamassia, Roberto [1 ]
Triandopoulos, Nikos [4 ]
机构
[1] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
[2] Microsoft Res, Cambridge, England
[3] Univ Maryland, College Pk, MD 20742 USA
[4] Stevens Inst Technol, Hoboken, NJ 07030 USA
来源
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2016, PT II | 2016年 / 10032卷
关键词
Zero-knowledge dynamic and universal accumulators; Zero-knowledge updates; Zero-knowledge set algebra; Outsourced computation; Integrity; Privacy; Bilinear accumulators; Cloud privacy; UNIVERSAL ACCUMULATORS; EFFICIENT REVOCATION; COMMITMENTS; PAIRINGS;
D O I
10.1007/978-3-662-53890-6_3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Cryptographic accumulators allowto succinctly represent a set by an accumulation value with respect to which short (non-) membership proofs about the set can be efficiently constructed and verified. Traditionally, their security captures soundness but offers no privacy: Convincing proofs reliably encode set membership, but they may well leak information about the accumulated set. In this paper we put forward a strong privacy-preserving enhancement by introducing and devising zero-knowledge accumulators that additionally provide hiding guarantees: Accumulation values and proofs leak nothing about a dynamic set that evolves via element insertions/deletions. We formalize the new property using the standard real-ideal paradigm, namely demanding that an adaptive adversary with access to query/update oracles, cannot tell whether he interacts with honest protocol executions or a simulator fully ignorant of the set (even of the type of updates on it). We rigorously compare the new primitive to existing ones for privacy-preserving verification of set membership (or other relations) and derive interesting implications among related security definitions, showing that zero-knowledge accumulators offer stronger privacy than recent related works by Naor et al. [TCC 2015] and Derler et al. [CT-RSA 2015]. We construct the first dynamic universal zero-knowledge accumulator that we show to be perfect zero-knowledge and secure under the q-Strong Bilinear Diffie-Hellman assumption. Finally, we extend our new privacy notion and our new construction to provide privacy-preserving proofs also for an authenticated dynamic set collection-a primitive for efficiently verifying more elaborate set operations, beyond set-membership. We introduce a primitive that supports a zero-knowledge verifiable set algebra: Succinct proofs for union, intersection and set difference queries over a dynamically evolving collection of sets can be efficiently constructed and optimally verified, while-for the first time-they leak nothing about the collection beyond the query result.
引用
收藏
页码:67 / 100
页数:34
相关论文
共 50 条
  • [31] A GENERAL ZERO-KNOWLEDGE SCHEME
    BURMESTER, MVD
    DESMEDT, Y
    PIPER, F
    WALKER, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 434 : 122 - 133
  • [32] Zero-Knowledge: Abstract of a tutorial
    Goldreich, O
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 3 - 3
  • [33] ZERO-KNOWLEDGE UNDENIABLE SIGNATURES
    CHAUM, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 473 : 458 - 464
  • [34] ACHIEVING ZERO-KNOWLEDGE ROBUSTLY
    KILIAN, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 537 : 313 - 325
  • [35] Zero-knowledge proofs of retrievability
    Yan Zhu
    HuaiXi Wang
    ZeXing Hu
    Gail-Joon Ahn
    HongXin Hu
    Science China Information Sciences, 2011, 54 : 1608 - 1617
  • [36] Updatable zero-knowledge databases
    Liskov, M
    ADVANCES IN CRYPTOLOGY ASIACRYPT 2005, 2005, 3788 : 174 - 198
  • [37] Zero-knowledge and correlation intractability
    Hada, Satoshi
    Tanaka, Toshiaki
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (10) : 2894 - 2905
  • [38] Zero-Knowledge for Anonymous Authentication
    Hajny, Jan
    Pelka, Tomas
    Malina, Lukas
    TSP 2010: 33RD INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING, 2010, : 213 - 218
  • [39] Zero-knowledge proofs of retrievability
    Zhu Yan
    Wang HuaiXi
    Hu ZeXing
    Ahn, Gail-Joon
    Hu HongXin
    SCIENCE CHINA-INFORMATION SCIENCES, 2011, 54 (08) : 1608 - 1617
  • [40] Independent zero-knowledge sets
    Gennaro, Rosario
    Micali, Silvio
    AUTOMATA, LANGAGES AND PROGRAMMING, PT 2, 2006, 4052 : 34 - 45