Private Computation on Encrypted Genomic Data
From MaRDI portal
Publication:2946463
DOI10.1007/978-3-319-16295-9_1zbMath1378.94053OpenAlexW1019809662MaRDI QIDQ2946463
Michael Naehrig, Adriana López-Alt, Kristin E. Lauter
Publication date: 17 September 2015
Published in: Progress in Cryptology - LATINCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16295-9_1
Related Items
Blending FHE-NTRU Keys – The Excalibur Property, Bootstrapping for approximate homomorphic encryption, Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption, Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression, Depth Optimized Efficient Homomorphic Sorting, Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes, Efficiently processing complex-valued data in homomorphic encryption, Flattening NTRU for evaluation key free homomorphic encryption, Privacy-preserving set-based estimation using partially homomorphic encryption, How to compress encrypted data, Private AI: Machine Learning on Encrypted Data, Privacy-preserving pattern matching on encrypted data, Fully Homomorphic Encryption for Point Numbers, Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression, Revisiting Lattice Attacks on Overstretched NTRU Parameters, Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges
Cites Work
- The Magma algebra system. I: The user language
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Lattice-based FHE as secure as PKE
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Fully Homomorphic Encryption over the Integers
- Penalized logistic regression for detecting gene interactions
- ML Confidential: Machine Learning on Encrypted Data
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE