The Experts below are selected from a list of 3282 Experts worldwide ranked by ideXlab platform

Prakash Narayan - One of the best experts on this subject based on the ideXlab platform.

  • Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
    arXiv: Information Theory, 2010
    Co-Authors: Sirin Nitinawarat, Prakash Narayan
    Abstract:

    We consider Perfect secret key generation for a ``pairwise independent network'' model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity. All the terminals as well as an eavesdropper observe this communication. The objective is to generate a Perfect secret key shared by a given set of terminals at the largest rate possible, and concealed from the eavesdropper. First, we show how the notion of Perfect omniscience plays a central role in characterizing Perfect secret key capacity. Second, a multigraph representation of the underlying Secrecy model leads us to an efficient algorithm for Perfect secret key generation based on maximal Steiner tree packing. This algorithm attains capacity when all the terminals seek to share a key, and, in general, attains at least half the capacity. Third, when a single ``helper'' terminal assists the remaining ``user'' terminals in generating a Perfect secret key, we give necessary and sufficient conditions for the optimality of the algorithm; also, a ``weak'' helper is shown to be sufficient for optimality.

  • Perfect Secrecy and combinatorial tree packing
    International Symposium on Information Theory, 2010
    Co-Authors: Sirin Nitinawarat, Prakash Narayan
    Abstract:

    We consider Perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity. All the terminals as well as an eavesdropper observe this communication. The objective is to generate a Perfect secret key shared by a given set of terminals at the largest rate possible, and concealed from the eavesdropper. First, we show how the notion of Perfect omniscience plays a central role in characterizing Perfect secret key capacity. Second, a multigraph representation of the underlying Secrecy model leads us to an efficient algorithm for Perfect secret key generation based on maximal Steiner tree packing. This algorithm attains capacity when all the terminals seek to share a key, and, in general, attains at least half the capacity. Our results yield new bounds for the maximum size and rate of Steiner tree packing, and are of independent interest from a graph theoretic viewpoint. Third, when a single “helper” terminal assists the remaining “user” terminals in generating a Perfect secret key, we give necessary and sufficient conditions for the optimality of the algorithm; also, a “weak” helper is shown to be sufficient for optimality.

  • Perfect Secrecy Perfect omniscience and steiner tree packing
    International Symposium on Information Theory, 2009
    Co-Authors: Sirin Nitinawarat, Alexander Barg, Prakash Narayan, Alexander Reznik
    Abstract:

    We investigate Perfect secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then allowed to communicate interactively in multiple rounds over a public noiseless channel of unlimited capacity. This communication is observed by all the terminals as well as by an eavesdropper. The objective is to generate a Perfect secret key shared by a given set of terminals at the largest rate possible. All the terminals cooperate in generating the secret key, with Perfect Secrecy being required from the eavesdropper. For this model, we introduce the concept of communication for Perfect omniscience using which we first obtain a single-letter characterization of the Perfect secret key capacity. Moreover, this Perfect secret key capacity is shown to be achieved by linear noninteractive communication, and coincides with the (standard) secret key capacity. Our second contribution, exploiting the notion of communication for Perfect omniscience, is a new nonasymptotic and computable upper bound for the combinatorial problem of maximal Steiner tree packing in a multigraph. Thus, our work establishes certain connections among Perfect Secrecy generation and communication for Perfect omniscience for the pairwise independent network model, and Steiner tree packing.

