Actual Protocol - Explore the Science & Experts | ideXlab

Scan Science and Technology

Contact Leading Edge Experts & Companies

Actual Protocol

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

Actual Protocol – Free Register to Access Experts & Abstracts

Paul Syverson – One of the best experts on this subject based on the ideXlab platform.

  • Security Protocols Workshop – Paul revere Protocols (transcript of discussion)
    Lecture Notes in Computer Science, 2012
    Co-Authors: Paul Syverson
    Abstract:

    All right, saving the worst for last. I guess, keeping with the theme, this is not (well in a sense it is) about bringing Protocols to life: in this case it’s more bringing history to life. I’m going to be describing an Actual Protocol that was quite significant in history. Some people may know about it. This is a poem that describes the events. This is something that American schoolchildren for many generations, or decades, were forced to memorize after it came out. I was Actually, I think, after that period: I don’t remember ever having to memorize this (and my school did keep things around for a long time: we were still having air-raid drills when I was a senior in high school in 1976). But in any case I didn’t have to memorize this.

Go Kato – One of the best experts on this subject based on the ideXlab platform.

  • Quantum circuit for the proof of the security of quantum key distribution without encryption of error syndrome and noisy processing
    Physical Review A, 2010
    Co-Authors: Kiyoshi Tamaki, Go Kato
    Abstract:

    One of the simplest security proofs of quantum key distribution is based on the so-called complementarity scenario, which involves the complementarity control of an Actual Protocol and a virtual Protocol [M. Koashi, e-print arXiv:0704.3661 (2007)]. The existing virtual Protocol has a limitation in classical postprocessing, i.e., the syndrome for the error-correction step has to be encrypted. In this paper, we remove this limitation by constructing a quantum circuit for the virtual Protocol. Moreover, our circuit with a shield system gives an intuitive proof of why adding noise to the sifted key increases the bit error rate threshold in the general case in which one of the parties does not possess a qubit. Thus, our circuit bridges the simple proof and the use of wider classes of classical postprocessing.

Kiyoshi Tamaki – One of the best experts on this subject based on the ideXlab platform.

  • Quantum circuit for the proof of the security of quantum key distribution without encryption of error syndrome and noisy processing
    Physical Review A, 2010
    Co-Authors: Kiyoshi Tamaki, Go Kato
    Abstract:

    One of the simplest security proofs of quantum key distribution is based on the so-called complementarity scenario, which involves the complementarity control of an Actual Protocol and a virtual Protocol [M. Koashi, e-print arXiv:0704.3661 (2007)]. The existing virtual Protocol has a limitation in classical postprocessing, i.e., the syndrome for the error-correction step has to be encrypted. In this paper, we remove this limitation by constructing a quantum circuit for the virtual Protocol. Moreover, our circuit with a shield system gives an intuitive proof of why adding noise to the sifted key increases the bit error rate threshold in the general case in which one of the parties does not possess a qubit. Thus, our circuit bridges the simple proof and the use of wider classes of classical postprocessing.

Gorka Orive – One of the best experts on this subject based on the ideXlab platform.

Laure Petrucci – One of the best experts on this subject based on the ideXlab platform.

  • The {NEO} Protocol for Large-Scale Distributed Database Systems: Modelling and Initial Verification
    , 2010
    Co-Authors: Christine Choppy, Anna Dedova, Sami Evangelista, Silien Hong, Kaïs Klai, Laure Petrucci
    Abstract:

    This paper presents the modelling process and first analysis results carried out within the NEOPPOD project. A Protocol, NEO, has been designed in order to manage very large distributed databases such as those used for banking and e-government applications, and thus to handle sensitive data. Security of data is therefore a critical issue that must be ensured before the software can be released on the market. Our project aims at verifying essential properties of the Protocol so as to guarantee such properties are satisfied. The model was designed by reverse-engineering from the source code, and then initial verification was performed. This modelling work requires choices of adequate abstraction levels both at the modelling and verification stages. In particular, the overall system is so large that the model should be carefully built in order to make verification possible without getting too far from the Actual Protocol implementation. This paper focuses on the modelling and initial validation of the election process launched at the system initialisation.

  • Petri Nets – The NEO Protocol for large-scale distributed database systems: modelling and initial verification
    Applications and Theory of Petri Nets, 2010
    Co-Authors: Christine Choppy, Anna Dedova, Sami Evangelista, Silien Hong, Kaïs Klai, Laure Petrucci
    Abstract:

    This paper presents the modelling process and first analysis results carried out within the NEOPPOD project. A Protocol, NEO, has been designed in order to manage very large distributed databases such as those used for banking and e-government applications, and thus to handle sensitive data. Security of data is therefore a critical issue that must be ensured before the software can be released on the market. Our project aims at verifying essential properties of the Protocol so as to guarantee such properties are satisfied. The model was designed by reverse-engineering from the source code, and then initial verification was performed. This modelling work requires choices of adequate abstraction levels both at the modelling and verification stages. In particular, the overall system is so large that the model should be carefully built in order to make verification possible without getting too far from the Actual Protocol implementation. This paper focuses on the modelling and initial validation of the election process launched at the system initialisation.