@inproceedings{6570819,
 abstract = {Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure capacity region of the private messages under the requirement that Bob and Calvin do not learn each other's message. In this paper, we assume that Bob (or Calvin) may provide dishonest feedback; or even control the input message distributions, as is commonly assumed in cryptography literature. We characterize the capacity region in the case of dishonest adversaries, as well as an achievable region for the case when the adversary has complete control on the distribution of the messages. We also design polynomial time protocols for both cases, that rely on the use of coding techniques to mix and secure the private messages. As a side result, we define an extended notion of semantic security for this problem and using a similar approach to [2], we show the equivalence of different security notions.},
 author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},
 booktitle = {Network Coding (NetCod), 2013 International Symposium on},
 doi = {10.1109/NetCod.2013.6570819},
 file = {:papers:securing_bc.pdf},
 month = {June},
 pages = {1-6},
 tags = {conf,WiNetSec,IT},
 title = {Securing broadcast against dishonest receivers},
 type = {4},
 year = {2013}
}

{"_id":"Hzq4zYN5CgBoWBYFx","bibbaseid":"czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013","author_short":["Czap, L.","Prabhakaran, V.","Diggavi, S.","Fragouli, C."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure capacity region of the private messages under the requirement that Bob and Calvin do not learn each other's message. In this paper, we assume that Bob (or Calvin) may provide dishonest feedback; or even control the input message distributions, as is commonly assumed in cryptography literature. We characterize the capacity region in the case of dishonest adversaries, as well as an achievable region for the case when the adversary has complete control on the distribution of the messages. We also design polynomial time protocols for both cases, that rely on the use of coding techniques to mix and secure the private messages. As a side result, we define an extended notion of semantic security for this problem and using a similar approach to [2], we show the equivalence of different security notions.","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":"Network Coding (NetCod), 2013 International Symposium on","doi":"10.1109/NetCod.2013.6570819","file":":papers:securing_bc.pdf","month":"June","pages":"1-6","tags":"conf,WiNetSec,IT","title":"Securing broadcast against dishonest receivers","year":"2013","bibtex":"@inproceedings{6570819,\n abstract = {Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedback, and characterized the secure capacity region of the private messages under the requirement that Bob and Calvin do not learn each other's message. In this paper, we assume that Bob (or Calvin) may provide dishonest feedback; or even control the input message distributions, as is commonly assumed in cryptography literature. We characterize the capacity region in the case of dishonest adversaries, as well as an achievable region for the case when the adversary has complete control on the distribution of the messages. We also design polynomial time protocols for both cases, that rely on the use of coding techniques to mix and secure the private messages. As a side result, we define an extended notion of semantic security for this problem and using a similar approach to [2], we show the equivalence of different security notions.},\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\n booktitle = {Network Coding (NetCod), 2013 International Symposium on},\n doi = {10.1109/NetCod.2013.6570819},\n file = {:papers:securing_bc.pdf},\n month = {June},\n pages = {1-6},\n tags = {conf,WiNetSec,IT},\n title = {Securing broadcast against dishonest receivers},\n type = {4},\n year = {2013}\n}\n\n","author_short":["Czap, L.","Prabhakaran, V.","Diggavi, S.","Fragouli, C."],"key":"6570819","id":"6570819","bibbaseid":"czap-prabhakaran-diggavi-fragouli-securingbroadcastagainstdishonestreceivers-2013","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":["securing","broadcast","against","dishonest","receivers","czap","prabhakaran","diggavi","fragouli"],"title":"Securing broadcast against dishonest receivers","year":2013}