A secure multi-party computation protocol for the sorting problem

MaRDI QIDQ5322675zbMATH OpenFDO

Authors Shundong Li, Xuanping Zhang

Publication date 22 July 2009

zbMATH Keywords

cryptographymulti-party secure computationprivacy-preserving

Mathematics Subject Classification ID

Searching and sorting (68P10) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Practically efficient multi-party sorting protocols from comparison sort algorithms
• Efficient secure multiparty computation protocol for sequencing problem over insecure channel
• Secure computation of the median (and other elements of specified ranks)
• Secure Multi-party Shuffling
• Advances in Cryptology - EUROCRYPT 2004

Cited in

(10)

• Byzantine-resistant total ordering algorithms.
• Cryptanalysis of a protocol for efficient sorting on SHE encrypted data
• A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
• Secure multi-party computation protocol for sequencing problem
• Efficient secure multiparty computation protocol for sequencing problem over insecure channel
• String sorting based efficient secure database query
• Practically efficient multi-party sorting protocols from comparison sort algorithms
• scientific article; zbMATH DE number 7267018 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Secure computation of the median (and other elements of specified ranks)

This page was built for publication: A secure multi-party computation protocol for the sorting problem

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