(Leveled) fully homomorphic encryption without bootstrapping
From MaRDI portal
Recommendations
- (Leveled) fully homomorphic encryption without bootstrapping
- Efficient fully homomorphic encryption from (standard) LWE
- Fully homomorphic encryption using ideal lattices
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A hierarchy of polynomial time lattice basis reduction algorithms
- A sieve algorithm for the shortest lattice vector problem
- Additively homomorphic encryption with \(d\)-operand multiplications
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping for HElib
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Evaluating Branching Programs on Encrypted Data
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster fully homomorphic encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Homomorphic evaluation of the AES circuit
- Implementing Gentry's fully-homomorphic encryption scheme
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Probabilistic encryption
- Public-key cryptosystems from the worst-case shortest vector problem
- Ring switching in BGV-style homomorphic encryption
- Theory of Cryptography
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
Cited in
(only showing first 100 items - show all)- A new framework for fast homomorphic matrix multiplication
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
- Full domain functional bootstrapping using the prime cyclotomic ring
- Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields
- Transparent SNARKs over Galois rings
- Relaxed functional bootstrapping: a new perspective on BGV/BFV bootstrapping
- NTRU-based bootstrapping for MK-FHEs without using overstretched parameters
- Faster BGV bootstrapping for power-of-two cyclotomics through homomorphic NTT
- Faster fully homomorphic encryption
- Fully homomorphic encryption with polylog overhead
- TFHE: fast fully homomorphic encryption over the torus
- Ring switching in BGV-style homomorphic encryption
- Breaking fully-homomorphic-encryption challenges. (Abstract)
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- Sanitization of FHE ciphertexts
- IND-CPA\textsuperscript{C}: a new security notion for conditional decryption in fully homomorphic encryption
- FHE circuit privacy almost for free
- Multi-key homomorphic encryption with threshold re-encryption
- An extension of Kannan's embedding for solving ring-based LWE problems
- A framework for cryptographic problems from linear algebra
- Cryptanalysis of Enhanced MORE
- Composing bridges
- Full domain functional bootstrapping with least significant bit encoding
- (Leveled) fully homomorphic encryption without bootstrapping
- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- CRT representation of LWE based TFHE
- Bootstrappable identity-based fully homomorphic encryption
- Leveled FHE with matrix message space
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- Modern techniques in somewhat homomorphic encryption
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- FHEW: bootstrapping homomorphic encryption in less than a second
- Efficient fully homomorphic encryption from (standard) LWE
- A multi-valued quantum fully homomorphic encryption scheme
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Linear overhead optimally-resilient robust MPC using preprocessing
- Survey of information security
- Deniable fully homomorphic encryption from learning with errors
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- A trace map attack against special ring-LWE samples
- Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- On the security of homomorphic encryption on approximate numbers
- Revisiting homomorphic encryption schemes for finite fields
- Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings
- Error-correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
- Algebraically structured LWE. Revisited
- A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion
- Private join and compute from PIR with default
- Homomorphic evaluation of lattice-based symmetric encryption schemes
- Fully homomorphic encryption with auxiliary inputs
- Algebraically structured LWE, revisited
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Improved universal thresholdizer from iterative Shamir secret sharing
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
- Secure multiparty computation with sublinear preprocessing
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- Too many hints -- when LLL breaks LWE
- Balanced non-adjacent forms
- Lattice-based FHE as secure as PKE
- Guidance for efficient selection of secure parameters for fully homomorphic encryption
- Intelligent cryptography approach for secure distributed big data storage in cloud computing
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Improving the efficiency of AES protocols in multi-party computation
- Faster homomorphic encryption over GPGPUs via hierarchical DGT
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- DAWN: smaller and faster NTRU encryption via double encoding
- Coefficient grouping for complex affine layers
- Practical dense-key bootstrapping with subring secret encapsulation
- Carousel: fully homomorphic encryption with bootstrapping over automorphism group
- \textsf{Pri}\texttt{FHE}\textsf{te}: achieving full-privacy in account-based cryptocurrencies is possible
- Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth
- Vive Galois! I: Optimal SIMD packing and packed bootstrapping for FHE
- Leveled homomorphic encryption schemes for homomorphic encryption standard
- Lattice-based homomorphic encryption for distributed privacy protection
- HomomorphicEncryption
- Provably weak instances of Ring-LWE
- Approximate homomorphic encryption with reduced approximation error
- Optimization of bootstrapping in circuits
- BLEACH: cleaning errors in discrete computations over CKKS
- Accelerating HE operations from key decomposition technique
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- HRA-secure attribute-based threshold proxy re-encryption from lattices
- Authorized multi-key fully homomorphic encryption scheme with compact ciphertext
- Learning with errors over group rings constructed by semi-direct product
- MDKG: module-lattice-based distributed key generation
- Bootstrapping for helib
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
- Maliciously secure matrix multiplication with applications to private deep learning
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- Authenticated sublinear quantum private information retrieval
This page was built for publication: (Leveled) fully homomorphic encryption without bootstrapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q92720)
