Secure computation of the median (and other elements of specified ranks)

DOI10.1007/s00145-010-9059-9zbMath1195.94047MaRDI QIDQ5962224

Gagan Aggarwal, Benny Pinkas, Nina Mishra

Publication date: 21 September 2010

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-010-9059-9

zbMATH Keywords

median; \(k\)th-ranked element; malicious adversary; secure function evaluation; secure multi-party computation; semi-honest adversary

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Security and composition of multiparty cryptographic protocols
• Selective private function evaluation with applications to private statistics
• Efficient Correlated Action Selection
• Universally composable two-party and multi-party secure computation
• Covert two-party computation
• An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
• Foundations of Cryptography
• Communication Complexity
• Communication preserving protocols for secure function evaluation
• Advances in Cryptology - CRYPTO 2003
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Efficient Two-Party Secure Computation on Committed Inputs
• Strong Conditional Oblivious Transfer and Computing on Intervals
• Privacy preserving data mining