Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
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
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Founding Cryptography on Oblivious Transfer --- Efficiently
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
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
Efficient two party and multi party computation against covert adversaries
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
SCiFI - A System for Secure Face Identification
SP '10 Proceedings of the 2010 IEEE Symposium on Security and Privacy
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
Secure two-party computation via cut-and-choose oblivious transfer
TCC'11 Proceedings of the 8th conference on Theory of cryptography
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
VMCrypt: modular software architecture for scalable secure computation
Proceedings of the 18th ACM conference on Computer and communications security
Privacy-Preserving graph algorithms in the semi-honest model
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
A new combinational logic minimization technique with applications to cryptology
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Efficiency tradeoffs for malicious two-party computation
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
On the security of the "Free-XOR" technique
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Foundations of garbled circuits
Proceedings of the 2012 ACM conference on Computer and communications security
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
Faster secure two-party computation with less memory
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Fast two-party secure computation with minimal assumptions
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
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
Privacy-preserving matrix factorization
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Specifying sharemind's arithmetic black box
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
Domain-polymorphic language for privacy-preserving applications
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
Lessons learned with PCF: scaling secure computation
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
GPU and CPU parallelization of honest-but-curious secure two-party computation
Proceedings of the 29th Annual Computer Security Applications Conference
Fast and maliciously secure two-party computation using the GPU
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Secure outsourced garbled circuit evaluation for mobile devices
SEC'13 Proceedings of the 22nd USENIX conference on Security
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 |
The goal of this paper is to assess the feasibility of two-party secure computation in the presence of a malicious adversary. Prior work has shown the feasibility of billion-gate circuits in the semi-honest model, but only the 35k-gate AES circuit in the malicious model, in part because security in the malicious model is much harder to achieve. We show that by incorporating the best known techniques and parallelizing almost all steps of the resulting protocol, evaluating billion-gate circuits is feasible in the malicious model. Our results are in the standard model (i.e., no common reference strings or PKIs) and, in contrast to prior work, we do not use the random oracle model which has well-established theoretical shortcomings.