Generic Constant-Round Oblivious Sorting Algorithm for MPC

DOI10.1007/978-3-642-24316-5_17zbMath1298.94115OpenAlexW35722678MaRDI QIDQ3092362

Bingsheng Zhang

Publication date: 16 September 2011

Published in: Provable Security (Search for Journal in Brave)

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

zbMATH Keywords

information-theoretic securityconstant-roundSecure multi-party computationoblivious sort

Mathematics Subject Classification ID

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

Uses Software

• VIFF
• Sharemind

Cites Work

• Sorting in \(c \log n\) parallel steps
• Player simulation and general adversary structures in perfect multiparty computation
• How to share a secret
• The periodic balanced sorting network
• Evaluating Branching Programs on Encrypted Data
• Asynchronous Multiparty Computation: Theory and Implementation
• Branching Programs and Binary Decision Diagrams
• Fully homomorphic encryption using ideal lattices
• A Formal Treatment of Onion Routing
• Theory of Cryptography
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generic Constant-Round Oblivious Sorting Algorithm for MPC