Cryptanalysis of a protocol for efficient sorting on SHE encrypted data

DOI10.1007/978-3-030-35199-1_14zbMATH Open1454.94088OpenAlexW2982485243MaRDI QIDQ2177665FDOQ2177665

Authors: Shyam Murthy, Srinivas Vivek 

Publication date: 6 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-35199-1_14

Recommendations

• Depth optimized efficient homomorphic sorting
• Homomorphic rank sort using surrogate polynomials
• Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
• Accelerating sorting of fully homomorphic encrypted data
• A secure multi-party computation protocol for the sorting problem

zbMATH Keywords

comparisonsortingpolynomial reconstructionsomewhat homomorphic encryptionlow-depth circuit

Mathematics Subject Classification ID

Cryptography (94A60) Searching and sorting (68P10)

Cited In (4)

• Revisiting driver anonymity in ORide
• Accelerating sorting of fully homomorphic encrypted data
• Depth optimized efficient homomorphic sorting
• Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting

This page was built for publication: Cryptanalysis of a protocol for efficient sorting on SHE encrypted data

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