scientific article; zbMATH DE number 6866239

DOI10.4230/LIPIcs.TQC.2017.8zbMath1427.81026arXiv1704.04033MaRDI QIDQ4637982

Jamie Sikora, Gus Gutoski, Ansis Rosmanis

Publication date: 3 May 2018

Full work available at URL: https://arxiv.org/abs/1704.04033

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

semidefinite programmingcryptographyfidelityquantum strategies

Mathematics Subject Classification ID

Semidefinite programming (90C22) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

Unconditionally secure quantum bit commitment based on the uncertainty principle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A search for quantum coin-flipping protocols using optimization techniques
• Quantum cryptography: public key distribution and coin tossing
• Weak coin flipping with small bias
• The transition probability in the state space of a \(^*\)-algebra
• Why quantum bit commitment and ideal quantum coin tossing are impossible.
• A short impossibility proof of quantum bit commitment
• Optimal bounds for quantum weak oblivious transfer
• On a measure of distance for quantum strategies
• Lower bounds for Quantum Oblivious Transfer
• Operational distance and fidelity for quantum channels
• Theoretical framework for quantum networks
• Optimal Quantum Strong Coin Flipping
• Simple, near-optimal quantum protocols for die-rolling
• Simpler semidefinite programs for completely bounded norms
• Optimal Bounds for Quantum Bit Commitment
• An Unconditional Study of Computational Zero Knowledge

This page was built for publication: