Two-Server Oblivious Transfer for Quantum Messages
arXiv:2211.03308 · doi:10.1002/qute.202300184
Abstract
Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network. Although it is possible with two servers, any existing protocol works only with classical messages. We propose two-server oblivious transfer protocols for quantum messages.
References in corpus (25)
- The Quantum Internet
- Theoretical framework for quantum networks
- Insecurity of Quantum Secure Computations
- Experimental Demonstration of Blind Quantum Computing
- Universal blind quantum computation
- Quantum Circuits Architecture
- Private Information Retrieval from Coded Databases with Colluding Servers
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Quantum network communication -- the butterfly and beyond
- Prior entanglement between senders enables perfect quantum network coding with modification
- Quantum Network Coding
- Blind topological measurement-based quantum computation
- Universal Quantum Information Compression
- Optimal Blind Quantum Computation
- Secure entanglement distillation for double-server blind quantum computation
- Limits for compression of quantum information carried by ensembles of mixed states
- General Scheme for Perfect Quantum Network Coding with Free Classical Communication
- Exponents of quantum fixed-length pure state source coding
- Experimental Quantum Network Coding
- Modeling of Measurement-based Quantum Network Coding on IBM Q Experience Devices
- On quantum coding for ensembles of mixed states
- Provably-secure symmetric private information retrieval with quantum cryptography
- Secure Quantum Network Code without Classical Communication
- Capacity of Quantum Private Information Retrieval with Collusion of All But One of Servers
- Quantum Capacity of Partially Corrupted Quantum Network