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] Security and privacy using one-round zero-knowledge proofs
    Almuhammadi, S
    Neuman, C
    CEC 2005: SEVENTH IEEE INTERNATIONAL CONFERENCE ON E-COMMERCE TECHNOLOGY, PROCEEDINGS, 2005, : 435 - 438
  • [32] Chebyshev polynomial approximation in CNN for zero-knowledge encrypted data analysis
    Ghanimi, Hayder M. A.
    Gopalakrishnan, T.
    Deol, G. Joel Sunny
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2024, 27 (2A) : 203 - 214
  • [33] Efficient Cyber-Evidence Sharing Using Zero-Knowledge Proofs
    Zand, Arman
    Pfluegel, Eckhard
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON CYBERSECURITY, SITUATIONAL AWARENESS AND SOCIAL MEDIA, CYBER SCIENCE 2022, 2023, : 229 - 242
  • [34] Zero-knowledge test of vector equivalence and granulation of user data with privacy
    Duan, Yitao
    Canny, John
    2006 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, 2006, : 720 - +
  • [35] Maximizing privacy and security of collaborative indoor positioning using zero-knowledge proofs
    Casanova-Marques, Raul
    Torres-Sospedra, Joaquin
    Hajny, Jan
    Gould, Michael
    INTERNET OF THINGS, 2023, 22
  • [36] zkFL: Zero-Knowledge Proof-Based Gradient Aggregation for Federated Learning
    Wang, Zhipeng
    Dong, Nanqing
    Sun, Jiahao
    Knottenbelt, William
    Guo, Yike
    IEEE TRANSACTIONS ON BIG DATA, 2025, 11 (02) : 447 - 460
  • [37] Validating the integrity of Convolutional Neural Network predictions based on zero-knowledge proof
    Fan, Yongkai
    Xu, Binyuan
    Zhang, Linlin
    Song, Jinbao
    Zomaya, Albert
    Li, Kuan-Ching
    INFORMATION SCIENCES, 2023, 625 : 125 - 140
  • [38] Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees
    Ghosh, Esha
    Goodrich, Michael T.
    Ohrimenko, Olga
    Tamassia, Roberto
    SECURITY AND CRYPTOGRAPHY FOR NETWORKS, SCN 2016, 2016, 9841 : 216 - 236
  • [39] WAYS TO IMPROVE THE PERFORMANCE OF ZERO-KNOWLEDGE SUCCINCT NON-INTERACTIVEARGUMENTS OF KNOWLEDGE AND THE ANALYSIS OF THE RUSULTS ACHIEVED
    Martynenkov, I. V.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2023, (60): : 40 - 58
  • [40] LiteZKP: Lightening Zero-Knowledge Proof-Based Blockchains for IoT and Edge Platforms
    Boo, EunSeong
    Kim, Joongheon
    Ko, JeongGil
    IEEE SYSTEMS JOURNAL, 2022, 16 (01): : 112 - 123