Abstract
We initiate information theoretic investigation of the amount of leaked information in multi-party protocols. It is shown that mutual information is a satisfactory measure of the amount of the leaked information. For more than two parties, we apply multi-terminal information theory and give a formulation of the leaked information.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bar-Yehuda, R., Chor, B., Kushilevitz, E.: Privacy, additional information, and communication. Proceedings 5 Annual Structure in Complexity Theory Conference (1990) 55–65
Ben-or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. Proc. 20th ACM Annual Symposium on Theory of Computing (1988) 1–10
Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. Proc. 21st ACM Annual Symposium on Theory of Computing (1989) 62–72
Cover, T. M.: A proof of the data compression theorem of Slepian and Wolf for ergodic sources. IEEE Trans. Inform. Theory IT-21 (1975) 226–228
Gallager, R. G.: Information Theory and Reliable Communication. John Wiley & Sons, New York (1968).
Kushilevitz, E.: Privacy and communication complexity. SIAM Journal on Discrete Mathematics 5 (1992) 273–284 (preliminary version in Proc. 30th FOCS (1989) 416–421)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Satoh, T., Kurosawa, K., Tsujii, S. (1993). Privacy for multi-party protocols. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_67
Download citation
DOI: https://doi.org/10.1007/3-540-57220-1_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57220-6
Online ISBN: 978-3-540-47976-5
eBook Packages: Springer Book Archive