STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Precomputing Oblivious Transfer
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Analyzing Market-Based Resource Allocation Strategies for the Computational Grid
International Journal of High Performance Computing Applications
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Evolutionary Market Agents for Resource Allocation in Decentralised Systems
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
Sharemind: A Framework for Fast Privacy-Preserving Computations
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Market-based grid resource allocation using a stable continuous double auction
GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
Asynchronous Multiparty Computation: Theory and Implementation
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Secure Multiparty Computation Goes Live
Financial Cryptography and Data Security
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Secure Two-Party Computation Is Practical
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
Efficient implementation of the orlandi protocol
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
SEPIA: privacy-preserving aggregation of multi-domain network events and statistics
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Faster secure two-party computation using garbled circuits
SEC'11 Proceedings of the 20th USENIX conference on Security
A practical implementation of secure auctions based on multiparty integer computation
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Object replication strategies in content distribution networks
Computer Communications
On the security of the "Free-XOR" technique
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Salus: a system for server-aided secure function evaluation
Proceedings of the 2012 ACM conference on Computer and communications security
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Fair exchange of short signatures without trusted third party
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
More efficient oblivious transfer and extensions for faster secure computation
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
An architecture for practical actively secure MPC with dishonest majority
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Hi-index | 0.00 |
Protocols for generic secure multi-party computation (MPC) generally come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit over a large field. Either type of protocol can be used for any function, but the choice of which protocol to use can have a significant impact on efficiency. The magnitude of the effect, however, has never been quantified. With this in mind, we implement the MPC protocol of Goldreich, Micali, and Wigderson [13], which uses a boolean representation and is secure against a semi-honest adversary corrupting any number of parties. We then consider applications of secure MPC in on-line marketplaces, where customers select resources advertised by providers and it is desired to ensure privacy to the extent possible. Problems here are more naturally formulated in terms of boolean circuits, and we study the performance of our MPC implementation relative to existing ones that use an arithmetic-circuit representation. Our protocol easily handles tens of customers/providers and thousands of resources, and outperforms existing implementations including FairplayMP [3], VIFF [11], and SEPIA [7].