Practically efficient multi-party sorting protocols from comparison sort algorithms

DOI10.1007/978-3-642-37682-5_15MaRDI QIDQ4922869zbMATH OpenOpenAlexFDO

Authors Koki Hamada, Ryo Kikuchi, Dai Ikarashi, Koji Chida, Katsumi Takahashi

Publication date 4 June 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-37682-5_15

zbMATH Keywords

comparison sortmulti-party protocolsecret sharingsortingunconditional security

Mathematics Subject Classification ID

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

Recommendations

• A secure multi-party computation protocol for the sorting problem
• Generic constant-round oblivious sorting algorithm for MPC
• Batching multiple protocols to improve efficiency of multi-party computation
• String sorting based efficient secure database query
• Efficient, oblivious data structures for MPC

Cited in

(13)

• Secure multi-party computation in large networks
• Generic constant-round oblivious sorting algorithm for MPC
• Secure Multi-party Shuffling
• String sorting based efficient secure database query
• A secure multi-party computation protocol for the sorting problem
• Practically efficient secure single-commodity multi-market auctions
• A verifiable \((k,n)\)-threshold quantum secure multiparty summation protocol
• Linear-time 2-party secure merge from additively homomorphic encryption
• Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
• Privacy-preserving Dijkstra
• Efficient permutation correlations and batched random access for two-party computation
• Linear-time secure merge in O( n) rounds
• Secret-shared shuffle from authenticated correlations

This page was built for publication: Practically efficient multi-party sorting protocols from comparison sort algorithms

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