Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Güliz Akkaya

dblp:418/4872 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomic privacy
0.912025
PRISM: privacy-preserving rare disease analysis using fully homomorphic encryption · Bioinform. 2025
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
0.912025
PRISM: privacy-preserving rare disease analysis using fully homomorphic encryption · Bioinform. 2025
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.912025
PRISM: privacy-preserving rare disease analysis using fully homomorphic encryption · Bioinform. 2025
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
TFHE
0.912025
PRISM: privacy-preserving rare disease analysis using fully homomorphic encryption · Bioinform. 2025

Methods — techniques the papers use, named apart from their topics

fully homomorphic encryption · 1.7SIMD parallelization · 1.7multithreading · 0.9multi-threading · 0.9
YearPublicationVenuePosition
2025 PRISM: privacy-preserving rare disease analysis using fully homomorphic encryption
abstract
MOTIVATION: Rare diseases affect millions of people worldwide, yet their genomic foundations remain poorly understood due to limited patient data and strict privacy regulations, such as the General Data Protection Regulation (GDPR) (https://gdpr.eu/tag/gdpr/) in March 2025. These restrictions can hinder the collaborative analysis of genomic data necessary for uncovering disease-causing variants. RESULTS: We present PRISM, a novel privacy-preserving framework based on fully homomorphic encryption (FHE) that facilitates rare disease variant analysis across multiple institutions without exposing sensitive genomic information. To address the challenges of centralized trust, PRISM is built upon a Threshold FHE scheme. This approach decentralizes key management across participating institutions and ensures no single entity can unilaterally decrypt sensitive data. Our method filters disease-causing variants under recessive, dominant, and de novo inheritance models entirely on encrypted data. We propose two algorithmic variants: a multiplication-intensive (MUL-IN) approach and an addition-intensive (ADD-IN) approach. The ADD-IN algorithms minimize the number of costly multiplication operations, enabling up to a 17× improvement in runtime for recessive/dominant filtering and 22× for de novo filtering, compared to MUL-IN methods. While ADD-IN produces larger ciphertexts, efficient parallelization via SIMD and multithreading allows it to handle millions of variants in reasonable time. To the best of our knowledge, this is the first study that utilizes FHE for privacy-preserving rare disease analysis across multiple inheritance models, demonstrating its practicality and scalability in a single-cloud setting. AVAILABILITY AND IMPLEMENTATION: The source code and the data used in this work can be found in https://github.com/mdppml/PRISM.git.
Güliz Akkaya, Nesli Erdogmus, Mete Akgün
Bioinform.1