STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Algorithmic number theory
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Efficient private bidding and auctions with an oblivious third party
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Java Language Specification, Second Edition: The Java Series
Java Language Specification, Second Edition: The Java Series
Introduction to Algorithms
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Mix and Match: Secure Function Evaluation via Ciphertexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Verifiable Secret Shuffle of Homomorphic Encryptions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Secure and private sequence comparisons
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Privacy preserving electronic surveillance
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Private collaborative forecasting and benchmarking
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Building a privacy-preserving benchmarking enterprise system
Enterprise Information Systems - Challenges and Solutions in Enterprise Computing - 11th International IEEE EDOC Conference (EDOC 2007)
On the practical importance of communication complexity for secure multi-party computation protocols
Proceedings of the 2009 ACM symposium on Applied Computing
A Privacy-Preserving Platform for User-Centric Quantitative Benchmarking
TrustBus '09 Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business
Encryption-enforced access control for an RFID discovery service
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
| Hi-index | 0.01 |
Collaborative Benchmarking is an important issue for modern enterprises, but the business performance quantities used as input are often highly confidential. Secure Multi-Party Computation can offer protocols that can compute benchmarks without leaking the input variables. Benchmarking is a process of comparing to the “best”, so often it is necessary to only include the k-best enterprises for computing a benchmark to not distort the result with some outlying performances. We present a protocol that can be used as a filter, before running any collaborative benchmarking protocol that restricts the participants to the k best values. Our protocol doesn't use the general circuit construction technique for SMC aiming to optimize performance. As building blocks we present the fastest implementation of Yao's millionaires' protocol and a protocol that achieves a fair shuffle in O(log n) rounds.