Ändra sökning
Avgränsa sökresultatet
1 - 7 av 7
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Bassi, German
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Teknisk informationsvetenskap. Univ Paris Sud, CNRS, Cent Supelec, Lab Signaux & Syst,L2S,UMR 8506, F-91192 Gif Sur Yvette, France.
    Piantanida, Pablo
    Shamai (Shitz), Shlomo
    The Wiretap Channel With Generalized Feedback: Secure Communication and Key Generation2019Ingår i: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 65, nr 4, s. 2213-2233Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    It is a well-known fact that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this paper, an achievable scheme for the wiretap channel with generalized feedback is presented. This scheme, which uses the feedback signal to generate a shared secret key between the legitimate users, encrypts the message to be sent at the bit level. New capacity results for a class of channels are provided, as well as some new insights into the secret key agreement problem. Moreover, this scheme recovers previously reported rate regions from the literature, and thus it can be seen as a generalization that unifies several results in the field.

  • 2.
    Bassi, Germán
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.
    Piantanida, Pablo
    Shamai, Shlomo
    Secret key generation over noisy channels with common randomness2016Ingår i: 2016 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers (IEEE), 2016, Vol. 2016, s. 510-514, artikel-id 7541351Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper investigates the problem of secret key generation over a wiretap channel when the terminals have access to correlated sources. These sources are independent of the main channel and the users observe them before the transmission takes place. A novel achievable scheme for this model is proposed and is shown to be optimal under certain less noisy conditions. This result improves upon the existing literature where the more stringent condition of degradedness was needed.

  • 3.
    Bassi, Germán
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Teknisk informationsvetenskap.
    Piantanida, Pablo
    Shamai, Shlomo
    The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources2019Ingår i: Entropy, ISSN 1099-4300, E-ISSN 1099-4300, Vol. 21, nr 8, artikel-id 732Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources are independent of the main channel and the users overhear them before the transmission takes place. A novel outer bound is proposed and, employing a previously reported inner bound, the secret key capacity is derived under certain less-noisy conditions on the channel or source components. This result improves upon the existing literature where the more stringent condition of degradedness is required. Furthermore, numerical evaluation of the achievable scheme and previously reported results for a binary model are presented; a comparison of the numerical bounds provides insights on the benefit of the chosen scheme.

  • 4.
    Bassi, Germán
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Teknisk informationsvetenskap.
    Skoglund, Mikael
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Teknisk informationsvetenskap.
    On the Mutual Information of Two Boolean Functions, with Application to Privacy2019Ingår i: Proceedings 2019 IEEE International Symposium on Information Theory (ISIT), IEEE , 2019, s. 1197-1201Konferensbidrag (Refereegranskat)
    Abstract [en]

    We investigate the behavior of the mutual information between two Boolean functions of correlated binary strings. The covariance of these functions is found to be a crucial parameter in the aforementioned mutual information. We then apply this result in the analysis of a specific privacy problem where a user observes a random binary string. Under particular conditions, we characterize the optimal strategy for communicating the outcomes of a function of said string while preventing to leak any information about a different function.

  • 5.
    Bassi, Germán
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Teknisk informationsvetenskap.
    Skoglund, Mikael
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Teknisk informationsvetenskap.
    Piantanida, Pablo
    Lossy Communication Subject to Statistical Parameter Privacy2018Ingår i: 2018 IEEE International Symposium on Information Theory (ISIT) - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2018, s. 1031-1035, artikel-id 8437690Konferensbidrag (Refereegranskat)
    Abstract [en]

    We investigate the problem of sharing (communi-cating) the outcomes of a memoryless source when some of its statistical parameters must be kept private. Privacy is measured in terms of the Bayesian statistical risk according to a desired loss function while the quality of the reconstruction is measured by the average per-letter distortion. We first bound -uniformly over all possible estimators- the expected risk from below. This information-theoretic bound depends on the mutual information between the parameters and the disclosed (noisy) samples. We then present an achievable scheme that guarantees an upper bound on the average distortion while keeping the risk above a desired threshold, even when the length of the sample increases.

  • 6.
    Molavipour, Sina
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, ACCESS Linnaeus Centre.
    Bassi, German
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Testing for Directed Information Graphs2017Ingår i: 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), IEEE, 2017, s. 212-219Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we study a hypothesis test to determine the underlying directed graph structure of nodes in a network, where the nodes represent random processes and the direction of the links indicate a causal relationship between said processes. Specifically, a k-th order Markov structure is considered for them, and the chosen metric to determine a connection between nodes is the directed information. The hypothesis test is based on the empirically calculated transition probabilities which are used to estimate the directed information. For a single edge, it is proven that the detection probability can be chosen arbitrarily close to one, while the false alarm probability remains negligible. When the test is performed on the whole graph, we derive bounds for the false alarm and detection probabilities, which show that the test is asymptotically optimal by properly setting the threshold test and using a large number of samples. Furthermore, we study how the convergence of the measures relies on the existence of links in the true graph.

  • 7.
    Molavipour, Sina
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Teknisk informationsvetenskap. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Bassi, Germán
    KTH, Skolan för elektro- och systemteknik (EES), Teknisk informationsvetenskap. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, Skolan för elektro- och systemteknik (EES), Teknisk informationsvetenskap. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Improved performance bounds for the infinite-dimensional Witsenhausen problem2017Ingår i: 2017 American Control Conference (ACC), Institute of Electrical and Electronics Engineers (IEEE), 2017, s. 1067-1072, artikel-id 7963094Konferensbidrag (Refereegranskat)
    Abstract [en]

    There is a growing concern regarding the design of decentralized control systems. Witsenhausen's counterexample is a well-known problem which has remained open in this context, and emphasizes the necessity of communication between blocks in a distributed control system. In this paper, we study an infinite vector model of this problem and a new bound for the cost function is derived. It is shown that this bound improves upon previously known bounds obtained by dirty paper coding in some SNR regimes. Consequently, a system can be designed to sense the SNR level and then select the best scheme between these two sub-optimal strategies.

1 - 7 av 7
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf