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 条
  • [21] An Efficient and Zero-Knowledge Classical Machine Learning Inference Pipeline
    Wang, Haodi
    Bie, Rongfang
    Hoang, Thang
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2025, 22 (02) : 1347 - 1364
  • [22] An RFID Zero-Knowledge Authentication Protocol Based on Quadratic Residues
    Song, Jian
    Harn, Po-Wei
    Sakai, Kazuya
    Sun, Min-Te
    Ku, Wei-Shinn
    IEEE INTERNET OF THINGS JOURNAL, 2021, 9 (14): : 12813 - 12824
  • [23] On the Overhead of Using Zero-Knowledge Proofs for Electric Vehicle Authentication
    Gabay, David
    Cebe, Mumin
    Akkaya, Kemal
    PROCEEDINGS OF THE 2019 CONFERENCE ON SECURITY AND PRIVACY IN WIRELESS AND MOBILE NETWORKS (WISEC '19), 2019, : 347 - 348
  • [24] A New Approach to Efficient Non-Malleable Zero-Knowledge
    Kim, Allen
    Liang, Xiao
    Pandey, Omkant
    ADVANCES IN CRYPTOLOGY - CRYPTO 2022, PT IV, 2022, 13510 : 389 - 418
  • [25] Constant-round adaptive zero-knowledge proofs for NP
    Zhang, Zongyang
    Cao, Zhenfu
    Zhu, Haojin
    INFORMATION SCIENCES, 2014, 261 : 219 - 236
  • [26] Concise UC Zero-Knowledge Proofs for Oblivious Updatable Databases
    Camenisch, Jan
    Dubovitskaya, Maria
    Rial, Alfredo
    2021 IEEE 34TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2021), 2021, : 189 - 204
  • [27] POSEIDON: A New Hash Function for Zero-Knowledge Proof Systems
    Grassi, Lorenzo
    Khovratovich, Dmitry
    Rechberger, Christian
    Roy, Arnab
    Schofnegger, Markus
    PROCEEDINGS OF THE 30TH USENIX SECURITY SYMPOSIUM, 2021, : 519 - 535
  • [28] Compressed Zero-Knowledge Proofs for Lattice-Based Accumulator
    Si, Shumin
    Lin, Xiuhan
    Wei, Puwen
    COMPUTER JOURNAL, 2024, 67 (02) : 694 - 708
  • [29] Ensuring the Big Data Integrity Through Verifiable Zero-Knowledge Operations
    Aleksandrova, Elena B.
    Poltavtseva, Maria A.
    Shmatov, Vadim S.
    MOBILE INTERNET SECURITY, MOBISEC 2021, 2022, 1544 : 211 - 221
  • [30] ZeeStar: Private Smart Contracts by Homomorphic Encryption and Zero-knowledge Proofs
    Steffen, Samuel
    Bichsel, Benjamin
    Baumgartner, Roger
    Vechev, Martin
    43RD IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2022), 2022, : 179 - 197