International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Towards Characterizing Securely Computable Two-Party Randomized Functions

Authors:
Deepesh Data
Manoj Prabhakaran
Download:
DOI: 10.1007/978-3-319-76578-5_23
Search ePrint
Search Google
Conference: PKC 2018
Abstract: A basic question of cryptographic complexity is to combinatorially characterize all randomized functions which have information-theoretic semi-honest secure 2-party computation protocols. The corresponding question for deterministic functions was answered almost three decades back, by Kushilevitz [Kus89]. In this work, we make progress towards understanding securely computable randomized functions. We bring tools developed in the study of completeness to bear on this problem. In particular, our characterizations are obtained by considering only symmetric functions with a combinatorial property called simplicity [MPR12].Our main result is a complete combinatorial characterization of randomized functions with ternary output kernels, that have information-theoretic semi-honest secure 2-party computation protocols. In particular, we show that there exist simple randomized functions with ternary output that do not have secure computation protocols. (For deterministic functions, the smallest output alphabet size of such a function is 5, due to an example given by Beaver [Bea89].)Also, we give a complete combinatorial characterization of randomized functions that have 2-round information-theoretic semi-honest secure 2-party computation protocols.We also give a counter-example to a natural conjecture for the full characterization, namely, that all securely computable simple functions have secure protocols with a unique transcript for each output value. This conjecture is in fact true for deterministic functions, and – as our results above show – for ternary functions and for functions with 2-round secure protocols.
BibTeX
@inproceedings{pkc-2018-28882,
  title={Towards Characterizing Securely Computable Two-Party Randomized Functions},
  booktitle={Public-Key Cryptography – PKC 2018},
  series={Public-Key Cryptography – PKC 2018},
  publisher={Springer},
  volume={10769},
  pages={675-697},
  doi={10.1007/978-3-319-76578-5_23},
  author={Deepesh Data and Manoj Prabhakaran},
  year=2018
}