On the impossibility of algebraic vector commitments in pairing-free groups
From MaRDI portal
Publication:6114273
DOI10.1007/978-3-031-22365-5_10zbMath1519.94077OpenAlexW4312864122MaRDI QIDQ6114273
Emanuele Giunta, Rosario Gennaro, Dario Fiore, Dario Catalano
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_10
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generic-group delay functions require hidden-order groups
- Accumulators in (and beyond) generic groups: non-trivial batch verification requires interaction
- Subvector commitments with application to succinct arguments
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- On the impossibility of purely algebraic signatures
- Vector and functional commitments from lattices
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Group to Group Commitments Do Not Shrink
- Identity-Based Cryptosystems and Signature Schemes
- Constant-Size Commitments to Polynomials and Their Applications
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Lower bounds on the efficiency of encryption and digital signature schemes
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Vector Commitments and Their Applications
- Streaming Authenticated Data Structures
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Verifiable Delegation of Computation over Large Datasets
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Cryptography and Coding
- Generic-Group Identity-Based Encryption: A Tight Impossibility Result
- To label, or not to label (in generic groups)
This page was built for publication: On the impossibility of algebraic vector commitments in pairing-free groups