Protocol Library: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
(16 intermediate revisions by 7 users not shown) | |||
Line 1: | Line 1: | ||
'''[https://scholar.googleusercontent.com/scholar.bib?q=info:1tFUyiAGSicJ:scholar.google.com/&output=citation&scisdr=ClH3gw_SEOypwjKNmnk:AFWwaeYAAAAAZaWLgnmyQj9Db57Zdp6fbpm8Gmc&scisig=AFWwaeYAAAAAZaWLgnf5EfmL2FMU4hgCdbiauQw&scisf=4&ct=citation&cd=-1&hl=en| Cite Us]''' | |||
{| class="wikitable" | {| class="wikitable" | ||
!width="40%"|Functionality | !width="40%"|Functionality | ||
Line 8: | Line 9: | ||
|[[Verifiable Quantum Anonymous Transmission]] | |[[Verifiable Quantum Anonymous Transmission]] | ||
|- | |- | ||
|rowspan=" | |rowspan="1"|[[Authentication of Classical Messages]]||[[Uncloneable Encryption]] | ||
|- | |- | ||
|[[ | |rowspan="7"|[[Authentication of Quantum Messages]]||[[Purity Testing based Quantum Authentication]] | ||
|- | |- | ||
| | |[[Polynomial Code based Quantum Authentication]] | ||
|- | |||
|[[Clifford Code for Quantum Authentication]] | |||
|- | |||
|[[Trap Code for Quantum Authentication]] | |||
|- | |- | ||
|[[ | |[[Auth-QFT-Auth Scheme for Quantum Authentication]] | ||
|- | |||
|[[Unitary Design Scheme for Quantum Authentication]] | |||
|- | |||
|[[Naive approach using Quantum Teleportation]] | |||
|- | |- | ||
||[[Byzantine Agreement]]||[[Fast Quantum Byzantine Agreement]] | ||[[Byzantine Agreement]]||[[Fast Quantum Byzantine Agreement]] | ||
Line 24: | Line 33: | ||
|[[Quantum Weak Coin Flipping]] | |[[Quantum Weak Coin Flipping]] | ||
|- | |- | ||
|[[Copy Protection]]||[[Copy Protection of Compute and Compare Programs]] | |||
|- | |||
|rowspan="8"|[[Quantum Digital Signature|(Quantum) Digital Signature]] |||[[Gottesman and Chuang Quantum Digital Signature]] | |rowspan="8"|[[Quantum Digital Signature|(Quantum) Digital Signature]] |||[[Gottesman and Chuang Quantum Digital Signature]] | ||
|- | |- | ||
Line 64: | Line 75: | ||
|[[Wiesner Quantum Money]] | |[[Wiesner Quantum Money]] | ||
|- | |- | ||
||[[Oblivious Transfer]]||[[Quantum Oblivious Transfer]] | |rowspan="2"|[[Oblivious Transfer]]||[[Quantum Oblivious Transfer]] | ||
|- | |||
|[[Device-Independent Oblivious Transfer]] | |||
|- | |||
|rowspan="10"| [[(Symmetric) Private Information Retrieval]] ||[[Multi-Database Classical Symmetric Private Information Retrieval with Quantum Key Distribution]] | |||
|- | |||
|[[Multi-Database Quantum Symmetric Private Information Retrieval for Coded Servers]] | |||
|- | |||
|[[Multi-Database Quantum Symmetric Private Information Retrieval for Communicating and Colluding Servers]] | |||
|- | |||
|[[Multi-Database Quantum Symmetric Private Information Retrieval in the Visible Setting for a Quantum Database]] | |||
|- | |||
|[[Multi-Database Quantum Symmetric Private Information Retrieval without Shared Randomness]] | |||
|- | |||
|[[Single-Database Quantum Private Information Retrieval in the Honest Server Model]] | |||
|- | |||
|[[Single-Database Quantum Private Information Retrieval in the Honest Server Model and in the Blind Setting for a Quantum Database]] | |||
|- | |||
|[[Single-Database Quantum Private Information Retrieval with Prior Shared Entanglement in the Honest Server Model]] | |||
|- | |||
|[[Quantum Private Queries Protocol Based on Quantum Oblivious Key Distribution]] | |||
|- | |||
|[[Quantum Private Queries Protocol Based on Quantum Random Access Memory]] | |||
|- | |- | ||
|rowspan="2"| [[Quantum Secret Sharing|Secret Sharing]] ||[[Quantum Secret Sharing using GHZ States]] | |rowspan="2"| [[Quantum Secret Sharing|Secret Sharing]] ||[[Quantum Secret Sharing using GHZ States]] | ||
Line 98: | Line 131: | ||
|[[Gate Teleporation]] | |[[Gate Teleporation]] | ||
|- | |- | ||
|[[Verification of | |rowspan="4"|[[Verification of Quantum Computation]]||[[Interactive Proofs for Quantum Computation|Quantum Prover Interactive Proofs]] | ||
|- | |- | ||
|[[Verification of | |[[Verification of NP-complete problems]] | ||
|- | |- | ||
|[[Verification of | |[[Verification of Sub-Universal Quantum Computation]] | ||
|- | |- | ||
|[[Classical Verification of Universal Quantum Computation | |[[Classical Verification of Universal Quantum Computation]] | ||
|- | |- | ||
|rowspan=" | |rowspan="5"|[[Quantum Electronic Voting]]||[[Dual Basis Measurement Based Protocol]] | ||
|- | |- | ||
|[[Travelling Ballot Based Protocol]] | |[[Travelling Ballot Based Protocol]] | ||
Line 113: | Line 146: | ||
|- | |- | ||
|[[Quantum voting based on conjugate coding]] | |[[Quantum voting based on conjugate coding]] | ||
|- | |||
|[[Practical Quantum Electronic Voting]] | |||
|- | |- | ||
||-||[[Weak String Erasure]] | ||-||[[Weak String Erasure]] | ||
|- | |||
|rowspan="3"|[[Entanglement Routing]]||[[Distributed Routing in a Quantum Internet]] | |||
|- | |||
|[[Routing Entanglement in the Quantum Internet]] | |||
|- | |||
|[[Distributing Graph States Over Arbitrary Quantum Networks]] | |||
|- | |||
|rowspan="1"|[[Quantum Conference Key Agreement]]||[[Anonymous Conference Key Agreement using GHZ states]] | |||
|- | |||
|rowspan="1"|[[Quantum Encryption with Certified Deletion]]||[[Prepare-and-Measure Certified Deletion]] | |||
|- |