Yuan Luo - One of the best experts on this subject based on the ideXlab platform.

  • Wiretap Channel With Side Information
    arXiv: Information Theory, 2006
    Co-Authors: Bin Dai, Yuan Luo
    Abstract:

    The wiretap channel put forward by Wyner for many years. In this paper, we consider the situation that the wiretapper can not only view the channel output via a second noisy channel, but also can get some side information about the codeword that transmitted in the main noisy channel. The designer tries to build the encoder-decoder in such a way as to maximize the transmission rate R, and the equivocation d of the information as seen by the wiretapper.We find the capacity region for (R,d) pairs, and in particular, if d is equal to Hs, the entropy of the data source, then we consider that the transmission is accomplished in Perfect Secrecy.Our result implies that there exists a C ′ s > 0, such that reliable transmission at rates up to C ′ s is possible in Perfect Secrecy. Index Terms — Wiretap channel, capacity region, Perfect Secrecy

  • An achievable region for the Gaussian wiretap channel with side information
    IEEE Transactions on Information Theory, 2006
    Co-Authors: C Mitrpant, A J H Vinck, Yuan Luo
    Abstract:

    In this correspondence, we extend the Gaussian wiretap channel model introduced by Leung-Yan-Cheong and Hellman to the Gaussian wiretap channel with side information by introducing additive white Gaussian interference in the main channel, which is available to the encoder in advance. This model is also an extension of the dirty-paper channel introduced by Costa since its main channel is the dirty-paper channel. A Perfect-Secrecy-achieving coding strategy for the model is proposed. It is used to derive achievable rates with asymptotic Perfect Secrecy and an achievable rate-equivocation region. The achievable rates with asymptotic Perfect-Secrecy are then compared to upper and lower bounds. The comparison indicates that the proposed coding strategy is optimal in some cases.

  • achieving the Perfect Secrecy for the gaussian wiretap channel with side information
    International Symposium on Information Theory, 2004
    Co-Authors: C Mitrpant, Yuan Luo, A J H Vinck
    Abstract:

    This paper extends the Gaussian wiretap channel (GWC) model introduced by Leung-Yan-Cheong and Hellman (1978) to the Gaussian wiretap channel with side information (GWCSI) by adding an additive white Gaussian interference in the main channel, which is available to the encoder in advance. It can also be looked at as an extension of the dirty-paper channel (DPC) introduced by Costa (1983). We propose a coding strategy achieving Perfect Secrecy for the extended channel, called Gaussian wiretap channel with side information. The corresponding achievable rates with asymptotic Perfect Secrecy are obtained and compared to known upper and lower bounds.

  • ISIT - Achieving the Perfect Secrecy for the Gaussian wiretap channel with side information
    International Symposium onInformation Theory 2004. ISIT 2004. Proceedings., 1
    Co-Authors: C Mitrpant, Yuan Luo, A J H Vinck
    Abstract:

    This paper extends the Gaussian wiretap channel (GWC) model introduced by Leung-Yan-Cheong and Hellman (1978) to the Gaussian wiretap channel with side information (GWCSI) by adding an additive white Gaussian interference in the main channel, which is available to the encoder in advance. It can also be looked at as an extension of the dirty-paper channel (DPC) introduced by Costa (1983). We propose a coding strategy achieving Perfect Secrecy for the extended channel, called Gaussian wiretap channel with side information. The corresponding achievable rates with asymptotic Perfect Secrecy are obtained and compared to known upper and lower bounds.

Sirin Nitinawarat - One of the best experts on this subject based on the ideXlab platform.

  • Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
    arXiv: Information Theory, 2010
    Co-Authors: Sirin Nitinawarat, Prakash Narayan
    Abstract:

    We consider Perfect secret key generation for a ``pairwise independent network'' model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity. All the terminals as well as an eavesdropper observe this communication. The objective is to generate a Perfect secret key shared by a given set of terminals at the largest rate possible, and concealed from the eavesdropper. First, we show how the notion of Perfect omniscience plays a central role in characterizing Perfect secret key capacity. Second, a multigraph representation of the underlying Secrecy model leads us to an efficient algorithm for Perfect secret key generation based on maximal Steiner tree packing. This algorithm attains capacity when all the terminals seek to share a key, and, in general, attains at least half the capacity. Third, when a single ``helper'' terminal assists the remaining ``user'' terminals in generating a Perfect secret key, we give necessary and sufficient conditions for the optimality of the algorithm; also, a ``weak'' helper is shown to be sufficient for optimality.

  • Perfect Secrecy and combinatorial tree packing
    International Symposium on Information Theory, 2010
    Co-Authors: Sirin Nitinawarat, Prakash Narayan
    Abstract:

    We consider Perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity. All the terminals as well as an eavesdropper observe this communication. The objective is to generate a Perfect secret key shared by a given set of terminals at the largest rate possible, and concealed from the eavesdropper. First, we show how the notion of Perfect omniscience plays a central role in characterizing Perfect secret key capacity. Second, a multigraph representation of the underlying Secrecy model leads us to an efficient algorithm for Perfect secret key generation based on maximal Steiner tree packing. This algorithm attains capacity when all the terminals seek to share a key, and, in general, attains at least half the capacity. Our results yield new bounds for the maximum size and rate of Steiner tree packing, and are of independent interest from a graph theoretic viewpoint. Third, when a single “helper” terminal assists the remaining “user” terminals in generating a Perfect secret key, we give necessary and sufficient conditions for the optimality of the algorithm; also, a “weak” helper is shown to be sufficient for optimality.

  • Perfect Secrecy Perfect omniscience and steiner tree packing
    International Symposium on Information Theory, 2009
    Co-Authors: Sirin Nitinawarat, Alexander Barg, Prakash Narayan, Alexander Reznik
    Abstract:

    We investigate Perfect secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then allowed to communicate interactively in multiple rounds over a public noiseless channel of unlimited capacity. This communication is observed by all the terminals as well as by an eavesdropper. The objective is to generate a Perfect secret key shared by a given set of terminals at the largest rate possible. All the terminals cooperate in generating the secret key, with Perfect Secrecy being required from the eavesdropper. For this model, we introduce the concept of communication for Perfect omniscience using which we first obtain a single-letter characterization of the Perfect secret key capacity. Moreover, this Perfect secret key capacity is shown to be achieved by linear noninteractive communication, and coincides with the (standard) secret key capacity. Our second contribution, exploiting the notion of communication for Perfect omniscience, is a new nonasymptotic and computable upper bound for the combinatorial problem of maximal Steiner tree packing in a multigraph. Thus, our work establishes certain connections among Perfect Secrecy generation and communication for Perfect omniscience for the pairwise independent network model, and Steiner tree packing.

