QAGORA

Author: JuliaM

  • Physical Resource Library

    —

    by

    JuliaM
    in ,

    Physical resources, as the name suggests, are the fundamental physical building blocks required in the lab (or even in simulations) for implementing a quantum communication protocol. They represent the lowest-level modules in a protocol hierarchy, linking an abstract functionality to a concrete resource. Here is the list of the physical resources we have in the…

  • Knowledge Graph

    —

    by

    JuliaM
    in

    The Knowledge Graph is the QPZ’s interactive visualisation tool, displaying all pages in the zoo at their position in the hierarchy, with the following categories in order from top to bottom: Functionalities, Protocols (High-Level and Low-Level), Nodal Subroutines and Physical Resources. The Knowledge Graph has two modes: In both modes, clicking on a previously selected…

  • Secure Multiparty Delegated Classical Computation

    —

    by

    JuliaM
    in

    implements Secure Delegated Computation Introduction This protocol [1] provides a method for computing nonlinear functions involving multiple variables using only linear classical computing and limited manipulation of quantum information. To demonstrate this protocol, the pairwise AND function is computed and can be used as a building block for other functions. Related Paper(s) Classical multiparty computation…

  • Gottesman and Chuang Quantum Digital Signature

    —

    by

    JuliaM
    in

    implements Quantum Digital Signature Introduction This protocol achieves the functionality of (Quantum) Digital Signatures (QDS) allowing the exchange of classical messages from sender to multiple recipients, with a guarantee that the signature has come from a genuine sender. This protocol achieves all the properties of QDS. Further it requires the parties to store quantum states…

  • Copy protection of Point Functions

    —

    by

    JuliaM
    in

    implements Copy Protection Introduction This protocol achieves the functionality of Copy Protection allowing a Vendor to send a program to a Client such that the Client cannot duplicate it.  Related Paper(s) Quantum copy-protection of compute-and-compare programs in the quantum random oracle model Outline Any Copy Protection protocol consists of two algorithms: Protect and Eval. For the family of…

  • Copy Protection of Compute-and-Compare Programs

    —

    by

    JuliaM
    in

    implements Copy Protection Introduction This protocol achieves the functionality of Copy Protection allowing a Vendor to send a program to a Client such that the Client cannot duplicate it. This protocol, in particular, achieves copy-protection for ‘compute-and-compare’ programs. Related Paper(s) Quantum copy-protection of compute-and-compare programs in the quantum random oracle model Outline Any Copy Protection…

  • Quantum Weak Coin Flipping

    —

    by

    JuliaM
    in

    implements Coin Flipping Introduction Quantum Weak Coin Flipping (QWCF) is a cryptographic primitive that allows two remote and distrustful parties, Alice and Bob, to generate a random bit, such that each party has a known and opposite preferred outcome. In other words, the outcome of the flip will designate a winner and a loser. The…

  • Quantum Strong Coin Flipping

    —

    by

    JuliaM
    in

    implements Coin Flipping Introduction This protocol allows two remote participants to share a uniformly distributed random bit. The parties do not trust each other and can only use classical and quantum channels to communicate. The protocol allows them to perform what coin tossing for nearby parties performs without the involvement of any trusted third party.…

  • Quantum Bit Commitment

    —

    by

    JuliaM
    in

    implements Bit Commitment Introduction This protocol achieves the task of bit commitment securely by using a relativistic scheme. In bit commitment, the committer “commits” to a particular bit value. The receiver knows nothing about the committed bit value until the committer chooses to do so (hiding property). The receiver has a guarantee that once committed,…

  • Fast Quantum Byzantine Agreement

    —

    by

    JuliaM
    in

    implements Byzantine Agreement Introduction This protocol is an efficient solution to the classical task of Byzantine Agreement. It allows multiple players in a network to reach an agreement in the presence of some faulty players. The protocol solves the task in the strongest possible failure model (called Byzantine failures). The quantum protocol is provably faster…