New lattice-based cryptographic constructions
From MaRDI portal
Publication:5435669
DOI10.1145/1039488.1039490zbMath1125.94026MaRDI QIDQ5435669
Publication date: 14 January 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1039488.1039490
Related Items
Cryptographic Functions from Worst-Case Complexity Assumptions, Curves, Jacobians, and cryptography, Predicting Lattice Reduction, Deterministic compression with uncertain priors, The truth behind the myth of the folk theorem, Expanders with respect to Hadamard spaces and random graphs, Limits of local algorithms over sparse random graphs, Unnamed Item, Computational indistinguishability between quantum states and its cryptographic application, Lattice-based key exchange on small integer solution problem, The hunting of the SNARK, STP-LWE: A variant of learning with error for a flexible encryption, Quantum algorithm design: techniques and applications, Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices, On the structure of Boolean functions with small spectral norm, Cryptographic hardness for learning intersections of halfspaces, Improved hardness results for unique shortest vector problem, Finding Shortest Lattice Vectors in the Presence of Gaps, Post-Quantum Forward-Secure Onion Routing, Decompositions of Triangle-Dense Graphs, Measure inequalities and the transference theorem in the geometry of numbers, A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors, Augmented Learning with Errors: The Untapped Potential of the Error Term, Lattice-based FHE as secure as PKE, Cryptogenography, Limits of random oracles in secure computation, Non-commutative arithmetic circuits with division, Decision trees, protocols and the entropy-influence conjecture, Locally testable codes and cayley graphs, Invitation games and the price of stability, Welfare maximization and truthfulness in mechanism design with ordinal preferences, Coordination mechanisms from (almost) all scheduling policies, Private interactive communication across an adversarial channel, Tree codes and a conjecture on exponential sums, Capacity of non-malleable codes, Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications, Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements, Sequential decision making with vector outcomes, Learning mixtures of arbitrary distributions over large discrete domains, Why do simple algorithms for triangle enumeration work in the real world?, Black-box obfuscation for d-CNFs, Candidate weak pseudorandom functions in AC 0 ○ MOD 2, Iterated group products and leakage resilience against NC1, Building one-time memories from isolated qubits, Attribute-efficient evolvability of linear functions, Energy-efficient circuit design, Rate-independent computation in continuous chemical reaction networks, Testers and their applications, On the automorphism groups of strongly regular graphs I, Faster private release of marginals on small databases, Mechanism design in large games, Redrawing the boundaries on purchasing data from privacy-sensitive individuals, Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems, Complexity of approximating CSP with balance / hard constraints, Integer feasibility of random polytopes, Multireference alignment using semidefinite programming, Partial tests, universal tests and decomposability, High dimensional expanders and property testing, Parameterized testability, Direct sum fails for zero error average communication, Rational arguments, Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design, Better Key Sizes (and Attacks) for LWE-Based Encryption, Quantum algorithms for algebraic problems, Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle, Authenticated Byzantine Generals in Dual Failure Model
