Non-malleable subvector commitments

DOI10.1007/978-981-96-0891-1_1MaRDI QIDQ6965301zbMATH OpenFDO

Authors Benoît Libert

Publication date 3 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0891-1_1

zbMATH Keywords

non-malleabilitysubvector openingsvector commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Aggregatable subvector commitments for stateless cryptocurrencies
• An algebraic approach to non-malleability
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Black-box non-interactive non-malleable commitments
• Composable and modular anonymous credentials: definitions and practical constructions
• 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
• Constant-Size Commitments to Polynomials and Their Applications
• Constant-size zk-SNARKs in ROM from falsifiable assumptions
• Constructing non-malleable commitments: a black-box approach
• Efficient Identity-Based Encryption Without Random Oracles
• scientific article; zbMATH DE number 1722670 (Why is no real title available?)
• scientific article; zbMATH DE number 2009955 (Why is no real title available?)
• scientific article; zbMATH DE number 2079923 (Why is no real title available?)
• scientific article; zbMATH DE number 1759793 (Why is no real title available?)
• scientific article; zbMATH DE number 1842511 (Why is no real title available?)
• Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
• Jackpot: non-interactive aggregatable lotteries
• Magic functions
• Non-interactive and reusable non-malleable commitment schemes
• Non-malleable vector commitments via local equivocability
• Non-malleable vector commitments via local equivocability
• Nonmalleable Cryptography
• On the impossibility of algebraic vector commitments in pairing-free groups
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Succinct vector, polynomial, and functional commitments from lattices
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles

This page was built for publication: Non-malleable subvector commitments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965301)