Robust Combiners and Universal Constructions for Quantum Cryptography
Preprint
Abstract
A robust combiner combines many candidates for a cryptographic primitive and generates a new candidate for the same primitive. Its correctness and security hold as long as one of the original candidates satisfies correctness and security. A universal construction is a closely related notion to a robust combiner. A universal construction for a primitive is an explicit construction of the primitive that is correct and secure as long as the primitive exists. It is known that a universal construction for a primitive can be constructed from a robust combiner for the primitive in many cases. Although robust combiners and universal constructions for classical cryptography are widely studied, robust combiners and universal constructions for quantum cryptography have not been explored so far. In this work, we define robust combiners and universal constructions for several quantum cryptographic primitives including one-way state generators, public-key quantum money, quantum bit commitments, and unclonable encryption, and provide constructions of them. On a different note, it was an open problem how to expand the plaintext length of unclonable encryption. In one of our universal constructions for unclonable encryption, we can expand the plaintext length, which resolves the open problem.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM2023
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption2017
- Quantum money from hidden subspaces2012
- On Robust Combiners for Oblivious Transfer and Other Primitives2005
- Adaptively-Secure, Non-interactive Public-Key Encryption2005
- How to Convert the Flavor of a Quantum Bit Commitment2001
- Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation2000
- Unconditionally Secure Quantum Bit Commitment is ImpossiblePhysical Review Letters, 1997
- Is Quantum Bit Commitment Really Possible?Physical Review Letters, 1997
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985