Non-malleable vector commitments via local equivocability
From MaRDI portal
(Redirected from Publication:2697900)
Recommendations
- Non-malleable vector commitments via local equivocability
- Efficient non-malleable commitment schemes
- Efficient non-malleable commitment schemes
- scientific article; zbMATH DE number 1759793
- scientific article; zbMATH DE number 1722670
- Linear-map vector commitments and their practical applications
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Unsatisfiability of comparison-based non-malleability for commitments
- Non-interactive and reusable non-malleable commitment schemes
Cites work
- A general model for authenticated data structures
- A Pseudorandom Generator from any One-way Function
- Adaptive One-Way Functions and Applications
- Advances in Cryptology - EUROCRYPT 2004
- Aggregatable subvector commitments for stateless cryptocurrencies
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Bit commitment using pseudorandomness
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant-round non-malleable commitments from any one-way function
- Constant-round non-malleable commitments from sub-exponential one-way functions
- Four-round concurrent non-malleable commitments from one-way functions
- scientific article; zbMATH DE number 1722670 (Why is no real title available?)
- scientific article; zbMATH DE number 1088234 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 2009955 (Why is no real title available?)
- scientific article; zbMATH DE number 1759793 (Why is no real title available?)
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- scientific article; zbMATH DE number 1418317 (Why is no real title available?)
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Independent Zero-Knowledge Sets
- Mercurial commitments with applications to zero-knowledge sets
- Nearly optimal verifiable data streaming
- New and Improved Constructions of Nonmalleable Cryptographic Protocols
- Non-interactive and reusable non-malleable commitment schemes
- Non-malleability amplification
- Nonmalleable Cryptography
- Public Key Cryptography - PKC 2006
- Round optimal concurrent non-malleability from polynomial hardness
- Subvector commitments with application to succinct arguments
- Textbook non-malleable commitments
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
- Vector commitments and their applications
- Verifiable delegation of computation over large datasets
- Zero-Knowledge Sets With Short Proofs
Cited in
(7)- Vector commitments and their applications
- Non-malleable vector commitments via local equivocability
- Linear-map vector commitments and their practical applications
- PointProofs, revisited
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- Universal vector commitments
- Non-malleable subvector commitments
This page was built for publication: Non-malleable vector commitments via local equivocability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697900)