Secure federated Boolean count queries using fully-homomorphic cryptography

DOI10.1007/978-1-0716-3989-4_4MaRDI QIDQ7022843zbMATH OpenFDO

Authors Alexander T. Leighton, Yun William Yu

Publication date 24 February 2025

Full work available at URL https://doi.org/10.1007/978-1-0716-3989-4_4

zbMATH Keywords

federated count-queryhomomorphic encryptionprobabilistic sketch

Mathematics Subject Classification ID

Medical applications (general) (92C50) Cryptography (94A60)

Cites work

• An improved RNS variant of the BFV homomorphic encryption scheme
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• LogLog counting of large cardinalities (extended abstract)
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Secure and efficient private set intersection cardinality using Bloom filter
• The algorithmic foundations of differential privacy

Cited in

(1)

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

This page was built for publication: Secure federated Boolean count queries using fully-homomorphic cryptography

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