Primary-secondary-resolver membership proof systems

DOI10.1007/978-3-662-46497-7_8zbMATH Open1379.94046OpenAlexW140133644MaRDI QIDQ5261677FDOQ5261677

Authors: Moni Naor, Asaf Ziv 

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_8

Recommendations

• scientific article; zbMATH DE number 697829
• Efficient Protocols for Set Membership and Range Proofs
• Universal Accumulators with Efficient Nonmembership Proofs
• Compact proofs of retrievability
• Non-Interactive Zero-Knowledge Proofs of Non-Membership

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (4)

• Zero-knowledge functional elementary databases
• Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
• Zero-Knowledge Accumulators and Set Algebra
• Negotiating DNSSEC algorithms over legacy proxies

This page was built for publication: Primary-secondary-resolver membership proof systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261677)