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 条
  • [41] On Efficient Zero-Knowledge PCPs
    Ishai, Yuval
    Mahmoody, Mohammad
    Sahai, Amit
    THEORY OF CRYPTOGRAPHY (TCC 2012), 2012, 7194 : 151 - 168
  • [42] SORTING OUT ZERO-KNOWLEDGE
    BRASSARD, G
    CREPEAU, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 434 : 181 - 191
  • [43] NONINTERACTIVE ZERO-KNOWLEDGE WITH PREPROCESSING
    DESANTIS, A
    MICALI, S
    PERSIANO, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 403 : 269 - 282
  • [44] The Right to Be Zero-Knowledge Forgotten
    Visconti, Ivan
    19TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY, AND SECURITY, ARES 2024, 2024,
  • [45] A General Zero-Knowledge Scheme
    Burmester M.
    Desmedt Y.G.
    Piper F.
    Walker M.
    Designs, Codes and Cryptography, 1997, 12 (1) : 13 - 37
  • [46] Hashing to Prime in Zero-Knowledge
    Gross, Thomas
    SECRYPT 2021: PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY, 2021, : 62 - 74
  • [47] A short tutorial of zero-knowledge
    Goldreich, O. (oded.goldreich@weizmann.ac.il), 1600, IOS Press BV (10):
  • [48] Round-Efficient Sub-linear Zero-Knowledge Arguments for Linear Algebra
    Seo, Jae Hong
    PUBLIC KEY CRYPTOGRAPHY - PKC 2011, 2011, 6571 : 387 - 402
  • [49] Zero-knowledge proofs of retrievability
    AHN Gail-Joon
    Science China(Information Sciences), 2011, 54 (08) : 1608 - 1617
  • [50] Games with zero-knowledge signaling
    Epsen E.
    Studia Logica, 2007, 86 (3) : 403 - 414