STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Communication complexity of secure computation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Correlated pseudorandomness and the complexity of private computations
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communications of the ACM
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer with Adaptive Queries
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Committed Oblivious Transfer and Private Multi-Party Computation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract)
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
A Framework for Efficient and Composable Oblivious Transfer
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Founding Cryptography on Oblivious Transfer --- Efficiently
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
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
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Journal of Cryptology
Secure two-party computation via cut-and-choose oblivious transfer
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Black-Box Constructions of Protocols for Secure Computation
SIAM Journal on Computing
From passive to covert security at low cost
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Scalable secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Practical attack on 8 rounds of the lightweight block cipher KLEIN
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Billion-gate secure computation with malicious adversaries
Security'12 Proceedings of the 21st USENIX conference on Security symposium
An architecture for practical actively secure MPC with dishonest majority
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Hi-index | 0.01 |
In recent work, Ishai, Prabhakaran and Sahai (CRYPTO 2008) presented a new compiler (hereafter the IPS compiler) for constructing protocols that are secure in the presence of malicious adversaries without an honest majority, from protocols that are only secure in the presence of semi-honest adversaries. The IPS compiler has many important properties: it provides a radically different way of obtaining security in the presence of malicious adversaries with no honest majority, it is black-box in the underlying semi-honest protocol, and it has excellent asymptotic efficiency. In this paper, we study the IPS compiler from a number of different angles. We present an efficiency improvement of the "watchlist setup phase" of the compiler that also facilitates a simpler and tighter analysis of the cheating probability. In addition, we present a conceptually simpler variant that uses protocols that are secure in the presence of covert adversaries as its basic building block. This variant can be used to achieve more efficient asymptotic security, as we show regarding black-box constructions of malicious oblivious transfer from semi-honest oblivious transfer. Finally, we analyze the IPS compiler from a concrete efficiency perspective and demonstrate that in some cases it can be competitive with the best efficient protocols currently known.