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

DOI10.1007/S00145-010-9059-9zbMATH Open1195.94047OpenAlexW2119506752MaRDI QIDQ5962224FDOQ5962224

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

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

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)

Cites Work

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

Cited In (4)

• Theory of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• A secure multi-party computation protocol for the sorting problem
• Topics in Cryptology – CT-RSA 2006

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)