Fully homomorphic encryption over the integers
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Homomorphically encrypted arithmetic operations over the integer ring
- Practical private-key fully homomorphic encryption in rings
- Homomorphic lower digits removal and improved FHE bootstrapping
- Bootstrapping for approximate homomorphic encryption
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- Privacy preserving distributed optimization using homomorphic encryption
- A full RNS variant of approximate homomorphic encryption
- Unsupervised Machine Learning on encrypted data
- Practical homomorphic encryption over the integers for secure computation in the cloud
- Fully homomorphic encryption from the finite field isomorphism problem
- CRT-based fully homomorphic encryption over the integers
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- A new reversible date-hiding algorithm for encrypted images
- FHE over the integers and modular arithmetic circuits
- Group homomorphic encryption: characterizations, impossibility results, and applications
- An efficient somewhat homomorphic encryption scheme based on factorization
- Partially homomorphic encryption schemes over finite fields
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
- Algorithms for CRT-variant of approximate greatest common divisor problem
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Verifiable single-server private information retrieval from LWE with binary errors
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- A polynomial-time algorithm for solving the hidden subset sum problem
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Towards faster polynomial-time lattice reduction
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- On the smoothing parameter and last minimum of random orthogonal lattices
- Fully homomorphic encryption in real world applications
- Flattening NTRU for evaluation key free homomorphic encryption
- EPiC: efficient privacy-preserving counting for MapReduce
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
- Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit
- Some security bounds for the key sizes of DGHV scheme
- Encrypted data processing with homomorphic re-encryption
- TFHE: fast fully homomorphic encryption over the torus
- Verification of quantum computation: an overview of existing approaches
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
- On the greatest common divisor of shifted sets
- Computing on authenticated data
- On the deductive security of queries to confidential databases in cloud computing systems
- Some homomorphic cryptosystems based on nonassociative structures
- Secure cloud computing based on threshold homomorphic encryption
- Cryptanalysis of the CLT13 multilinear map
- Fully homomorphic SIMD operations
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
- Bootstrapping for helib
- Privacy-preserving distributed deep learning based on secret sharing
- Cryptographic algorithms for privacy-preserving online applications
- A multi-valued quantum fully homomorphic encryption scheme
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- CCA-secure keyed-fully homomorphic encryption
- Minimizing the number of bootstrappings in fully homomorphic encryption
- Private information retrieval with preprocessing based on the approximate GCD problem
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits
- Accelerating homomorphic computations on rational numbers
- A novel fully homomorphic encryption scheme bsed on LWE
- FHE circuit privacy almost for free
- Breaking the circuit size barrier for secure computation under DDH
- Polly cracker, revisited
- On CCA-Secure Somewhat Homomorphic Encryption
- On the CCA-1 security of somewhat homomorphic encryption over the integers
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Partial key exposure attack on CRT-RSA
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Depth optimized efficient homomorphic sorting
- Private computation on encrypted genomic data
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- Fully homomophic encryption over the integers revisited
- (Batch) fully homomorphic encryption over integers for non-binary message spaces
- A symmetric key fully homomorphic encryption scheme using general Chinese remainder theorem
- Algorithms for the approximate common divisor problem
- Cryptanalysis of a homomorphic encryption scheme over integers
- Fully homomorphic encryption for point numbers
- Fully homomorphic encryption from approximate ideal lattices
- Secure outsourced computation
- Using the inhomogeneous simultaneous approximation problem for cryptographic design
- Benaloh's dense probabilistic encryption revisited
- Faster fully homomorphic encryption
- Efficient secure two-party exponentiation
- The geometry of lattice cryptography
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- On constructing homomorphic encryption schemes from coding theory
- Secure statistical analysis using RLWE-based homomorphic encryption
- Integer Reconstruction Public-Key Encryption
- Approximate common divisor problem and lattice sieving
- Fully homomorphic encryption with auxiliary inputs
This page was built for publication: Fully homomorphic encryption over the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563828)
