Private computation on encrypted genomic data
From MaRDI portal
Publication:2946463
DOI10.1007/978-3-319-16295-9_1zbMATH Open1378.94053OpenAlexW1019809662MaRDI QIDQ2946463FDOQ2946463
Authors: Adriana López-Alt, Michael Naehrig, Kristin 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
Recommendations
- Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- On limitations and alternatives of privacy-preserving cryptographic protocols for genomic data
- A new privacy homomorphism and applications
- Computing arbitrary functions of encrypted data
Cites Work
- The Magma algebra system. I: The user language
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Penalized logistic regression for detecting gene interactions
- (Leveled) fully homomorphic encryption without bootstrapping
- Improved security for a ring-based fully homomorphic encryption scheme
- Making NTRU as secure as worst-case problems over ideal lattices
- A comparison of the homomorphic encryption schemes FV and YASHE
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- ML confidential: machine learning on encrypted data
- Lattice-based FHE as secure as PKE
Cited In (25)
- How to compress encrypted data
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- Privacy-preserving pattern matching on encrypted data
- Inference attacks on genomic privacy with an improved HMM and an RCNN model for unrelated individuals
- Secure statistical analysis using RLWE-based homomorphic encryption
- Sharing privacy protected and statistically sound clinical research data using outsourced data storage
- Bootstrapping for approximate homomorphic encryption
- Privacy-preserving encryption scheme using DNA parentage test
- Fully homomorphic encryption for point numbers
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Efficiently processing complex-valued data in homomorphic encryption
- Privacy-preserving edit distance computation using secret-sharing two-party computation
- PIE: \(p\)-adic encoding for high-precision arithmetic in homomorphic encryption
- Private AI: Machine Learning on Encrypted Data
- Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data
- On limitations and alternatives of privacy-preserving cryptographic protocols for genomic data
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- Privacy-preserving set-based estimation using partially homomorphic encryption
- Depth optimized efficient homomorphic sorting
- Blending FHE-NTRU keys -- the excalibur property
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Flattening NTRU for evaluation key free homomorphic encryption
- A framework with randomized encoding for a fast privacy preserving calculation of non-linear kernels for machine learning applications in precision medicine
- Efficient privacy-preserving variable-length substring match for genome sequence
This page was built for publication: Private computation on encrypted genomic data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946463)
