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

DOI10.1007/S00145-010-9059-9MaRDI QIDQ5962224zbMATH OpenOpenAlexFDO

Authors Gagan Aggarwal, Nina Mishra, Benny Pinkas

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

mediansecure function evaluationsecure multi-party computationmalicious adversarysemi-honest adversary\(k\)th-ranked element

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Advances in Cryptology - EUROCRYPT 2004
• Secure computation of the \(k^{\text{th}}\)-ranked element in a star network
• Secure computation from millionaire
• Theory of Cryptography
• A secure multi-party computation protocol for the sorting problem

Cites work

• scientific article; zbMATH DE number 1617945 (Why is no real title available?)
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 503243 (Why is no real title available?)
• scientific article; zbMATH DE number 1754645 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
• Communication Complexity
• Communication preserving protocols for secure function evaluation
• Covert two-party computation
• Efficient Correlated Action Selection
• Efficient Two-Party Secure Computation on Committed Inputs
• Foundations of Cryptography
• Privacy preserving data mining
• 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
• Strong Conditional Oblivious Transfer and Computing on Intervals
• Universally composable two-party and multi-party secure computation

Cited in

(8)

• A secure multi-party computation protocol for the sorting problem
• Topics in Cryptology – CT-RSA 2006
• Secure computation of the \(k^{\text{th}}\)-ranked element in a star network
• Secure computation from millionaire
• Theory of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Secure computation, I/O-efficient algorithms and distributed signatures
• Accelerating the secure distributed computation of the mean by a Chebyshev expansion

This page was built for publication: Secure computation of the median (and other elements of specified ranks)

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