Pages that link to "Item:Q1753870"
From MaRDI portal
The following pages link to New (and old) proof systems for lattice problems (Q1753870):
Displaying 9 items.
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- On the smoothing parameter and last minimum of random orthogonal lattices (Q2182065) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Discrete Gaussian measures and new bounds of the smoothing parameter for lattices (Q2666966) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428126) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)