Pages that link to "Item:Q2826066"
From MaRDI portal
The following pages link to (Leveled) fully homomorphic encryption without bootstrapping (Q2826066):
Displaying 50 items.
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography (Q2143125) (← 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)
- The matrix reloaded: multiplication strategies in FrodoKEM (Q2149815) (← links)
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation (Q2152020) (← links)
- FASTA -- a stream cipher for fast FHE evaluation (Q2152175) (← links)
- Encrypted SQL arithmetic functions processing for secure cloud database (Q2154066) (← links)
- Application of automorphic forms to lattice problems (Q2154470) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- Field instruction multiple data (Q2170023) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- Improved filter permutators for efficient FHE: better instances and implementations (Q2179380) (← links)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
- Efficiently processing complex-valued data in homomorphic encryption (Q2191203) (← links)
- Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load (Q2218487) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- A HDL generator for flexible and efficient finite-field multipliers on FPGAs (Q2232211) (← 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)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Survey of information security (Q2385398) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Multi-user security bound for filter permutators in the random oracle model (Q2420473) (← links)
- Fully homomorphic SIMD operations (Q2439746) (← links)
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited (Q2672460) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Computational fuzzy extractor from LWE (Q2682915) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- Efficient homomorphic comparison methods with optimal complexity (Q2692383) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- Bootstrapping for BGV and BFV revisited (Q2697680) (← links)
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography (Q2698337) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- Private Database Access with HE-over-ORAM Architecture (Q2794501) (← links)
- Decompositions of Triangle-Dense Graphs (Q2796209) (← links)
- Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption (Q2807191) (← links)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296) (← links)
- Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations (Q2817469) (← links)
- FHE Circuit Privacy Almost for Free (Q2829211) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
