Efficient privacy-preserving counting method with homomorphic encryption

DOI10.1007/978-981-96-5566-3_7MaRDI QIDQ6877470zbMATH OpenFDO

Authors Jae Yun Kim, Jieun Yun, Jung Hee Cheon, Saerom Park

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-981-96-5566-3_7

zbMATH Keywords

applied cryptographyencrypted counting algorithmhomomorphic encryptioninformation securitynatural language processing

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A full RNS variant of approximate homomorphic encryption
• Distributed Private Data Analysis: Simultaneously Solving How and What
• Efficient homomorphic comparison methods with optimal complexity
• Homomorphic encryption for arithmetic of approximate numbers
• TFHE: fast fully homomorphic encryption over the torus

This page was built for publication: Efficient privacy-preserving counting method with homomorphic encryption

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