Accelerating sorting of fully homomorphic encrypted data

DOI10.1007/978-3-319-03515-4_17zbMATH Open1295.94034OpenAlexW148003122MaRDI QIDQ2872059FDOQ2872059

Authors: Ayantika Chatterjee, Manish Kaushal, Indranil Gupta 

Publication date: 14 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03515-4_17

Recommendations

• Depth optimized efficient homomorphic sorting
• Homomorphic rank sort using surrogate polynomials
• Cryptanalysis of a protocol for efficient sorting on SHE encrypted data
• Fully homomorphic encryption using ideal lattices
• How to compute on encrypted data

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (1)

• Depth optimized efficient homomorphic sorting

This page was built for publication: Accelerating sorting of fully homomorphic encrypted data

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