Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
From MaRDI portal
Publication:3582751
DOI10.1007/978-3-642-14623-7_7zbMath1280.94059MaRDI QIDQ3582751
Publication date: 24 August 2010
Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_7
94A60: Cryptography
Related Items
Deterministic compression with uncertain priors, Short Generators Without Quantum Computers: The Case of Multiquadratics, 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, Lattice-based key exchange on small integer solution problem, Lattice-based certificateless encryption scheme, CRT-based fully homomorphic encryption over the integers, On the structure of Boolean functions with small spectral norm, Random self-reducibility of ideal-SVP via Arakelov random walks, Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation, Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives, Decompositions of Triangle-Dense Graphs, Cryptanalysis of a Homomorphic Encryption Scheme Over Integers, 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, Benaloh’s Dense Probabilistic Encryption Revisited, The Geometry of Lattice Cryptography, Generalized Learning Problems and Applications to Non-commutative Cryptography
