Pages that link to "Item:Q5435669"
From MaRDI portal
The following pages link to New lattice-based cryptographic constructions (Q5435669):
Displaying 50 items.
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- STP-LWE: A variant of learning with error for a flexible encryption (Q1718158) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- Post-Quantum Forward-Secure Onion Routing (Q2794504) (← links)
- Decompositions of Triangle-Dense Graphs (Q2796209) (← links)
- Measure inequalities and the transference theorem in the geometry of numbers (Q2862169) (← links)
- A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)
- Augmented Learning with Errors: The Untapped Potential of the Error Term (Q2948191) (← links)
- Lattice-based FHE as secure as PKE (Q2988863) (← links)
- Cryptogenography (Q2988864) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- Non-commutative arithmetic circuits with division (Q2988867) (← links)
- Decision trees, protocols and the entropy-influence conjecture (Q2988868) (← links)
- Locally testable codes and cayley graphs (Q2988869) (← links)
- Invitation games and the price of stability (Q2988870) (← links)
- Welfare maximization and truthfulness in mechanism design with ordinal preferences (Q2988871) (← links)
- Coordination mechanisms from (almost) all scheduling policies (Q2988872) (← links)
- Private interactive communication across an adversarial channel (Q2988873) (← links)
- Tree codes and a conjecture on exponential sums (Q2988874) (← links)
- Capacity of non-malleable codes (Q2988875) (← links)
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (Q2988877) (← links)
- Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements (Q2988878) (← links)
- Sequential decision making with vector outcomes (Q2988880) (← links)
- Learning mixtures of arbitrary distributions over large discrete domains (Q2988881) (← links)
- Why do simple algorithms for triangle enumeration work in the real world? (Q2988883) (← links)
- Black-box obfuscation for d-CNFs (Q2988884) (← links)
- Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub> (Q2988885) (← links)
- 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)
