Optimal verification of operations on dynamic sets

DOI10.1007/978-3-642-22792-9_6MaRDI QIDQ5199186zbMATH OpenOpenAlexFDO

Authors Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos

Publication date 12 August 2011

Published in Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22792-9_6

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Recommendations

• Verifiable set operations over outsourced databases
• Zero-Knowledge Accumulators and Set Algebra
• Authenticated hash tables based on cryptographic accumulators
• Verifiable delegation of computation over large datasets
• Nearly optimal verifiable data streaming

Cited in

(17)

• Authenticated hash tables based on cryptographic accumulators
• Integrity preserving multi-keyword searchable encryption for cloud computing
• Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
• Super-Efficient Verification of Dynamic Outsourced Databases
• Data and Applications Security XIX
• Trusted computing with addition machines. II
• Adaptive succinct garbled RAM or: how to delegate your database
• Logarithmic-size (linkable) threshold ring signatures in the plain model
• Zero-knowledge functional elementary databases
• Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
• Verifiable set operations over outsourced databases
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
• Confidentiality-preserving publicly verifiable computation
• Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
• The hunting of the SNARK
• Scored anonymous credentials
• Zero-Knowledge Accumulators and Set Algebra

This page was built for publication: Optimal verification of operations on dynamic sets

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