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] ZGridBC: Zero-Knowledge Proof based Scalable and Private Blockchain Platform for Smart Grid
    Miyamae, Takeshi
    Kozakura, Fumihiko
    Nakamura, Makoto
    Zhang, Shenbin
    Hua, Song
    Pi, Bingfeng
    Morinaga, Masanobu
    2021 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN AND CRYPTOCURRENCY (ICBC), 2021,
  • [42] Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs
    Bootle, Jonathan
    Lyubashevsky, Vadim
    Seiler, Gregor
    ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT 1, 2019, 11692 : 176 - 202
  • [43] PRFX: A Privacy-Preserving Prefix Summation Protocol on Blockchain with Zero-Knowledge Proof
    Ismayilov, Goshgar C.
    Ozturan, Can
    2024 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN, BLOCKCHAIN 2024, 2024, : 362 - 369
  • [44] Malleable Commitments from Group Actions and Zero-Knowledge Proofs for Circuits Based on Isogenies
    Chen, Mingjie
    Lai, Yi-Fu
    Laval, Abel
    Marco, Laurane
    Petit, Christophe
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2023, PT I, 2024, 14459 : 221 - 243
  • [45] A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds
    Chia, Nai-Hui
    Chung, Kai-Min
    Yamakawa, Takashi
    ADVANCES IN CRYPTOLOGY (CRYPTO 2021), PT I, 2021, 12825 : 315 - 345
  • [46] Aggregated Zero-Knowledge Proof and Blockchain-Empowered Authentication for Autonomous Truck Platooning
    Li, Wanxin
    Meese, Collin
    Guo, Hao
    Nejad, Mark
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2023, 24 (09) : 9309 - 9323
  • [47] Mathematical Proposal for Securing Split Learning Using Homomorphic Encryption and Zero-Knowledge Proofs
    Kokaj, Agon
    Mollakuqe, Elissa
    APPLIED SCIENCES-BASEL, 2025, 15 (06):
  • [48] CQRS and Blockchain with Zero-Knowledge Proofs for Secure Multi-Agent Decision-Making
    Cherif, Ayman N. A. I. T.
    Youssfi, Mohamed
    En-naimani, Zakariae
    Tadlaoui, Ahmed
    Soulami, Maha
    Bouattane, Omar
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2024, 15 (11) : 892 - 907
  • [49] Privacy-preserving analytics for the securitization market: a zero-knowledge distributed ledger technology application
    Sophie Meralli
    Financial Innovation, 6
  • [50] Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions
    Kiyoshima, Susumu
    JOURNAL OF CRYPTOLOGY, 2020, 33 (03) : 1318 - 1361