Pages that link to "Item:Q5899512"
From MaRDI portal
The following pages link to On lattices, learning with errors, random linear codes, and cryptography (Q5899512):
Displaying 50 items.
- Iterated group products and leakage resilience against NC1 (Q2988886) (← links)
- Building one-time memories from isolated qubits (Q2988887) (← links)
- Attribute-efficient evolvability of linear functions (Q2988888) (← links)
- Energy-efficient circuit design (Q2988889) (← links)
- Rate-independent computation in continuous chemical reaction networks (Q2988890) (← links)
- Testers and their applications (Q2988891) (← links)
- On the automorphism groups of strongly regular graphs I (Q2988892) (← links)
- Faster private release of marginals on small databases (Q2988893) (← links)
- Mechanism design in large games (Q2988894) (← links)
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals (Q2988895) (← links)
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems (Q2988896) (← links)
- Complexity of approximating CSP with balance / hard constraints (Q2988897) (← links)
- Integer feasibility of random polytopes (Q2988898) (← links)
- Multireference alignment using semidefinite programming (Q2988900) (← links)
- Partial tests, universal tests and decomposability (Q2988902) (← links)
- High dimensional expanders and property testing (Q2988903) (← links)
- Parameterized testability (Q2988904) (← links)
- Direct sum fails for zero error average communication (Q2988905) (← links)
- Rational arguments (Q2988906) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Multi-key FHE from LWE, Revisited (Q3181028) (← links)
- On the Efficacy of Solving LWE by Reduction to Unique-SVP (Q3193270) (← links)
- BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU (Q3294884) (← links)
- Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting (Q3297618) (← links)
- Generic Construction of Bounded-Collusion IBE via Table-Based ID-to-Key Map (Q3297639) (← links)
- An LWE-based verifiable threshold secret sharing scheme (Q3383067) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Trapdoors for Ideal Lattices with Applications (Q3454588) (← links)
- Predicate Encryption for Circuits from LWE (Q3457082) (← links)
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity (Q3457087) (← links)
- Coded-BKW: Solving LWE Using Lattice Codes (Q3457103) (← links)
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices (Q3457104) (← links)
- Provably Weak Instances of Ring-LWE (Q3457105) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- On the hardness of learning with errors with binary secrets (Q4612477) (← links)
- Aligned Drawings of Planar Graphs (Q4625095) (← links)
- Grid-Obstacle Representations with Connections to Staircase Guarding (Q4625102) (← links)
- Identity-based blind signature from lattices (Q4641449) (← links)
- Packed Ciphertexts in LWE-Based Homomorphic Encryption (Q4915997) (← links)
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
- Lossy Codes and a New Variant of the Learning-With-Errors Problem (Q4924401) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- (Q5009633) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
