The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficiently computing static single assignment form and the control dependence graph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about knowledge: a survey
Handbook of logic in artificial intelligence and logic programming (Vol. 4)
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Communications of the ACM
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Secure and private sequence comparisons
Proceedings of the 2003 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
Fostering the Uptake of Secure Multiparty Computation in E-Commerce
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Towards Practical Privacy for Genomic Computation
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
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
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
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications 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
Forecasting Run-Times of Secure Two-Party Computation
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Practical private set intersection protocols with linear complexity
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Expression rewriting for optimizing secure computation
Proceedings of the third ACM conference on Data and application security and privacy
Knowledge inference for optimizing secure multi-party computation
Proceedings of the Eighth ACM SIGPLAN workshop on Programming languages and analysis for security
An information-flow type-system for mixed protocol secure computation
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.00 |
Secure computation has high computational resource requirements during run-time. Secure computation optimization can lower these requirements, but has high computational resource requirements during compile-time. This prevents automatic optimization of most larger secure computations. In this paper we present an efficient optimization algorithm that does no longer require the use of a theorem prover. For a secure computation with m statements of which n are branching statements we lower the complexity from O(2^(2^n) m) to O(m^5 2^n). Using an implementation of our algorithm we can extend automatic optimization to further examples such as the AES key schedule.