Pages that link to "Item:Q3563828"

The following pages link to Fully Homomorphic Encryption over the Integers (Q3563828):

Displaying 45 items.

• Integer Reconstruction Public-Key Encryption (Q3297634) (← links)
• Approximate common divisor problem and lattice sieving (Q3382022) (← links)
• Fully Homomorphic Encryption with Auxiliary Inputs (Q3454587) (← links)
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity (Q3457087) (← links)
• New Multilinear Maps Over the Integers (Q3457114) (← links)
• Cryptanalysis of the Co-ACD Assumption (Q3457128) (← links)
• Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
• Private Computations over the Integers (Q4834387) (← links)
• Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures (Q4916021) (← links)
• Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES (Q4916022) (← links)
• Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications (Q4963266) (← links)
• Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory (Q4964355) (← links)
• Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
• The Complexity of Public-Key Cryptography (Q5021130) (← links)
• Homomorphic Encryption (Q5021133) (← links)
• New Ideas to Build Noise-Free Homomorphic Cryptosystems (Q5048988) (← links)
• A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties (Q5056025) (← links)
• Verifiable Range Query Processing for Cloud Computing (Q5056027) (← links)
• An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers (Q5056042) (← links)
• (Q5091154) (← links)
• HDDA: DataSifter: statistical obfuscation of electronic health records and other sensitive datasets (Q5107323) (← links)
• Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (Q5267418) (← links)
• Circuit-Private Multi-key FHE (Q5738758) (← links)
• FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime (Q5738759) (← links)
• Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges (Q5739024) (← links)
• On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
• Simultaneous diagonalization of incomplete matrices and applications (Q5853794) (← links)
• Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes (Q6108618) (← links)
• Multi-key Homomorphic Proxy Re-Encryption (Q6108846) (← links)
• Verifiable Decryption for Fully Homomorphic Encryption (Q6108847) (← links)
• Homomorphic encryption: a mathematical survey (Q6118172) (← links)
• EvalRound algorithm in CKKS bootstrapping (Q6132409) (← links)
• FINAL: faster FHE instantiated with NTRU and LWE (Q6132410) (← links)
• Computing primitive idempotents in finite commutative rings and applications (Q6149152) (← links)
• $$\mathsf {HIKE}$$ : Walking the Privacy Trail (Q6162313) (← links)
• Fully homomorphic encryption scheme and Fermat’s little theorem (Q6183984) (← links)
• Toward practical privacy-preserving linear regression (Q6199734) (← links)
• On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption (Q6487418) (← links)
• Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE (Q6488031) (← links)
• Threshold secret sharing with geometric algebras (Q6496087) (← links)
• PIE: \(p\)-adic encoding for high-precision arithmetic in homomorphic encryption (Q6535086) (← links)
• Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity (Q6595687) (← links)
• On the LWE cryptosystem with more general disturbance (Q6608568) (← links)
• Circuit bootstrapping: faster and smaller (Q6636511) (← links)
• Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)