Depth optimized efficient homomorphic sorting
From MaRDI portal
Publication:2946441
DOI10.1007/978-3-319-22174-8_4zbMATH Open1370.94494OpenAlexW1621599745MaRDI QIDQ2946441FDOQ2946441
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
Recommendations
Cites Work
- Fully homomorphic encryption with polylog overhead
- Homomorphic evaluation of the AES circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Implementing Gentry's fully-homomorphic encryption scheme
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- Improved security for a ring-based fully homomorphic encryption scheme
- Making NTRU as secure as worst-case problems over ideal lattices
- Homomorphic AES evaluation using the modified LTV scheme
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Title not available (Why is that?)
- Private computation on encrypted genomic data
- ML confidential: machine learning on encrypted data
- Accelerating sorting of fully homomorphic encrypted data
Cited In (5)
- Accelerating sorting of fully homomorphic encrypted data
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- 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
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)
