Structure-preserving compressing primitives: vector commitments and accumulators and applications
From MaRDI portal
Cites work
- A new approach to efficient revocable attribute-based anonymous credentials
- Advances in Cryptology - EUROCRYPT 2004
- Aggregatable subvector commitments for stateless cryptocurrencies
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Commuting signatures and verifiable encryption
- Compact E-Cash from Bounded Accumulator
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant size ring signature without random oracle
- Constant-Size Commitments to Polynomials and Their Applications
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Delegatable anonymous credentials from mercurial signatures
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Efficient fully structure-preserving signatures and shrinking commitments
- Efficient fully structure-preserving signatures for large messages
- Efficient NIZKs for algebraic sets
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Protocols for Set Membership and Range Proofs
- Efficient ring signatures in the standard model
- Fully structure-preserving signatures and shrinking commitments
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
- Group to group commitments do not shrink
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1952905 (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
- Issuer-hiding attribute-based credentials
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- On the impossibility of algebraic vector commitments in pairing-free groups
- On the Non-malleability of the Fiat-Shamir Transform
- On the size of pairing-based non-interactive arguments
- Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives
- Practical Round-Optimal Blind Signatures in the Standard Model
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- Revocation for delegatable anonymous credentials
- Ring signatures: Stronger definitions, and constructions without random oracles
- Set (non-)membership NIZKs from determinantal accumulators
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Streaming authenticated data structures
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Subvector commitments with application to succinct arguments
- Succinct vector, polynomial, and functional commitments from lattices
- Threshold structure-preserving signatures
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Topics in Cryptology – CT-RSA 2005
- Updatable and universal common reference strings with applications to zk-SNARKs
- Updatable signatures and message authentication codes
- Vector and functional commitments from lattices
- Vector commitments and their applications
- Verifiable delegation of computation over large datasets
- Zero-Knowledge Accumulators and Set Algebra
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
This page was built for publication: Structure-preserving compressing primitives: vector commitments and accumulators and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363464)