A J H Vinck - One of the best experts on this subject based on the ideXlab platform.

  • An achievable region for the Gaussian wiretap channel with side information
    IEEE Transactions on Information Theory, 2006
    Co-Authors: C Mitrpant, A J H Vinck, Yuan Luo
    Abstract:

    In this correspondence, we extend the Gaussian wiretap channel model introduced by Leung-Yan-Cheong and Hellman to the Gaussian wiretap channel with side information by introducing additive white Gaussian interference in the main channel, which is available to the encoder in advance. This model is also an extension of the dirty-paper channel introduced by Costa since its main channel is the dirty-paper channel. A Perfect-Secrecy-achieving coding strategy for the model is proposed. It is used to derive achievable rates with asymptotic Perfect Secrecy and an achievable rate-equivocation region. The achievable rates with asymptotic Perfect-Secrecy are then compared to upper and lower bounds. The comparison indicates that the proposed coding strategy is optimal in some cases.

  • achieving the Perfect Secrecy for the gaussian wiretap channel with side information
    International Symposium on Information Theory, 2004
    Co-Authors: C Mitrpant, Yuan Luo, A J H Vinck
    Abstract:

    This paper extends the Gaussian wiretap channel (GWC) model introduced by Leung-Yan-Cheong and Hellman (1978) to the Gaussian wiretap channel with side information (GWCSI) by adding an additive white Gaussian interference in the main channel, which is available to the encoder in advance. It can also be looked at as an extension of the dirty-paper channel (DPC) introduced by Costa (1983). We propose a coding strategy achieving Perfect Secrecy for the extended channel, called Gaussian wiretap channel with side information. The corresponding achievable rates with asymptotic Perfect Secrecy are obtained and compared to known upper and lower bounds.

  • ISIT - Achieving the Perfect Secrecy for the Gaussian wiretap channel with side information
    International Symposium onInformation Theory 2004. ISIT 2004. Proceedings., 1
    Co-Authors: C Mitrpant, Yuan Luo, A J H Vinck
    Abstract:

    This paper extends the Gaussian wiretap channel (GWC) model introduced by Leung-Yan-Cheong and Hellman (1978) to the Gaussian wiretap channel with side information (GWCSI) by adding an additive white Gaussian interference in the main channel, which is available to the encoder in advance. It can also be looked at as an extension of the dirty-paper channel (DPC) introduced by Costa (1983). We propose a coding strategy achieving Perfect Secrecy for the extended channel, called Gaussian wiretap channel with side information. The corresponding achievable rates with asymptotic Perfect Secrecy are obtained and compared to known upper and lower bounds.

Andrea Fratalocchi - One of the best experts on this subject based on the ideXlab platform.

  • Perfect Secrecy cryptography via mixing of chaotic waves in irreversible time-varying silicon chips.
    Nature communications, 2019
    Co-Authors: A. Di Falco, Valerio Mazzone, Arias Cruz, Andrea Fratalocchi
    Abstract:

    Protecting confidential data is a major worldwide challenge. Classical cryptography is fast and scalable, but is broken by quantum algorithms. Quantum cryptography is unclonable, but requires quantum installations that are more expensive, slower, and less scalable than classical optical networks. Here we show a Perfect Secrecy cryptography in classical optical channels. The system exploits correlated chaotic wavepackets, which are mixed in inexpensive and CMOS compatible silicon chips. The chips can generate 0.1 Tbit of different keys for every mm of length of the input channel, and require the transmission of an amount of data that can be as small as 1/1000 of the message's length. We discuss the security of this protocol for an attacker with unlimited technological power, and who can access the system copying any of its part, including the chips. The second law of thermodynamics and the exponential sensitivity of chaos unconditionally protect this scheme against any possible attack.