STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
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
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A zero-one law for Boolean privacy
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A general completeness theorem for two party games
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A zero-one law for Boolean privacy
SIAM Journal on Discrete Mathematics
Privacy and communication complexity
SIAM Journal on Discrete Mathematics
More general completeness theorems for secure two-party computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Reducibility and Completeness in Private Computations
SIAM Journal on Computing
Composition and integrity preservation of secure reactive systems
Proceedings of the 7th ACM conference on Computer and communications security
On privacy and partition arguments
Information and Computation
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The All-or-Nothing Nature of Two-Party Secure Computation
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Commitments
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
General Composition and Universal Composability in Secure Multi-Party Computation
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
New notions of security: achieving universal composability without trusted setup
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Universally Composable Protocols with Relaxed Set-Up Assumptions
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Concurrent general composition of secure protocols in the timing model
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
New notions of security
Concurrent Non-Malleable Zero Knowledge
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Privacy and communication complexity
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Reducibility and completeness in multi-party private computations
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Universally composable security with global setup
TCC'07 Proceedings of the 4th conference on Theory of cryptography
OT-combiners via secure computation
TCC'08 Proceedings of the 5th conference on Theory of cryptography
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
A zero-one law for cryptographic complexity with respect to computational UC security
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Exploring the limits of common coins using frontier analysis of protocols
TCC'11 Proceedings of the 8th conference on Theory of cryptography
On the necessary and sufficient assumptions for UC computation
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
The limits of common coins: further results
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
On the centrality of off-line e-cash to concrete partial information games
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Characterizing the cryptographic properties of reactive 2-party functionalities
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Feasibility and completeness of cryptographic tasks in the quantum world
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
We develop new tools to study the relative complexities of secure multi-party computation tasks in the Universal Composition framework. When one task can be securely realized using another task as a black-box, we interpret this as a qualitative, complexity-theoretic reduction between the two tasks. Virtually all previous characterizations of MPC functionalities, in the UC model or otherwise, focus exclusively on secure function evaluation. In comparison, the tools we develop do not rely on any special internal structure of the functionality, thus applying to functionalities with arbitrary behavior. Our tools additionally apply uniformly to both the PPT and unbounded computation models.Our first main tool is an exact characterization of realizability in the UC framework with respect to a large class of communication channel functionalities. Using this characterization, we can rederive all previously-known impossibility results as immediate and simple corollaries. We also complete the combinatorial characterization of 2-party secure function evaluation initiated by [12] and partially extend the combinatorial conditions to the multi-party setting. Our second main tool allows us to translate complexity separations in simpler MPC settings (such as the honest-but-curious corruption model) to the standard (malicious) setting. Using this tool, we demonstrate the existence of functionalities which are neither realizable nor complete, in the unbounded computation model.