Abstract
A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to deduce from his own input and the function value. In [1] Bar-Yehuda, Chor, Kushilevitz, and Orlitsky give a complete characterisation of two-argument functions which can be computed privately (in the information-theoretical sense) in the Honest-But-Curious model and study protocols for “non-private” functions revealing as little information about the inputs as possible. The authors define a measure which determines for any function f the additional information ε(f) required for computing f and claim that f is privately-computable if and only if ε(f) = 0. In our paper we show that the characterisation is false: we give a privately-computable function f with ε(f) ≠ 0 and another function g with ε(g) = 0 that is not privately-computable. Moreover, we show some rather unexpected and strange properties of the measure for additional information given by Bar-Yehuda et al. and we introduce an alternative measure. We show that for this new measure the minimal leakage of information of randomized and deterministic protocols are equal. Finally, we present some general relations between the information gain of an optimal protocol and the communication complexity of a function.
Supported by DFG research grant RE 672/5-1.
Chapter PDF
Similar content being viewed by others
References
Bar-Yehuda, R., Chor, B., Kushilevitz, E., Orlitsky, A.: Privacy, additional information, and communication. IEEE Transactions on Information Theory 39(6), 1930–1943 (1993); An early version of this paper appear in Proc. of 5th IEEE Structure in Complexity Theory, pp. 55–65 (1990)
Beaver, D.: Perfect Privacy for Two Party Protocols. Technical Report TR-11-89, Harvard University (1989)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. of the 20th Ann. ACM Symp. on Theory of Computing (STOC), pp. 1–10. ACM Press, New York (1988)
Bläser, M., Jakoby, A., Liśkiewicz, M., Manthey, B.: Privacy in Non-Private Environments. In: Proceedings of the 10th Annual International Cryptology Conference on the Theory and Application of Cryptology and Information Security (Asiacrypt), pp. 137–151 (2004)
Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: Proc. of the 20th Ann. ACM Symp. on Theory of Computing (STOC), pp. 11–19. ACM Press, New York (1988)
Kushilevitz, E.: Privacy and communication complexity. SIAM Journal on Discrete Mathematics 5(2), 273–284 (1992)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
Yao, A.C.-C.: Protocols for secure computations. In: Proc. of the 23rd Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 160–164. IEEE Computer Society, Los Alamitos (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakoby, A., Liśkiewicz, M. (2005). Revealing Additional Information in Two-Party Computations. In: Roy, B. (eds) Advances in Cryptology - ASIACRYPT 2005. ASIACRYPT 2005. Lecture Notes in Computer Science, vol 3788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11593447_7
Download citation
DOI: https://doi.org/10.1007/11593447_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30684-9
Online ISBN: 978-3-540-32267-2
eBook Packages: Computer ScienceComputer Science (R0)