Pages that link to "Item:Q5495009"
From MaRDI portal
The following pages link to Efficient Fully Homomorphic Encryption from (Standard) LWE (Q5495009):
Displaying 50 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- Polly cracker, revisited (Q285245) (← links)
- Quantum fully homomorphic encryption scheme based on universal quantum circuit (Q496935) (← 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)
- Cryptanalysis of a homomorphic encryption scheme (Q680918) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← 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)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Lattice-based certificateless encryption scheme (Q1633051) (← links)
- Practical private-key fully homomorphic encryption in rings (Q1647860) (← links)
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data (Q1648801) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Homomorphic encryption systems statement: trends and challenges (Q2026280) (← links)
- Optimal broadcast encryption from pairings and LWE (Q2055600) (← links)
- Impossibility results for lattice-based functional encryption schemes (Q2055607) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Bootstrapping fully homomorphic encryption over the integers in less than one second (Q2061925) (← 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)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- Integral matrix Gram root and lattice Gaussian sampling without floats (Q2119026) (← links)
- Round efficient secure multiparty quantum computation with identifiable abort (Q2120089) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- Large message homomorphic secret sharing from DCR and applications (Q2129016) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation (Q2152020) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- Tightly secure ring-LWE based key encapsulation with short ciphertexts (Q2167708) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
- Flattening NTRU for evaluation key free homomorphic encryption (Q2191204) (← links)
- Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load (Q2218487) (← links)
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing (Q2224811) (← links)
- Some security bounds for the key sizes of DGHV scheme (Q2254535) (← links)
