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

David Sutter - One of the best experts on this subject based on the ideXlab platform.

  • efficient one way secret key agreement and Private Channel coding via polarization
    International Cryptology Conference, 2013
    Co-Authors: Joseph M Renes, Renato Renner, David Sutter
    Abstract:

    We introduce explicit schemes based on the polarization phenomenon for the task of secret-key agreement from common information and one-way public communication as well as for the task of Private Channel coding. Our protocols are distinct from previously known schemes in that they combine two practically relevant properties: they achieve the ultimate rate--defined with respect to a strong secrecy condition--and their complexity is essentially linear in the blocklength. However, we are not able to give an efficient algorithm for code construction.

  • efficient one way secret key agreement and Private Channel coding via polarization
    arXiv: Information Theory, 2013
    Co-Authors: David Sutter, Joseph M Renes, Renato Renner
    Abstract:

    We introduce explicit schemes based on the polarization phenomenon for the tasks of one-way secret key agreement from common randomness and Private Channel coding. For the former task, we show how to use common randomness and insecure one-way communication to obtain a strongly secure key such that the key construction has a complexity essentially linear in the blocklength and the rate at which the key is produced is optimal, i.e., equal to the one-way secret-key rate. For the latter task, we present a Private Channel coding scheme that achieves the secrecy capacity using the condition of strong secrecy and whose encoding and decoding complexity are again essentially linear in the blocklength.

Joseph M Renes - One of the best experts on this subject based on the ideXlab platform.

  • efficient one way secret key agreement and Private Channel coding via polarization
    International Cryptology Conference, 2013
    Co-Authors: Joseph M Renes, Renato Renner, David Sutter
    Abstract:

    We introduce explicit schemes based on the polarization phenomenon for the task of secret-key agreement from common information and one-way public communication as well as for the task of Private Channel coding. Our protocols are distinct from previously known schemes in that they combine two practically relevant properties: they achieve the ultimate rate--defined with respect to a strong secrecy condition--and their complexity is essentially linear in the blocklength. However, we are not able to give an efficient algorithm for code construction.

  • efficient one way secret key agreement and Private Channel coding via polarization
    arXiv: Information Theory, 2013
    Co-Authors: David Sutter, Joseph M Renes, Renato Renner
    Abstract:

    We introduce explicit schemes based on the polarization phenomenon for the tasks of one-way secret key agreement from common randomness and Private Channel coding. For the former task, we show how to use common randomness and insecure one-way communication to obtain a strongly secure key such that the key construction has a complexity essentially linear in the blocklength and the rate at which the key is produced is optimal, i.e., equal to the one-way secret-key rate. For the latter task, we present a Private Channel coding scheme that achieves the secrecy capacity using the condition of strong secrecy and whose encoding and decoding complexity are again essentially linear in the blocklength.

Renato Renner - One of the best experts on this subject based on the ideXlab platform.

  • efficient one way secret key agreement and Private Channel coding via polarization
    International Cryptology Conference, 2013
    Co-Authors: Joseph M Renes, Renato Renner, David Sutter
    Abstract:

    We introduce explicit schemes based on the polarization phenomenon for the task of secret-key agreement from common information and one-way public communication as well as for the task of Private Channel coding. Our protocols are distinct from previously known schemes in that they combine two practically relevant properties: they achieve the ultimate rate--defined with respect to a strong secrecy condition--and their complexity is essentially linear in the blocklength. However, we are not able to give an efficient algorithm for code construction.

  • efficient one way secret key agreement and Private Channel coding via polarization
    arXiv: Information Theory, 2013
    Co-Authors: David Sutter, Joseph M Renes, Renato Renner
    Abstract:

    We introduce explicit schemes based on the polarization phenomenon for the tasks of one-way secret key agreement from common randomness and Private Channel coding. For the former task, we show how to use common randomness and insecure one-way communication to obtain a strongly secure key such that the key construction has a complexity essentially linear in the blocklength and the rate at which the key is produced is optimal, i.e., equal to the one-way secret-key rate. For the latter task, we present a Private Channel coding scheme that achieves the secrecy capacity using the condition of strong secrecy and whose encoding and decoding complexity are again essentially linear in the blocklength.

Jose Meseguer - One of the best experts on this subject based on the ideXlab platform.

  • modular verification of sequential composition for Private Channels in maude npa
    International Workshop on Security, 2018
    Co-Authors: Fan Yang, Santiago Escobar, Catherine Meadows, Jose Meseguer
    Abstract:

    This paper gives a modular verification methodology in which, given parametric specifications of a key establishment protocol P and a protocol Q providing Private Channel communication, security and authenticity properties of their sequential composition \(P\; ;\; Q\) can be reduced to: (i) verification of corresponding properties for P, and (ii) verification of corresponding properties for an abstract version \(Q^\alpha \) of Q in which keys have been suitably abstracted. Our results improve upon previous work in this area in several ways. First of all, we both support a large class of equational theories and provide tool support via the Maude-NPA cryptographic protocol analysis tool. Secondly as long as certain conditions on P and Q guaranteeing the secrecy of keys inherited by Q from P are satisfied, our results apply to the composition of any two reachability properties of the two protocols.

Agrawal, Anurag A. - One of the best experts on this subject based on the ideXlab platform.

  • Data from: A Private Channel of nitrogen alleviates interspecific competition for an annual legume
    2021
    Co-Authors: Elias, Jacob D., Agrawal, Anurag A.
    Abstract:

    Please cite this dataset as: Jacob D. Elias and Anurag A. Agrawal. (2021) Data from: A Private Channel of nitrogen alleviates interspecific competition for an annual legume. [dataset] Cornell University eCommons Repository. https://doi.org/10.7298/6g8h-da29The way resource availability predictably alters interspecific interactions and may favor one resource-acquisition strategy over another is critical for understanding context dependency. The ubiquity of nitrogen (N) limitation across terrestrial environments is a driver of plant competition and the association of some plants with N-fixing bacteria (rhizobia) may alleviate competition with non-fixing plants. Conversely, when available soil N is elevated, competitive advantages imparted by rhizobia are hypothesized to decline because non-fixing species are able to readily acquire those nutrients. We manipulated competition, soil N, and soil microbial inoculation, employing the ground bean Amphicarpaea bracteata​​, a native annual N-fixing legume, and jewelweed Impatiens capensis, a native co-occurring non-fixing annual. We found that legume performance was negatively impacted by interspecific competition, but less so under lower soil N in both the greenhouse and field. The legume ​​invested a greater proportion of resources in rhizobia when competing, but only under low N. Also consistent with predictions, a competition-by-microbial inoculation interaction demonstrated that negative effects of competition were likely alleviated by rhizobia. Finally, we detected an interaction between inoculation and fertilization, whereby N-addition resulted in increased performance for uninoculated legumes, but a small decline in performance for inoculated plants, the latter likely representing a cost of mutualism. Thus, several lines of evidence point to the legume-rhizobia mutualism being more beneficial under competition and limited soil N. Competing I. capensis​​, in contrast, benefitted from N addition regardless of the addition of soil microbes. In a survey of natural populations, legume and rhizobia growth were positively correlated at population edges (where interspecific competition is expected to be higher, the mutualism is stronger), while at population centers we found no association. Isotopic evidence confirmed a higher degree of rhizobial N-fixation at population edges compared to centers. Taken together, our results demonstrate an important role for the largely Private Channel of nitrogen in legume competitive performance, but with the benefits imparted by rhizobia being predictably weaker at higher soil fertility. We speculate that alleviation of competitive impacts through resource partitioning is an important and yet largely overlooked aspect of the evolutionary ecology of legume-rhizobia interactions