Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
A domain-specific programming language for secure multiparty computation
Proceedings of the 2007 workshop on Programming languages and analysis for security
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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
On the practical importance of communication complexity for secure multi-party computation protocols
Proceedings of the 2009 ACM symposium on Applied Computing
A Proof of Security of Yao’s Protocol for Two-Party Computation
Journal of Cryptology
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
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
A certifying compiler for zero-knowledge proofs of knowledge based on Σ-protocols
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
ZKPDL: a language-based system for efficient zero-knowledge proofs and electronic cash
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
Automatically optimizing secure computation
Proceedings of the 18th ACM conference on Computer and communications security
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
COMPSAC '11 Proceedings of the 2011 IEEE 35th Annual Computer Software and Applications Conference
Towards Privacy-Preserving XML Transformation
ICWS '11 Proceedings of the 2011 IEEE International Conference on Web Services
Forecasting Run-Times of Secure Two-Party Computation
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Demo: secure computation in JavaScript
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
Efficient secure computation optimization
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
PCF: a portable circuit format for scalable two-party secure computation
SEC'13 Proceedings of the 22nd USENIX conference on Security
Hi-index | 0.00 |
In theory secure computation offers a solution for privacy in many collaborative applications. However, in practice poor efficiency of the protocols prevents their use. Hand-crafted protocols are more efficient than those implemented in compilers, but they require significantly more development effort in programming and verification. Recently, Kerschbaum introduced an automatic compiler optimization technique for secure computations that can make compilers as efficient as hand-crafted protocols. This optimization relies on the structure of the secure computation program. The programmer has to implement the program in such a way, such that the optimization can yield the optimal performance. In this paper we present an algorithm that rewrites the program -- most notably its expressions -- optimizing their efficiency in secure computation protocols. We give a heuristic for whole-program optimization and show the resulting performance gains using examples from the literature.