Exchanging pairwise secrets efficiently. Safaka, I, Fragouli, C., Argyraki, K., & Diggavi, S. In INFOCOM, 2013 Proceedings IEEE, pages 2265-2273, April, 2013. doi abstract bibtex We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smart-phones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.
@inproceedings{6567030,
abstract = {We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smart-phones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.},
author = {Safaka, I and Fragouli, C. and Argyraki, K. and Diggavi, S.},
booktitle = {INFOCOM, 2013 Proceedings IEEE},
doi = {10.1109/INFCOM.2013.6567030},
file = {:papers:exchanging_secrets.pdf},
issn = {0743-166X},
month = {April},
pages = {2265-2273},
tags = {conf,WiNetSec,IT},
title = {Exchanging pairwise secrets efficiently},
type = {4},
year = {2013}
}
Downloads: 0
{"_id":"X8E4JhFdbhutqseKB","bibbaseid":"safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-2013","author_short":["Safaka, I","Fragouli, C.","Argyraki, K.","Diggavi, S."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smart-phones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.","author":[{"propositions":[],"lastnames":["Safaka"],"firstnames":["I"],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Argyraki"],"firstnames":["K."],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["S."],"suffixes":[]}],"booktitle":"INFOCOM, 2013 Proceedings IEEE","doi":"10.1109/INFCOM.2013.6567030","file":":papers:exchanging_secrets.pdf","issn":"0743-166X","month":"April","pages":"2265-2273","tags":"conf,WiNetSec,IT","title":"Exchanging pairwise secrets efficiently","year":"2013","bibtex":"@inproceedings{6567030,\n abstract = {We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot perform certain computations (e.g., large-integer factorization) in useful time. We ask the question: can we solve this problem without assuming anything about Eve's computational capabilities? We propose a simple secret-agreement protocol, where the wireless nodes keep exchanging bits until they have agreed on pairwise secrets that Eve cannot reconstruct with very high probability. Our protocol relies on Eve's limited network presence (the fact that she cannot be located at an arbitrary number of points in the network at the same time), but assumes nothing about her computational capabilities. We formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure (it leaks zero information to Eve about the secrets). Using a small wireless testbed of smart-phones, we provide experimental evidence that it is feasible for 5 nodes to create thousands of secret bits per second, with their secrecy being independent from the adversary's capabilities.},\n author = {Safaka, I and Fragouli, C. and Argyraki, K. and Diggavi, S.},\n booktitle = {INFOCOM, 2013 Proceedings IEEE},\n doi = {10.1109/INFCOM.2013.6567030},\n file = {:papers:exchanging_secrets.pdf},\n issn = {0743-166X},\n month = {April},\n pages = {2265-2273},\n tags = {conf,WiNetSec,IT},\n title = {Exchanging pairwise secrets efficiently},\n type = {4},\n year = {2013}\n}\n\n","author_short":["Safaka, I","Fragouli, C.","Argyraki, K.","Diggavi, S."],"key":"6567030","id":"6567030","bibbaseid":"safaka-fragouli-argyraki-diggavi-exchangingpairwisesecretsefficiently-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":["exchanging","pairwise","secrets","efficiently","safaka","fragouli","argyraki","diggavi"],"title":"Exchanging pairwise secrets efficiently","year":2013}