Abstract
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by private protocols even if the underlying network is 1-connected but not 2-connected. Then we give a complete characterisation of non-degenerate functions that can be computed on non-2-connected networks.
Furthermore, a general technique for simulating private protocols on arbitrary networks will be presented. Using this technique every private protocol can be simulated on arbitrary k-connected networks using only a small number of additional random bits.
Finally, we give matching lower and upper bounds for the number of random bits needed to compute the parity function on k-connected networks.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
On leave from Instytut Informatyki, Uniwersytet Wrocławski, Poland.
Supported by DFG research grant Re 672/3.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
N. Alon, J. H. Spencer, and P. Erdös. The Probabilistic Method. John Wiley and Sons, 1992.
J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proc. 8th Ann. Symp. on Principles of Distributed Comput. (PODC), pages 201–209. ACM, 1989.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proc. 20th Ann. Symp. on Theory of Comput. (STOC), pages 1–10. ACM, 1988.
C. Blundo, A. de Santis, G. Persiano, and U. Vaccaro. Randomness complexity of private computation. Comput. Complexity, 8(2):145–168, 1999.
R. Canetti and R. Ostrovsky. Secure computation with honest-looking parties: What if nobody is truly honest? In Proc. 31st Ann. Symp. on Theory of Comput. (STOC), pages 255–264. ACM, 1999.
D. Chaum, C. Crépeau, and I. Damgøard. Multiparty unconditionally secure protocols. In Proc. 20th Ann. Symp. on Theory of Comput. (STOC), pages 11–19. ACM, 1988.
B. Chor, M. Geréb-Graus, and E. Kushilevitz. On the structure of the privacy hierarchy. J. Cryptology, 7(1):53–60, 1994.
B. Chor, M. Geréb-Graus, and E. Kushilevitz. Private computations over the integers. SIAM J. Comput., 24(2):376–386, 1995.
B. Chor and E. Kushilevitz. A zero-one law for boolean privacy. SIAM J. Discrete Math., 4(1):36–47, 1991.
B. Chor and E. Kushilevitz. A communication-privacy tradeoff for modular addition. Inform. Process. Lett., 45(4):205–210, 1993.
Y. Egawa, R. Glas, and S. C. Locke. Cycles and paths through specified vertices in k-connected graphs. J. Combin. Theory Ser. B, 52:20–29, 1991.
M. Franklin and R. N. Wright. Secure communication in minimal connectivity models. J. Cryptology, 13(1):9–30, 2000.
M. Franklin and M. Yung. Secure hypergraphs: Privacy from partial broadcast. In Proc. 27th Ann. Symp. on Theory of Comput. (STOC), pages 36–44. ACM, 1995.
A. Gál and A. Rosén. A theorem on sensitivity and applications in private computation. In Proc. 31st Ann. Symp. on Theory of Comput. (STOC), pages 348–357. ACM, 1999.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th Ann. Symp. on Theory of Comput. (STOC), pages 218–229. ACM, 1987.
E. Kushilevitz. Privacy and communication complexity. SIAM J. Discrete Math., 5(2):273–284, 1992.
E. Kushilevitz and Y. Mansour. Randomness in private computations. SIAM J. Discrete Math., 10(4):647–661, 1997.
E. Kushilevitz, R. Ostrovsky, and A. Rosén. Characterizing linear size circuits in terms of privacy. J. Comput. System Sci., 58(1):129–136, 1999.
E. Kushilevitz and A. Rosén. A randomness-rounds tradeoff in private computation. SIAM J. Discrete Math., 11(1):61–80, 1998.
I. Wegener. The Complexity of Boolean Functions. Wiley-Teubner, 1987.
A. C.-C. Yao. Protocols for secure computations. In Proc. 23rd Ann. Symp. on Foundations of Comput. Sci. (FOCS), pages 160–164. IEEE, 1982.
A. C.-C. Yao. How to generate and exchange secrets. In Proc. 27th Ann. Symp. on Foundations of Comput. Sci. (FOCS), pages 162–167. IEEE, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bläser, M., Jakoby, A., Liśkiewicz, M., Siebert, B. (2002). Private Computation — k-Connected versus 1-Connected Networks. In: Yung, M. (eds) Advances in Cryptology — CRYPTO 2002. CRYPTO 2002. Lecture Notes in Computer Science, vol 2442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45708-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-45708-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44050-5
Online ISBN: 978-3-540-45708-4
eBook Packages: Springer Book Archive