Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
In secure multi-party computation, a reactive functionality is one which maintains persistent state, takes inputs, and gives outputs over many rounds of interaction with its parties. Reactive functionalities are fundamental and model many interesting and natural cryptographic tasks; yet their security properties are not nearly as well-understood as in the non-reactive case (known as secure function evaluation).
We present new combinatorial characterizations for 2-party reactive functionalities, which we model as finite automata. We characterize the functionalities that have passive-secure protocols, and those which are complete with respect to passive adversaries. Both characterizations are in the information-theoretic setting.
- 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)Google Scholar
- 2.Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Naor, M. (ed.) FOCS, pp. 136–145. IEEE Computer Society Press (2001); Revised version (2005) on Cryptology ePrint Archive, http://eprint.iacr.org/2000/067
- 5.Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218–229. ACM (1987)Google Scholar
- 6.Kilian, J.: A general completeness theorem for two-party games. In: STOC, pp. 553–560. ACM (1991)Google Scholar
- 7.Kilian, J.: More general completeness theorems for secure two-party computation. In: STOC, pp. 316–324. ACM (2000)Google Scholar
- 12.Kushilevitz, E.: Privacy and communication complexity. In: FOCS, pp. 416–421. IEEE (1989)Google Scholar
- 16.Rosulek, M.: Universal Composability from Essentially Any Trusted Setup. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 406–423. Springer, Heidelberg (2012)Google Scholar
- 17.Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160–164. IEEE (1982)Google Scholar