Secure Computation of the k th -Ranked Element
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Privacy Preserving Data MiningJournal of Cryptology, 2002
- Selective private function evaluation with applications to private statisticsPublished by Association for Computing Machinery (ACM) ,2001
- Communication preserving protocols for secure function evaluationPublished by Association for Computing Machinery (ACM) ,2001
- Secure Multiparty Computation of ApproximationsLecture Notes in Computer Science, 2001
- A Cost-Effective Pay-Per-Multiplication Comparison Method for MillionairesLecture Notes in Computer Science, 2001
- Universally composable security: a new paradigm for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Communication complexity of secure computation (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- The round complexity of secure protocolsPublished by Association for Computing Machinery (ACM) ,1990
- Finding the median distributivelyJournal of Computer and System Sciences, 1982