Lattice-based zero-knowledge proofs for blockchain confidential transactions
From MaRDI portal
Cites work
- A non-PCP approach to succinct quantum-safe zero-knowledge
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- Lattice signatures without trapdoors
- Lattice-based Cryptography
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- More efficient commitments from structured lattice assumptions
- On the concrete hardness of learning with errors
- On the size of pairing-based non-interactive arguments
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0)
- Raptor: a practical lattice-based (linkable) ring signature
- Short accountable ring signatures based on DDH
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Worst-case to average-case reductions for module lattices
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
This page was built for publication: Lattice-based zero-knowledge proofs for blockchain confidential transactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951312)
