Loading...

Perfectly secure index coding

Mojahedian, M. M ; Sharif University of Technology | 2015

517 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ISIT.2015.7282692
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2015
  4. Abstract:
  5. In this paper, we investigate the index coding problem in the presence of an eavesdropper. Messages are to be sent from one transmitter to a number of legitimate receivers who have side information about the messages, and share a set of secret keys with the transmitter. We assume perfect secrecy, meaning that the eavesdropper should not be able to retrieve any information about the message set. This problem is a generalization of the Shannon's cipher system. We study the minimum key lengths for zero-error and perfectly secure index coding problems
  6. Keywords:
  7. Common and private keys ; Perfect secrecy ; Shannon cipher system ; Zero-error communication ; Information theory ; Transmitters ; Index coding ; Perfect secrecy ; Private key ; Shannon ; Zero errors ; Codes (symbols)
  8. Source: IEEE International Symposium on Information Theory - Proceedings, 14 June 2015 through 19 June 2015 ; Volume 2015-June , 2015 , Pages 1432-1436 ; 21578095 (ISSN) ; 9781467377041 (ISBN)
  9. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7282692&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D7282692