Depth Optimized Efficient Homomorphic Sorting

DOI10.1007/978-3-319-22174-8_4zbMath1370.94494OpenAlexW1621599745MaRDI QIDQ2946441

Yarkın Doröz, Berk Sunar, Gizem S. Çetin, Erkay Savaş

Publication date: 17 September 2015

Published in: Progress in Cryptology -- LATINCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22174-8_4

zbMATH Keywords

circuit depthsomewhat homomorphic encryptionhomomorphic sorting

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting

Cites Work

• Unnamed Item
• Unnamed Item
• Homomorphic AES evaluation using the modified LTV scheme
• (Leveled) fully homomorphic encryption without bootstrapping
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• Accelerating Sorting of Fully Homomorphic Encrypted Data
• Fully Homomorphic Encryption with Polylog Overhead
• Homomorphic Evaluation of the AES Circuit
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Private Computation on Encrypted Genomic Data
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Fully Homomorphic Encryption over the Integers
• ML Confidential: Machine Learning on Encrypted Data
• Fully homomorphic encryption using ideal lattices
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) LWE

This page was built for publication: Depth Optimized Efficient Homomorphic Sorting