Quantum cryptography beyond quantum key distribution
From MaRDI portal
Publication:908054
DOI10.1007/s10623-015-0157-4zbMath1356.81118arXiv1510.06120WikidataQ59465675 ScholiaQ59465675MaRDI QIDQ908054
Anne Broadbent, Christian Schaffner
Publication date: 2 February 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.06120
survey; quantum money; conjugate coding; delegated quantum computation; limited-quantum-storage models; quantum two-party computation
Related Items
Security analysis of KXB10 QKD protocol with higher-dimensional quantum states, Unconditionally secure quantum bit commitment based on the uncertainty principle, Quantum Key Recycling with 8-state encoding (The Quantum One-Time Pad is more interesting than we thought), Minimally complex ion traps as modules for quantum communication and computing, Authenticated communication from quantum readout of pufs, Security proof for round-robin differential phase shift QKD, Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation, Cryptanalysis of Zhang et al's quantum private comparison and the improvement, Semi-quantum money, Quantum security of grain-128/grain-128a stream cipher against HHL algorithm, Applications of Simon's algorithm in quantum attacks on Feistel variants, Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness, Secure software leasing without assumptions, Computational Security of Quantum Encryption, Efficient Simulation for Quantum Message Authentication
Cites Work
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
- Quantum cryptography: public key distribution and coin tossing
- Using quantum key distribution for cryptographic purposes: a survey
- Quantum cryptography
- Entropic security in quantum cryptography
- Probabilistic encryption
- The transition probability in the state space of a \(^*\)-algebra
- Randomizing quantum states: constructions and applications
- On the complexity of simulating space-bounded quantum computations
- Classical leakage resilience from fault-tolerant quantum computation
- A short impossibility proof of quantum bit commitment
- Experimental quantum cryptography.
- Experimental test of relativistic quantum state collapse with moving reference frames
- A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias
- A Decade of Lattice Cryptography
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Secure communications over insecure channels
- Quantum money from knots
- Quantum One-Time Programs
- Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
- Everlasting Multi-party Computation
- Quantum Position Verification in the Random Oracle Model
- Single-Shot Security for One-Time Memories in the Isolated Qubits Model
- Quantum Proofs of Knowledge
- Actively Secure Two-Party Evaluation of Any Quantum Operation
- Zero-knowledge against quantum attacks
- Composable Security of Delegated Quantum Computation
- A Note on Quantum Security for Post-Quantum Cryptography
- On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation
- Superposition Attacks on Cryptographic Protocols
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Privacy Amplification in the Isolated Qubits Model
- Demonstration of Blind Quantum Computing
- New Bounds for the Garden-Hose Model
- Entanglement Sampling and Applications
- Entropic uncertainty relations—a survey
- The garden-hose model
- Building one-time memories from isolated qubits
- Tight Bounds for Classical and Quantum Coin Flipping
- Concurrent Composition in the Bounded Quantum Storage Model
- The Case for Quantum Key Distribution
- Random Oracles in a Quantum World
- Two Provers in Isolation
- Quantum Private Queries
- Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices
- Position Based Cryptography
- Improving the Security of Quantum Protocols via Commit-and-Open
- Quantum money from hidden subspaces
- Quantum bit escrow
- Unconditional security in quantum cryptography
- BLIND QUANTUM COMPUTATION
- Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
- An All-But-One Entropic Uncertainty Relation, and Application to Password-Based Identification
- Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money
- Multi-prover Commitments Against Non-signaling Attacks
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Composable Security in the Bounded-Quantum-Storage Model
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Post-Quantum Cryptography
- Cryptography in the Bounded-Quantum-Storage Model
- Efficient Device-Independent Quantum Key Distribution
- Universally Composable Quantum Multi-party Computation
- Fast quantum algorithms for computing the unit group and class group of a number field
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- On the (Im-)Possibility of Extending Coin Toss
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation
- The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
- Composing Quantum Protocols in a Classical Environment
- Secure Identification and QKD in the Bounded-Quantum-Storage Model
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- Self-testing of Quantum Circuits
- The Knowledge Complexity of Interactive Proof Systems
- Coin flipping by telephone a protocol for solving impossible problems
- A method for obtaining digital signatures and public-key cryptosystems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Quantum cryptography based on Bell’s theorem
- Quantum cryptography without Bell’s theorem
- Quantum Computation and Lattice Problems
- Feasibility and Completeness of Cryptographic Tasks in the Quantum World
- Robust self-testing of the singlet
- Quantum Algorithms for the Subset-Sum Problem
- Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
- Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths
- Universal Blind Quantum Computation
- Optimal Quantum Strong Coin Flipping
- Fully homomorphic encryption using ideal lattices
- Quantifying the leakage of quantum protocols for classical two-party cryptography
- Merkle Puzzles in a Quantum World
- Classical Cryptographic Protocols in a Quantum World
- The Garden Hose Complexity for the Equality Function
- How to delegate computations
- Quantum Entropic Security and Approximate Quantum Encryption
- Quantum Private Queries: Security Analysis
- Advances in Cryptology - EUROCRYPT 2004
- Quantum Computer Science
- Advances in Cryptology – CRYPTO 2004
- Quantum to Classical Randomness Extractors
- Entanglement Cost of Quantum Channels
- A single quantum cannot be cloned
- Proposed Experiment to Test Local Hidden-Variable Theories
- Quantum cryptography
- On the (im)possibility of obfuscating programs
- Constructing elliptic curve isogenies in quantum subexponential time
- Certifiable quantum dice
- Revocable Quantum Timed-Release Encryption
- Position-Based Quantum Cryptography: Impossibility and Constructions
- A Quantum Cipher with Near Optimal Key-Recycling
- Quantum Anonymous Transmissions
- Optimal Bounds for Quantum Bit Commitment
- Security Bounds for Quantum Cryptography with Finite Resources
- Principles of Distributed Systems
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Quantum Information Theory
- Encyclopedia of Complexity and Systems Science
- Anonymous Quantum Communication
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
