Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
From MaRDI portal
Publication:6190147
DOI10.1007/978-3-031-38554-4_16zbMath1530.94028OpenAlexW4385654008MaRDI QIDQ6190147
No author found.
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38554-4_16
Cites Work
- On the concrete hardness of learning with errors
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- A generic approach to constructing and proving verifiable random functions
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- More efficient commitments from structured lattice assumptions
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical product proofs for lattice commitments
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Practical post-quantum few-time verifiable random function with applications to Algorand
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Algorand: a secure and efficient distributed ledger
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Key Homomorphic PRFs and Their Applications
- New and Improved Key-Homomorphic Pseudorandom Functions
- Pseudorandom Functions and Lattices
- Lattice Signatures without Trapdoors
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Universally composable two-party and multi-party secure computation
- Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A new identification scheme based on syndrome decoding
- Decentralized Anonymous Micropayments
- Fine-Tuning Groth-Sahai Proofs
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Traceable Ring Signature
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
This page was built for publication: Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
