Efficient coding for secure computing with additively-homomorphic encrypted data

DOI10.1504/IJACT.2020.107160MaRDI QIDQ2019835zbMATH OpenOpenAlexFDO

Authors Thijs Veugen

Publication date 22 April 2021

Published in International Journal of Applied Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijact.2020.107160

zbMATH Keywords

batchinghomomorphic encryptionpackingsecure comparisonsecure equalitysecure set intersectionvector addition chain

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Efficient computations over encrypted data blocks
• How to compute on encrypted data
• Encrypted integer division and secure comparison
• Computing arbitrary functions of encrypted data
• Semi-homomorphic encryption and multiparty computation

Cited in

(4)

• Additive mixing modulation for public key encryption based on distributed dynamics
• Encrypted integer division and secure comparison
• Efficient and privacy-preserving tree-based inference via additive homomorphic encryption
• A novel secure observer-based controller and attack detection scheme for networked control systems

This page was built for publication: Efficient coding for secure computing with additively-homomorphic encrypted data

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