Pages that link to "Item:Q5172710"
From MaRDI portal
The following pages link to Fully homomorphic encryption using ideal lattices (Q5172710):
Displaying 50 items.
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- Group encryption: full dynamicity, message filtering and code-based instantiation (Q2061981) (← links)
- Functional encryption for set intersection in the multi-client setting (Q2068378) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← links)
- Dynamic decentralized functional encryption (Q2096508) (← links)
- Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← links)
- An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- Influence maximization in social networks with privacy protection (Q2096744) (← links)
- Cryptanalytic extraction of neural network models (Q2102063) (← links)
- Multi-server blind quantum computation protocol with limited classical communication among servers (Q2107013) (← links)
- Blind polynomial evaluation and data trading (Q2117031) (← links)
- Succinct non-interactive secure computation (Q2119013) (← 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)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- Impossibility of quantum virtual black-box obfuscation of classical circuits (Q2120091) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- How to meet ternary LWE keys (Q2128581) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Evolving homomorphic secret sharing for hierarchical access structures (Q2128751) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Federated personalized random forest for human activity recognition (Q2130143) (← links)
- White box traitor tracing (Q2139638) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- SoK: securing email -- a stakeholder-based analysis (Q2145401) (← links)
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) (Q2148748) (← links)
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model (Q2148757) (← links)
- Black-box accumulation based on lattices (Q2149798) (← links)
- When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead (Q2149801) (← links)
- On the higher-bit version of approximate inhomogeneous short integer solution problem (Q2149828) (← links)
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation (Q2152020) (← links)
- Encrypted key-value stores (Q2152022) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- FASTA -- a stream cipher for fast FHE evaluation (Q2152175) (← links)
- Encrypted SQL arithmetic functions processing for secure cloud database (Q2154066) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data (Q2167714) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- Field instruction multiple data (Q2170023) (← links)