Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts

DOI10.1007/978-3-031-17140-6_20MaRDI QIDQ6173299zbMATH OpenOpenAlexFDO

Authors Jelle Vos, Daniël Vos, Zekeriya Erkin

Publication date 21 July 2023

Published in Computer Security – ESORICS 2022 (Search for Journal in Brave)

Full work available at URL http://resolver.tudelft.nl/uuid:b61bcab1-d64d-4138-9c01-faefcc729b1c

zbMATH Keywords

applied cryptographydata packingfully homomorphic encryptionsecure outsourced data processing

Mathematics Subject Classification ID

Computer security (68M25) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Faster homomorphic encryption over GPGPUs via hierarchical DGT
• Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
• Accelerating homomorphic evaluation on reconfigurable hardware
• Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption
• Privacy preserving computation in cloud using noise-free fully homomorphic encryption (FHE) schemes

Cites work

• Algorithms in HElib
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with polylog overhead
• Homomorphic encryption for arithmetic of approximate numbers
• New methods to color the vertices of a graph
• Optimal Rearrangeable Multistage Connecting Networks
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Reducibility among combinatorial problems

This page was built for publication: Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts

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