@inproceedings{6284224,
 abstract = {Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the multiple unicast capacity region for this problem has been exactly characterized for a number of special cases; namely the 2-user, 3-user, symmetric K-user, and one-sidedly fair K-user [1], [2]. In this paper, we show that for all the cases where such characterizations exist, we can also optimally characterize the “secure” communication rates, where the message that Alice transmits to each user is information theoretically secure from the other users, even if these collude. We show that a simple, two-phase strategy, where appropriate amounts of secret keys are first generated and then consumed, matches a new outer bound we derive.},
 author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},
 booktitle = {Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on},
 doi = {10.1109/ISIT.2012.6284224},
 file = {:papers:bc_private_msg.pdf},
 issn = {2157-8095},
 month = {July},
 pages = {428-432},
 tags = {conf,WiNetSec,IT},
 title = {Broadcasting private messages securely},
 type = {4},
 year = {2012}
}

{"_id":"xSZHpaQv6HsnfkQCT","bibbaseid":"czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012","author_short":["Czap, L.","Prabhakaran, V.","Diggavi, S.","Fragouli, C."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the multiple unicast capacity region for this problem has been exactly characterized for a number of special cases; namely the 2-user, 3-user, symmetric K-user, and one-sidedly fair K-user [1], [2]. In this paper, we show that for all the cases where such characterizations exist, we can also optimally characterize the “secure” communication rates, where the message that Alice transmits to each user is information theoretically secure from the other users, even if these collude. We show that a simple, two-phase strategy, where appropriate amounts of secret keys are first generated and then consumed, matches a new outer bound we derive.","author":[{"propositions":[],"lastnames":["Czap"],"firstnames":["L."],"suffixes":[]},{"propositions":[],"lastnames":["Prabhakaran"],"firstnames":["V.M."],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["S."],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]}],"booktitle":"Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on","doi":"10.1109/ISIT.2012.6284224","file":":papers:bc_private_msg.pdf","issn":"2157-8095","month":"July","pages":"428-432","tags":"conf,WiNetSec,IT","title":"Broadcasting private messages securely","year":"2012","bibtex":"@inproceedings{6284224,\n abstract = {Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the multiple unicast capacity region for this problem has been exactly characterized for a number of special cases; namely the 2-user, 3-user, symmetric K-user, and one-sidedly fair K-user [1], [2]. In this paper, we show that for all the cases where such characterizations exist, we can also optimally characterize the “secure” communication rates, where the message that Alice transmits to each user is information theoretically secure from the other users, even if these collude. We show that a simple, two-phase strategy, where appropriate amounts of secret keys are first generated and then consumed, matches a new outer bound we derive.},\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\n booktitle = {Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on},\n doi = {10.1109/ISIT.2012.6284224},\n file = {:papers:bc_private_msg.pdf},\n issn = {2157-8095},\n month = {July},\n pages = {428-432},\n tags = {conf,WiNetSec,IT},\n title = {Broadcasting private messages securely},\n type = {4},\n year = {2012}\n}\n\n","author_short":["Czap, L.","Prabhakaran, V.","Diggavi, S.","Fragouli, C."],"key":"6284224","id":"6284224","bibbaseid":"czap-prabhakaran-diggavi-fragouli-broadcastingprivatemessagessecurely-2012","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib","dataSources":["ZyBHKCcCyS7Qk9n3w","hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"],"keywords":[],"search_terms":["broadcasting","private","messages","securely","czap","prabhakaran","diggavi","fragouli"],"title":"Broadcasting private messages securely","year":2012}