(Leveled) fully homomorphic encryption without bootstrapping
From MaRDI portal
Publication:2826066
DOI10.1145/2090236.2090262zbMath1347.68120OpenAlexW2152926062MaRDI QIDQ2826066
Zvika Brakerski, Vinod Vaikuntanathan, Craig Gentry
Publication date: 7 October 2016
Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2090236.2090262
Related Items (only showing first 100 items - show all)
Constraining and Watermarking PRFs from Milder Assumptions ⋮ Homomorphic Encryption Standard ⋮ An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers ⋮ Fully Homomorphic Encryption with Auxiliary Inputs ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption ⋮ Depth Optimized Efficient Homomorphic Sorting ⋮ Private Computation on Encrypted Genomic Data ⋮ Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ Augmented Learning with Errors: The Untapped Potential of the Error Term ⋮ A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV ⋮ Privacy-preserving blueprints ⋮ On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ A Homomorphic Proxy Re-encryption from Lattices ⋮ Optimisations and tradeoffs for HElib ⋮ Post-quantum anonymity of Kyber ⋮ Oblivious message retrieval ⋮ Solving LWR via BDD Strategy: Modulus Switching Approach ⋮ Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes ⋮ Verifiable decryption in the head ⋮ Multi-key Homomorphic Proxy Re-Encryption ⋮ Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment ⋮ On error distributions in ring-based LWE ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Fully Homomorphic Encryption for Point Numbers ⋮ Deterministic compression with uncertain priors ⋮ Enhancing Data Parallelism of Fully Homomorphic Encryption ⋮ 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 ⋮ Boolean Functions for Homomorphic-Friendly Stream Ciphers ⋮ Improved Multiplication Triple Generation over Rings via RLWE-Based AHE ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ Packed Ciphertexts in LWE-Based Homomorphic Encryption ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ The truth behind the myth of the folk theorem ⋮ Expanders with respect to Hadamard spaces and random graphs ⋮ Unnamed Item ⋮ Limits of local algorithms over sparse random graphs ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications ⋮ Integer Version of Ring-LWE and Its Applications ⋮ Private Conjunctive Query over Encrypted Data ⋮ Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts ⋮ How to Use Indistinguishability Obfuscation: Deniable Encryption, and More ⋮ Outsourcing Medical Dataset Analysis: A Possible Solution ⋮ Faster Homomorphic Evaluation of Discrete Fourier Transforms ⋮ Homomorphic Encryption ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Lattice-based key exchange on small integer solution problem
Cites Work
- Unnamed Item
- The reproducible properties of correct forecasts
- The dimensions of individual strings and sequences
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- The Complexity of Forecast Testing
- The Well-Calibrated Bayesian
- Asymptotic calibration
- Dimension in Complexity Classes
- Universal prediction
- THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES
This page was built for publication: (Leveled) fully homomorphic encryption without bootstrapping
