Depth optimized efficient homomorphic sorting

DOI10.1007/978-3-319-22174-8_4MaRDI QIDQ2946441zbMATH OpenOpenAlexFDO

Authors Gizem S. Çetin, Yarkın Doröz, Berk Sunar, 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 depthhomomorphic sortingsomewhat homomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Homomorphic rank sort using surrogate polynomials
• Accelerating sorting of fully homomorphic encrypted data
• Cryptanalysis of a protocol for efficient sorting on SHE encrypted data
• Numerical method for comparison on homomorphically encrypted numbers
• Fully homomorphic encryption using ideal lattices

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Accelerating sorting of fully homomorphic encrypted data
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with polylog overhead
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Homomorphic AES evaluation using the modified LTV scheme
• Homomorphic evaluation of the AES circuit
• scientific article; zbMATH DE number 1617945 (Why is no real title available?)
• scientific article; zbMATH DE number 1033192 (Why is no real title available?)
• Implementing Gentry's fully-homomorphic encryption scheme
• Improved security for a ring-based fully homomorphic encryption scheme
• Making NTRU as secure as worst-case problems over ideal lattices
• ML confidential: machine learning on encrypted data
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Private computation on encrypted genomic data

Cited in

(6)

• Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
• Cryptanalysis of a protocol for efficient sorting on SHE encrypted data
• Homomorphic rank sort using surrogate polynomials
• Accelerating sorting of fully homomorphic encrypted data
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• Faster homomorphic operations and beyond: expediting homomorphic computation via Boolean circuit optimization

This page was built for publication: Depth optimized efficient homomorphic sorting

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