Pages that link to "Item:Q2096537"
From MaRDI portal
The following pages link to Practical product proofs for lattice commitments (Q2096537):
Displaying 25 items.
- Lattice-based proof of shuffle and applications to electronic voting (Q826259) (← links)
- Lattice-based zero-knowledge arguments for integer relations (Q1784112) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Improved lattice-based mix-nets for electronic voting (Q2104424) (← links)
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs (Q2128576) (← links)
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions (Q2128577) (← links)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q2170040) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations (Q6041285) (← links)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q6041582) (← links)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general (Q6104329) (← links)
- Practical sublinear proofs for R1CS from lattices (Q6104331) (← links)
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling (Q6104338) (← links)
- Efficient lattice-based blind signatures via Gaussian one-time signatures (Q6113967) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)
- Commitments with efficient zero-knowledge arguments from subset sum problems (Q6550619) (← links)
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments (Q6582225) (← links)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
- Ring/module learning with errors under linear leakage -- hardness and applications (Q6635772) (← links)
- On structure-preserving cryptography and lattices (Q6635826) (← links)
- Aggregating Falcon signatures with LaBRADOR (Q6648189) (← links)
- Lattice-based zero-knowledge proofs in action: applications to electronic voting (Q6655871) (← links)
- Greyhound: fast polynomial commitments from lattices (Q6660299) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
