Abstract
We study private computations in information-theoretical settings on networks that are not 2-connected. Non-2-connected networks are “non-private” in the sense that most functions cannot privately be computed on them. We relax the notion of privacy by introducing lossy private protocols, which generalize private protocols. We measure the information each player gains during the computation. Good protocols should minimize the amount of information they lose to the players. Throughout this work, privacy always means 1-privacy, i.e. players are not allowed to share their knowledge. Furthermore, the players are honest but curious, thus they never deviate from the given protocol.
By use of randomness by the protocol the communication strings a certain player can observe on a particular input determine a probability distribution. We define the loss of a protocol to a player as the logarithm of the number of different probability distributions the player can observe. For optimal protocols, this is justified by the following result: For a particular content of any player’s random tape, the distributions the player observes have pairwise fidelity zero. Thus the player can easily distinguish the distributions.
The simplest non-2-connected networks consists of two blocks that share one bridge node. We prove that on such networks, communication complexity and the loss of a private protocol are closely related: Up to constant factors, they are the same.
Then we study 1-phase protocols, an analogue of 1-round communication protocols. In such a protocol each bridge node may communicate with each block only once. We investigate in which order a bridge node should communicate with the blocks to minimize the loss of information. In particular, for symmetric functions it is optimal to sort the components by increasing size. Then we design a 1-phase protocol that for symmetric functions simultaneously minimizes the loss at all nodes where the minimum is taken over all 1-phase protocols.
Finally, we prove a phase hierarchy. For any k there is a function such that every (k–1)-phase protocol for this function has an information loss that is exponentially greater than that of the best k-phase protocol.
The full version of this work appeared as Rev.of Report 03-071, ECCC, 2003.
Chapter PDF
Similar content being viewed by others
References
Arpe, J., Jakoby, A., Liśkiewicz, M.: One-way communication complexity of symmetric boolean functions. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol. 2751, pp. 158–170. Springer, Heidelberg (2003)
Bar-Yehuda, R., Chor, B., Kushilevitz, E., Orlitsky, A.: Privacy, additional information, and communication. IEEE Transactions on Information Theory 39(6), 1930–1943 (1993)
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)
Berge, C.: Graphs. North-Holland, Amsterdam (1991)
Bläser, M., Jakoby, A., Liśkiewicz, M., Siebert, B.: Private computation — k-connected versus 1-connected networks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 194–209. Springer, Heidelberg (2002)
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)
Chor, B., Geréb-Graus, M., Kushilevitz, E.: Private computations over the integers. SIAM Journal on Computing 24(2), 376–386 (1995)
Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM Journal on Discrete Mathematics 4(1), 36–47 (1991)
Franklin, M., Yung, M.: Secure hypergraphs: Privacy from partial broadcast. In: Proc. of the 27th Ann. ACM Symp. on Theory of Computing (STOC), pp. 36–44. ACM Press, New York (1995)
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)
Kushilevitz, E., Ostrovsky, R., Rosén, A.: Characterizing linear size circuits in terms of privacy. Journal of Computer and System Sciences 58(1), 129–136 (1999)
Modiano, E.H., Ephremides, A.: Communication complexity of secure distributed computation in the presence of noise. IEEE Transactions on Information Theory 38(4), 1193–1202 (1992)
Modiano, E.H., Ephremides, A.: Communication protocols for secure distributed computation of binary functions. Information and Computation 158(2), 71–97 (2000)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, ch. 9. Cambridge University Press, Cambridge (2000)
Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM Journal on Computing 22(1), 211–219 (1993)
Orlitsky, A., El Gamal, A.: Communication with secrecy constraints. In: Proc. of the 16th Ann. ACM Symp. on Theory of Computing (STOC), pp. 217–224. ACM Press, New York (1984)
Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27(3,4), 379–423, 623–656 (1948)
Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner, Chichester (1987)
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 Press, Los Alamitos (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bläser, M., Jakoby, A., Liśkiewicz, M., Manthey, B. (2004). Privacy in Non-private Environments. In: Lee, P.J. (eds) Advances in Cryptology - ASIACRYPT 2004. ASIACRYPT 2004. Lecture Notes in Computer Science, vol 3329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30539-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30539-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23975-8
Online ISBN: 978-3-540-30539-2
eBook Packages: Springer Book Archive