Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient Multiparty Protocols Using Circuit Randomization
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
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
LEGO for Two-Party Secure Computation
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Asynchronous Multiparty Computation: Theory and Implementation
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
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
Improved primitives for secure multiparty integer computation
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Semi-homomorphic encryption and multiparty computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Two-output secure computation with malicious adversaries
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Faster secure two-party computation using garbled circuits
SEC'11 Proceedings of the 20th USENIX conference on Security
The IPS compiler: optimizations, variants and concrete efficiency
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Automatically optimizing secure computation
Proceedings of the 18th ACM conference on Computer and communications security
Secure computation with fixed-point numbers
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
TCC'06 Proceedings of the Third conference on Theory of Cryptography
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Billion-gate secure computation with malicious adversaries
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Efficient lookup-table protocol in secure multiparty computation
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Canon-MPC, a system for casual non-interactive secure multi-party computation using native client
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
| Hi-index | 0.00 |
We present a runtime environment for executing secure programs via a multi-party computation protocol in the preprocessing model. The runtime environment is general and allows arbitrary reactive computations to be performed. A particularly novel aspect is that it automatically determines the minimum number of rounds needed for a computation, given a specific instruction sequence, and it then uses this to minimize the overall cost of the computation. Various experiments are reported on, on various non-trivial functionalities. We show how, by utilizing the ability of modern processors to execute multiple threads at a time, one can obtain various tradeoffs between latency and throughput