caa a22 4500 475827031 CHVBK 20180406123831.0 cr unu---uuuuu 170329e20000101xx s 000 0 eng 10.1007/s001459910002 doi (NATIONALLICENCE)springer-10.1007/s001459910002 Secure Communication in Minimal Connectivity Models [Elektronische Daten] [Matthew Franklin, Rebecca N. Wright] Abstract. : Problems of secure communication and computation have been studied extensively in network models. In this work we ask what is possible in the information-theoretic setting when the adversary is very strong (Byzantine) and the network connectivity is very low (minimum needed for crash-tolerance). We concentrate on a new model called 's'smulticast lines,'' and show a sizable gap between the connectivity required for perfect security and for almost perfect security. Our results also have implications to the commonly studied simple channel model and to general secure multiparty computation. International Association for Cryptologic Research, 2000 Key words. Network security, Privacy, Reliability, Multicast, Secure multiparty computation nationallicence Franklin Matthew Xerox PARC, 3333 Coyote Hill Road, CA 94304, Palo Alto, U.S.A. aut Wright Rebecca N. AT&T Labs Research, 180 Park Avenue, Florham Park, NJ 07932, U.S.A. aut Journal of Cryptology Springer New York 13/1(2000-01-01), 9-30 0933-2790 13:1<9 2000 13 145 https://doi.org/10.1007/s001459910002 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s001459910002 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Franklin Matthew Xerox PARC, 3333 Coyote Hill Road, CA 94304, Palo Alto, U.S.A aut NATIONALLICENCE 700 1- Wright Rebecca N. AT&T Labs Research, 180 Park Avenue, Florham Park, NJ 07932, U.S.A aut NATIONALLICENCE 773 0- Journal of Cryptology Springer New York 13/1(2000-01-01), 9-30 0933-2790 13:1<9 2000 13 145 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer