SecCT: secure and scalable count query models on encrypted genomic data

DOI10.1145/3670697MaRDI QIDQ7028268zbMATH OpenFDO

Authors Yanguo Peng, Rongqiao Liu, Jingjing Guo, Xiyue Gao, Luyuan Huang, Yaofeng Tu

Publication date 12 February 2025

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3670697

zbMATH Keywords

genotypic and phenotypic dataIND-CKA securityscalabilitysecure count query

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computational methods for problems pertaining to biology (92-08) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20)

Cites work

• A reusable and single-interactive model for secure approximate k-nearest neighbor query in cloud
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Secure federated Boolean count queries using fully-homomorphic cryptography

This page was built for publication: SecCT: secure and scalable count query models on encrypted genomic data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028268)