Paper 2020/1428
On Statistical Security in Two-Party Computation
Dakshita Khurana and Muhammad Haris Mughees
Abstract
There has been a large body of work characterizing the round complexity of general-purpose maliciously secure two-party computation (2PC) against probabilistic polynomial time adversaries. This is particularly true for zero-knowledge, which is a special case of 2PC. In fact, in the special case of zero knowledge, optimal protocols with unconditional security against one of the two players have also been meticulously studied and constructed.
On the other hand, general-purpose maliciously secure 2PC with statistical or unconditional security against one of the two participants has remained largely unexplored so far. In this work, we initiate the study of such protocols, which we refer to as 2PC with one-sided statistical security. We settle the round complexity of 2PC with one-sided statistical security with respect to black-box simulation by obtaining the following tight results: In a setting where only one party obtains an output, we design 2PC in
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in TCC 2020
- Keywords
- Statistical securityTwo-party computation
- Contact author(s)
-
dakshita @ illinois edu
mughees2 @ illinois edu - History
- 2020-11-15: received
- Short URL
- https://ia.cr/2020/1428
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1428, author = {Dakshita Khurana and Muhammad Haris Mughees}, title = {On Statistical Security in Two-Party Computation}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/1428}, year = {2020}, url = {https://eprint.iacr.org/2020/1428} }