"LP formulations for secrecy over erasure networks with feedback"
| Title | "LP formulations for secrecy over erasure networks with feedback" |
| Publication Type | Conference Paper |
| Year of Publication | 2015 |
| Authors | A. Papadopoulos, L. Czap, C. Fragouli |
| Conference Name | 2015 IEEE International Symposium on Information Theory (ISIT) |
| Date Published | June |
| Publisher | IEEE |
| ISBN Number | 978-1-4673-7704-1 |
| Accession Number | 15506900 |
| Keywords | arbitrary network, Automatic repeat request, Complexity theory, cryptography, Encryption, erasure network, feedback, Linear programming, LP formulation, message sending, network coding, polynomial time scheme, pubcrawl170102, secure message transmission, telecommunication channels, telecommunication security |
| Abstract | We design polynomial time schemes for secure message transmission over arbitrary networks, in the presence of an eavesdropper, and where each edge corresponds to an erasure channel with public feedback. Our schemes are described through linear programming (LP) formulations, that explicitly select (possibly different) sets of paths for key-generation and message sending. Although our LPs are not always capacity-achieving, they outperform the best known alternatives in the literature, and extend to incorporate several interesting scenaria. |
| URL | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7282596&isnumber=7282397 |
| DOI | 10.1109/ISIT.2015.7282596 |
| Citation Key | 7282596 |