Pages that link to "Item:Q5199210"
From MaRDI portal
The following pages link to Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages (Q5199210):
Displaying 50 items.
- (Leveled) fully homomorphic encryption without bootstrapping (Q92720) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Secret computation of purchase history data using somewhat homomorphic encryption (Q890595) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise (Q1616886) (← links)
- Lattice-based certificateless encryption scheme (Q1633051) (← links)
- Homomorphic lower digits removal and improved FHE bootstrapping (Q1648799) (← links)
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data (Q1648801) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- Security considerations for Galois non-dual RLWE families (Q1698662) (← links)
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- A note on Ring-LWE security in the case of fully homomorphic encryption (Q1746823) (← 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)
- LWE-based FHE with better parameters (Q1800587) (← links)
- An efficient somewhat homomorphic encryption scheme based on factorization (Q1989457) (← links)
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Discretisation and product distributions in ring-LWE (Q2027267) (← links)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- LPPRS: new location privacy preserving schemes based on ring signature over mobile social networks (Q2057153) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← links)
- Efficient homomorphic conversion between (ring) LWE ciphertexts (Q2117044) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes (Q2152045) (← links)
- Approximate homomorphic encryption with reduced approximation error (Q2152155) (← links)
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\) (Q2152174) (← links)
- Tightly secure ring-LWE based key encapsulation with short ciphertexts (Q2167708) (← links)
- The polynomial learning with errors problem and the smearing condition (Q2168804) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization (Q2170015) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Security estimates of a ring-LWE symmetric cryptosystem against chosen plaintext attack (Q2215308) (← links)
- EPiC: efficient privacy-preserving counting for MapReduce (Q2218469) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Some security bounds for the key sizes of DGHV scheme (Q2254535) (← links)
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905) (← links)
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption (Q2403232) (← links)
- Fully homomorphic SIMD operations (Q2439746) (← links)
- Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme (Q2515963) (← links)
- Error analysis of weak poly-LWE instances (Q2632837) (← links)
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives (Q2663507) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
