Pages that link to "Item:Q3563828"
From MaRDI portal
The following pages link to Fully Homomorphic Encryption over the Integers (Q3563828):
Displayed 50 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- Polly cracker, revisited (Q285245) (← links)
- An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud (Q355501) (← links)
- Approximate GCD of several univariate polynomials with small degree perturbations (Q412204) (← links)
- Discrete logarithm based additively homomorphic encryption and secure data aggregation (Q433021) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
- Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service (Q680776) (← links)
- Cryptanalysis of a homomorphic encryption scheme (Q680918) (← links)
- Trusted computing with addition machines. I (Q681716) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Secret computation of purchase history data using somewhat homomorphic encryption (Q890595) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Practical private-key fully homomorphic encryption in rings (Q1647860) (← links)
- Homomorphic lower digits removal and improved FHE bootstrapping (Q1648799) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- Privacy preserving distributed optimization using homomorphic encryption (Q1716476) (← links)
- A full RNS variant of approximate homomorphic encryption (Q1726685) (← links)
- Unsupervised Machine Learning on encrypted data (Q1726695) (← links)
- CRT-based fully homomorphic encryption over the integers (Q1749613) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- A new reversible date-hiding algorithm for encrypted images (Q1793158) (← links)
- Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- Algorithms for CRT-variant of approximate greatest common divisor problem (Q2025331) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function (Q2056708) (← links)
- Bootstrapping fully homomorphic encryption over the integers in less than one second (Q2061925) (← links)
- A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← links)
- An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- On the smoothing parameter and last minimum of random orthogonal lattices (Q2182065) (← links)
- Flattening NTRU for evaluation key free homomorphic encryption (Q2191204) (← links)
- EPiC: efficient privacy-preserving counting for MapReduce (Q2218469) (← links)
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing (Q2224811) (← links)
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic (Q2229267) (← links)
- Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit (Q2239686) (← links)
- Some security bounds for the key sizes of DGHV scheme (Q2254535) (← links)
- Encrypted data processing with homomorphic re-encryption (Q2293264) (← links)
- TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)