Quantum One-Time Programs

DOI10.1007/978-3-642-40084-1_20zbMath1317.81075arXiv1211.1080OpenAlexW1870111070MaRDI QIDQ2849405

Douglas Stebila, Gus Gutoski, Anne Broadbent

Publication date: 17 September 2013

Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (24)

Round efficient secure multiparty quantum computation with identifiable abort ⋮ Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity ⋮ Unclonable polymers and their cryptographic applications ⋮ Practical Sharing of Quantum Secrets over Untrusted Channels ⋮ Computational Security of Quantum Encryption ⋮ Efficient Simulation for Quantum Message Authentication ⋮ Fault-tolerant quantum error correction code preparation in UBQC ⋮ Quantum public-key encryption schemes based on conjugate coding ⋮ Another round of breaking and making quantum money: how to not build it from lattices, and more ⋮ One-time programs from commodity hardware ⋮ Practical multi-party quantum homomorphic encryption ⋮ Cloning games: a general framework for unclonable primitives ⋮ Public verifiable measurement-only blind quantum computation based on entanglement witnesses ⋮ Quantum cryptography beyond quantum key distribution ⋮ Unclonable encryption, revisited ⋮ Unnamed Item ⋮ Optimised resource construction for verifiable quantum computation ⋮ Robustness and device independence of verifiable blind quantum computing ⋮ Finite-data-size study on practical universal blind quantum computation ⋮ A quantum evolving secret sharing scheme ⋮ Secure software leasing ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Quantum multi-secret sharing via trap codes and discrete quantum walks ⋮ Quantum Authentication with Key Recycling

This page was built for publication: Quantum One-Time Programs