Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms

DOI10.1007/978-3-642-37682-5_15zbMath1342.68121OpenAlexW151752673MaRDI QIDQ4922869

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

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

sortingunconditional securitysecret sharingmulti-party protocolcomparison sort

Mathematics Subject Classification ID

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

Related Items (6)

Secure Multi-party Shuffling ⋮ Secure multi-party computation in large networks ⋮ 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 ⋮ Practically Efficient Secure Single-Commodity Multi-market Auctions

This page was built for publication: Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms