Lower bounding update frequency in short accumulators and vector commitments
From MaRDI portal
Cites work
- Aggregatable subvector commitments for stateless cryptocurrencies
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Efficient Asynchronous Accumulators for Distributed PKI
- How Efficient Can Memory Checking Be?
- scientific article; zbMATH DE number 1031001 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- KVaC: key-value commitments for blockchains and beyond
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Limits on revocable proof systems, with implications for stateless blockchains
- Lower bounds for the number of decryption updates in registration-based encryption
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
- On the impossibility of batch update for cryptographic accumulators
- Proofs of space
- Publicly verifiable proofs of sequential work
- Registration-based encryption from standard assumptions
- Registration-based encryption: removing private-key generator from IBE
- Subvector commitments with application to succinct arguments
- Succinct vector, polynomial, and functional commitments from lattices
- The Discrete Logarithm problem with preprocessing
- Time space tradeoffs for attacks against one-way functions and PRGs
- Topics in Cryptology – CT-RSA 2005
- Transparent SNARKs from DARK compilers
- Universal Accumulators with Efficient Nonmembership Proofs
- Universally composable accumulators
- Vector and functional commitments from lattices
- Vector commitments and their applications
- Verifiable registration-based encryption
- Witness encryption and its applications
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
This page was built for publication: Lower bounding update frequency in short accumulators and vector commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304139)
