Pages that link to "Item:Q3563828"
From MaRDI portal
The following pages link to Fully Homomorphic Encryption over the Integers (Q3563828):
Displaying 50 items.
- 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)
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation (Q2330096) (← links)
- On the greatest common divisor of shifted sets (Q2343172) (← links)
- Computing on authenticated data (Q2344052) (← links)
- On the deductive security of queries to confidential databases in cloud computing systems (Q2364247) (← links)
- Some homomorphic cryptosystems based on nonassociative structures (Q2399990) (← links)
- Secure cloud computing based on threshold homomorphic encryption (Q2405865) (← links)
- Cryptanalysis of the CLT13 multilinear map (Q2423847) (← links)
- Fully homomorphic SIMD operations (Q2439746) (← links)
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (Q2632011) (← links)
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries (Q2656784) (← links)
- Bootstrapping for helib (Q2661696) (← links)
- Privacy-preserving distributed deep learning based on secret sharing (Q2663489) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- A multi-valued quantum fully homomorphic encryption scheme (Q2687199) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- CCA-Secure Keyed-Fully Homomorphic Encryption (Q2798772) (← links)
- Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption (Q2807191) (← links)
- Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem (Q2807210) (← links)
- Candidate indistinguishability obfuscation and functional encryption for all circuits (Q2816296) (← links)
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits (Q2817870) (← links)
- Accelerating Homomorphic Computations on Rational Numbers (Q2822686) (← links)
- A novel fully homomorphic encryption scheme bsed on LWE (Q2825264) (← links)
- FHE Circuit Privacy Almost for Free (Q2829211) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- On CCA-Secure Somewhat Homomorphic Encryption (Q2889863) (← links)
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers (Q2894423) (← links)
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP (Q2914305) (← links)
- Partial Key Exposure Attack on CRT-RSA (Q2945387) (← links)
- Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem (Q2946396) (← links)
- Depth Optimized Efficient Homomorphic Sorting (Q2946441) (← links)
- Private Computation on Encrypted Genomic Data (Q2946463) (← links)
- On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes (Q2946478) (← links)
- Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes (Q2947538) (← links)
- Algorithms for the approximate common divisor problem (Q2970999) (← links)
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers (Q2980858) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design (Q3011916) (← links)
- Benaloh’s Dense Probabilistic Encryption Revisited (Q3011926) (← links)
- Efficient Secure Two-Party Exponentiation (Q3073692) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Generalized Learning Problems and Applications to Non-commutative Cryptography (Q3092369) (← links)
- On Constructing Homomorphic Encryption Schemes from Coding Theory (Q3104683) (← links)
- Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption (Q3194623) (← links)
