• DocumentCode
    3120133
  • Title

    The chief security officer problem

  • Author

    Namuduri, Kamesh ; Varanasi, Murali

  • Author_Institution
    Dept. of Electr. Eng., Univ. of North Texas, Denton, TX, USA
  • fYear
    2011
  • fDate
    23-25 March 2011
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    This paper introduces the chief security officer (CSO) problem for the first time and defines its scope based on two well known concepts in information theory: the Central Estimation Officer (CEO) problem and the secrecy capacity of communication channels. The CSO framework consists of a CSO, several secret agents gathering intelligence information from an open forum that may include one or more eavesdroppers capable of listening to all conversations. While there are several important research questions relevant to the CSO framework, this paper focuses on two central issues (1) how much information can be exchanged between the CSO and the agents without leaking it to the eavesdropper? (2) What is the power allocation strategy that the CSO needs to follow so as to maximize the secrecy rate of information transfer?
  • Keywords
    security of data; CSO framework; central estimation officer problem; chief security officer problem; information theory; information transfer; intelligence information; power allocation strategy; secret agent; AWGN; Context; Lead; Logic gates;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems (CISS), 2011 45th Annual Conference on
  • Conference_Location
    Baltimore, MD
  • Print_ISBN
    978-1-4244-9846-8
  • Electronic_ISBN
    978-1-4244-9847-5
  • Type

    conf

  • DOI
    10.1109/CISS.2011.5766177
  • Filename
    5766177