Group secret key generation over broadcast erasure channels. Siavoshani, M., Fragouli, C., Diggavi, S., Pulleti, U., & Argyraki, K. In Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on, pages 719-723, Nov, 2010. doi abstract bibtex We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is observed by Eve. For this setup we characterize the secret key generation capacity and propose an achievability scheme that is computationally efficient and employs techniques from network coding. Surprisingly, whether we have m = 2 nodes, or an arbitrary number m of nodes, we can establish a shared secret key among them at the same rate, independently of m.
@inproceedings{5757657,
abstract = {We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is observed by Eve. For this setup we characterize the secret key generation capacity and propose an achievability scheme that is computationally efficient and employs techniques from network coding. Surprisingly, whether we have m = 2 nodes, or an arbitrary number m of nodes, we can establish a shared secret key among them at the same rate, independently of m.},
author = {Siavoshani, M.J. and Fragouli, C. and Diggavi, S. and Pulleti, U. and Argyraki, K.},
booktitle = {Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on},
doi = {10.1109/ACSSC.2010.5757657},
issn = {1058-6393},
month = {Nov},
pages = {719-723},
tags = {conf,IT,WiNetSec},
title = {Group secret key generation over broadcast erasure channels},
type = {4},
year = {2010}
}
Downloads: 0
{"_id":"8ZZGk7hf4ALrBWHui","bibbaseid":"siavoshani-fragouli-diggavi-pulleti-argyraki-groupsecretkeygenerationoverbroadcasterasurechannels-2010","author_short":["Siavoshani, M.","Fragouli, C.","Diggavi, S.","Pulleti, U.","Argyraki, K."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is observed by Eve. For this setup we characterize the secret key generation capacity and propose an achievability scheme that is computationally efficient and employs techniques from network coding. Surprisingly, whether we have m = 2 nodes, or an arbitrary number m of nodes, we can establish a shared secret key among them at the same rate, independently of m.","author":[{"propositions":[],"lastnames":["Siavoshani"],"firstnames":["M.J."],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["S."],"suffixes":[]},{"propositions":[],"lastnames":["Pulleti"],"firstnames":["U."],"suffixes":[]},{"propositions":[],"lastnames":["Argyraki"],"firstnames":["K."],"suffixes":[]}],"booktitle":"Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on","doi":"10.1109/ACSSC.2010.5757657","issn":"1058-6393","month":"Nov","pages":"719-723","tags":"conf,IT,WiNetSec","title":"Group secret key generation over broadcast erasure channels","year":"2010","bibtex":"@inproceedings{5757657,\n abstract = {We consider a group of m trusted nodes that aim to create a shared secret key K over a wireless channel in the presence an eavesdropper Eve. We assume an erasure broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is observed by Eve. For this setup we characterize the secret key generation capacity and propose an achievability scheme that is computationally efficient and employs techniques from network coding. Surprisingly, whether we have m = 2 nodes, or an arbitrary number m of nodes, we can establish a shared secret key among them at the same rate, independently of m.},\n author = {Siavoshani, M.J. and Fragouli, C. and Diggavi, S. and Pulleti, U. and Argyraki, K.},\n booktitle = {Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on},\n doi = {10.1109/ACSSC.2010.5757657},\n issn = {1058-6393},\n month = {Nov},\n pages = {719-723},\n tags = {conf,IT,WiNetSec},\n title = {Group secret key generation over broadcast erasure channels},\n type = {4},\n year = {2010}\n}\n\n","author_short":["Siavoshani, M.","Fragouli, C.","Diggavi, S.","Pulleti, U.","Argyraki, K."],"key":"5757657","id":"5757657","bibbaseid":"siavoshani-fragouli-diggavi-pulleti-argyraki-groupsecretkeygenerationoverbroadcasterasurechannels-2010","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["group","secret","key","generation","over","broadcast","erasure","channels","siavoshani","fragouli","diggavi","pulleti","argyraki"],"title":"Group secret key generation over broadcast erasure channels","year":2010}