Cited By
View all- Maji HWang M(2021)Computational Hardness of Optimal Fair Computation: Beyond MinicryptAdvances in Cryptology – CRYPTO 202110.1007/978-3-030-84245-1_2(33-63)Online publication date: 16-Aug-2021
On the Structure of Unconditional UC Hybrid Protocols
Pages 98 - 126
Abstract
We study the problem of secure two-party computation in the presence of a trusted setup. If there is an unconditionally UC-secure protocol for f that makes use of calls to an ideal g, then we say that freduces tog (and write ). Some g are complete in the sense that all functions reduce to g. However, almost nothing is known about the power of an incomplete g in this setting. We shed light on this gap by showing a characterization of for incomplete g.
Very roughly speaking, we show that f reduces to g if and only if it does so by the simplest possible protocol: one that makes a single call to ideal g and uses no further communication. Furthermore, such simple protocols can be characterized by a natural combinatorial condition on f and g.
Looking more closely, our characterization applies only to a very wide class of f, and only for protocols that are deterministic or logarithmic-round. However, we give concrete examples showing that both of these limitations are inherent to the characterization itself. Functions not covered by our characterization exhibit qualitatively different properties. Likewise, randomized, superlogarithmic-round protocols are qualitatively more powerful than deterministic or logarithmic-round ones.
References
[1]
Beaver, D.: Perfect privacy for two-party protocols. In: Feigenbaum, J., Merritt, M. (eds.) Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, vol. 2, pp. 65–77. American Mathematical Society (1989)
[2]
Beimel A and Malkin T Naor M A quantitative approach to reductions in secure computation Theory of Cryptography 2004 Heidelberg Springer 238-257
[3]
Bellare M and Rogaway P Vaudenay S The security of triple encryption and a framework for code-based game-playing proofs Advances in Cryptology - EUROCRYPT 2006 2006 Heidelberg Springer 409-426
[4]
Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136–145. IEEE Computer Society Press, October 2001
[5]
Dodis Y and Micali S Stern J Lower bounds for oblivious transfer reductions Advances in Cryptology — EUROCRYPT ’99 1999 Heidelberg Springer 42-55
[6]
Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 413–422. ACM Press, May 2008
[7]
Ishai Y, Prabhakaran M, and Sahai A Wagner D Founding cryptography on oblivious transfer – efficiently Advances in Cryptology – CRYPTO 2008 2008 Heidelberg Springer 572-591
[8]
Kilian, J.: Founding cryptography on oblivious transfer. In: 20th ACM STOC, pp. 20–31. ACM Press, May 1988
[9]
Kilian, J.: Uses of randomness in algorithms and protocols. Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1989)
[10]
Kilian, J.: A general completeness theorem for two-party games. In: 23rd ACM STOC, pp. 553–560. ACM Press, May 1991
[11]
Kilian, J.: More general completeness theorems for secure two-party computation. In: 32nd ACM STOC, pp. 316–324. ACM Press, May 2000
[12]
Kraschewski D, Maji HK, Prabhakaran M, and Sahai A Nguyen PQ and Oswald E A full characterization of completeness for two-party randomized function evaluation Advances in Cryptology – EUROCRYPT 2014 2014 Heidelberg Springer 659-676
[13]
Kraschewski D and Müller-Quade J Ishai Y Completeness theorems with constructive proofs for finite deterministic 2-party functions Theory of Cryptography 2011 Heidelberg Springer 364-381
[14]
Kushilevitz, E.: Privacy and communication complexity. In: 30th FOCS, pp. 416–421. IEEE Computer Society Press, October/November 1989
[15]
Lindell Y and Rabin T Kalai Y and Reyzin L Secure two-party computation with fairness - a necessary design principle Theory of Cryptography 2017 Cham Springer 565-580
[16]
Maji HK, Ouppaphan P, Prabhakaran M, and Rosulek M Ishai Y Exploring the limits of common coins using frontier analysis of protocols Theory of Cryptography 2011 Heidelberg Springer 486-503
[17]
Maji HK, Prabhakaran M, and Rosulek M Reingold O Complexity of multi-party computation problems: the case of 2-party symmetric secure function evaluation Theory of Cryptography 2009 Heidelberg Springer 256-273
[18]
Maji, H.K., Prabhakaran, M., Rosulek, M.: Cryptographic complexity classes and computational intractability assumptions. In: Yao, A.C.-C. (ed.) ICS 2010, pp. 266–289. Tsinghua University Press, Beijing (2010)
[19]
Maji HK, Prabhakaran M, and Rosulek M Rabin T A zero-one law for cryptographic complexity with respect to computational UC security Advances in Cryptology – CRYPTO 2010 2010 Heidelberg Springer 595-612
[20]
Maji HK, Prabhakaran M, and Rosulek M Galbraith S and Nandi M A unified characterization of completeness and triviality for secure function evaluation Progress in Cryptology - INDOCRYPT 2012 2012 Heidelberg Springer 40-59
[21]
Prabhakaran M and Rosulek M Wagner D Cryptographic complexity of multi-party computation problems: classifications and separations Advances in Cryptology – CRYPTO 2008 2008 Heidelberg Springer 262-279
Index Terms
- On the Structure of Unconditional UC Hybrid Protocols
Index terms have been assigned to the content through auto-classification.
Recommendations
zkSNARKs in the ROM with Unconditional UC-Security
Theory of CryptographyAbstractThe universal composability (UC) framework is a “gold standard” for security in cryptography. UC-secure protocols achieve strong security guarantees against powerful adaptive adversaries, and retain these guarantees when used as part of larger ...
An efficient fair UC-secure protocol for two-party computation
With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy-preserving applications. Secure multi-party computation SMPC gives a general solution to these applications and has become a hot topic. ...
Comments
Information & Contributors
Information
Published In
Nov 2018
715 pages
© International Association for Cryptologic Research 2018.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 11 November 2018
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025
Other Metrics
Citations
Cited By
View all- Maji HWang M(2021)Computational Hardness of Optimal Fair Computation: Beyond MinicryptAdvances in Cryptology – CRYPTO 202110.1007/978-3-030-84245-1_2(33-63)Online publication date: 16-Aug-2021