Depth Optimized Efficient Homomorphic Sorting
type: Item
instance of: scholarly article
title: Depth Optimized Efficient Homomorphic Sorting
zbMATH Open document ID: 1370.94494
DOI: 10.1007/978-3-319-22174-8_4
author: Gizem S. Çetin
author: Yarkın Doröz
author: Berk Sunar
author: Erkay Savaş
published in: Progress in Cryptology -- LATINCRYPT 2015
publication date: 2015-09-17T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6482938
zbMATH Keywords: homomorphic sorting
zbMATH Keywords: circuit depth
zbMATH Keywords: somewhat homomorphic encryption
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-319-22174-8 4
OpenAlex ID: W1621599745
cites work: Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE
cites work: Accelerating Sorting of Fully Homomorphic Encrypted Data
cites work: Fully Homomorphic Encryption over the Integers
cites work: Homomorphic AES evaluation using the modified LTV scheme
cites work: Q2724463
cites work: Fully homomorphic encryption using ideal lattices
cites work: Implementing Gentry’s Fully-Homomorphic Encryption Scheme
cites work: Fully Homomorphic Encryption with Polylog Overhead
cites work: Homomorphic Evaluation of the AES Circuit
cites work: ML Confidential: Machine Learning on Encrypted Data
cites work: Q4344097
cites work: Private Computation on Encrypted Genomic Data
cites work: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
cites work: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
description: scientific article; zbMATH DE number 6482938