Optimal Verification of Operations on Dynamic Sets
From MaRDI portal
Publication:5199186
DOI10.1007/978-3-642-22792-9_6zbMath1287.94094OpenAlexW87886728MaRDI QIDQ5199186
Roberto Tamassia, Charalampos Papamanthou, 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
Related Items (10)
Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Integrity Preserving Multi-keyword Searchable Encryption for Cloud Computing ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ The hunting of the SNARK ⋮ Confidentiality-Preserving Publicly Verifiable Computation ⋮ Trusted computing with addition machines. II ⋮ Authenticated hash tables based on cryptographic accumulators
This page was built for publication: Optimal Verification of Operations on Dynamic Sets
