Pages that link to "Item:Q3582751"
From MaRDI portal
The following pages link to Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness (Q3582751):
Displaying 12 items.
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Generalized Learning Problems and Applications to Non-commutative Cryptography (Q3092369) (← links)
- Short Generators Without Quantum Computers: The Case of Multiquadratics (Q5738870) (← links)
- On the Cryptographic Complexity of the Worst Functions (Q5746343) (← links)
- Expanders with respect to Hadamard spaces and random graphs (Q5892453) (← links)
- Limits of local algorithms over sparse random graphs (Q5892454) (← links)
- Deterministic compression with uncertain priors (Q5892455) (← links)
- The truth behind the myth of the folk theorem (Q5892456) (← links)
- Tighter security proofs for GPV-IBE in the quantum random oracle model (Q5925501) (← links)
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher (Q6135425) (← links)
- Ideal-SVP is hard for small-norm uniform prime ideals (Q6587946) (← links)
- A complete break of an homomorphic encryption algorithm based on polynomial rings (Q6665911) (← links)
