Pages that link to "Item:Q3600239"
From MaRDI portal
The following pages link to Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems (Q3600239):
Displayed 19 items.
- Generating shorter bases for hard random lattices (Q537918) (← links)
- On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes (Q2055644) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- A Lattice-Based Group Signature Scheme with Message-Dependent Opening (Q2822670) (← links)
- Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem (Q2946396) (← links)
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Zero-Knowledge Interactive Proof Systems for New Lattice Problems (Q3460104) (← links)
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
- (Q5092454) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Verifiable Decryption for Fully Homomorphic Encryption (Q6108847) (← links)