Batching techniques for accumulators with applications to IOPs and stateless blockchains

DOI10.1007/978-3-030-26948-7_20zbMath1456.94051OpenAlexW2913435035MaRDI QIDQ2181865

Ben Fisch, Dan Boneh, Benedikt Bünz

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26948-7_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (42)

Cryptanalysis of a dynamic universal accumulator over bilinear groups ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ A sub-linear lattice-based submatrix commitment scheme ⋮ UC Updatable Databases and Applications ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ SoK: communication across distributed ledgers ⋮ Efficient state management in distributed ledgers ⋮ Dynamic universal accumulator with batch update over bilinear groups ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Merkle trees optimized for stateless clients in bitcoin ⋮ SoK: blockchain light clients ⋮ Achieving almost all blockchain functionalities with polylogarithmic storage ⋮ Lattice-based accumulator with constant time list update and constant time verification ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers ⋮ Short-lived zero-knowledge proofs and signatures ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ New unbounded verifiable data streaming for batch query with almost optimal overhead ⋮ Linear-map vector commitments and their practical applications ⋮ PointProofs, revisited ⋮ Divide \& Scale: formalization and roadmap to robust sharding ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ KVaC: key-value commitments for blockchains and beyond ⋮ Incrementally aggregatable vector commitments and applications to verifiable decentralized storage ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ Non-malleable vector commitments via local equivocability ⋮ Turn-based communication channels ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Non-malleable vector commitments via local equivocability ⋮ Efficient verifiable delay functions ⋮ Transparent SNARKs from DARK compilers ⋮ Compact zero-knowledge proofs for threshold ECDSA with trustless setup ⋮ A note on Low Order assumptions in RSA groups

This page was built for publication: Batching techniques for accumulators with applications to IOPs and stateless blockchains