Oblivious transfer is in MiniQCrypt
From MaRDI portal
Publication:2056751
DOI10.1007/978-3-030-77886-6_18zbMath1479.94182arXiv2011.14980OpenAlexW3108083825MaRDI QIDQ2056751
Fang Song, Vinod Vaikuntanathan, Huijia Lin, Alex Bredariol Grilo
Publication date: 8 December 2021
Full work available at URL: https://arxiv.org/abs/2011.14980
quantum-secure one-way functionssecure multi-party computation protocolssecure two-party computation protocols
Cryptography (94A60) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (15)
One-way functions imply secure computation in a quantum world ⋮ Deterministic secure quantum communication against collective noise ⋮ Cryptography from pseudorandom quantum states ⋮ Quantum commitments and signatures without one-way functions ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ General properties of quantum bit commitments (extended abstract) ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP ⋮ A new framework for quantum oblivious transfer ⋮ On concurrent multi-party quantum computation ⋮ Cryptography with certified deletion ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Secure quantum computation with classical communication ⋮ Classical binding for quantum commitments ⋮ Oblivious transfer is in MiniQCrypt
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Secure multi-party quantum computation with a dishonest majority
- Post-quantum multi-party computation
- Oblivious transfer is in MiniQCrypt
- Optimal bounds for quantum weak oblivious transfer
- Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications
- 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
- Building one-time memories from isolated qubits
- Fully Simulatable Quantum-Secure Coin-Flipping and Applications
- Improving the Security of Quantum Protocols via Commit-and-Open
- Cryptography in the Bounded-Quantum-Storage Model
- Universally Composable Quantum Multi-party Computation
- Secure multi-party quantum computation
- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Sampling in a Quantum Population, and Applications
- Founding Cryptography on Oblivious Transfer – Efficiently
- Composing Quantum Protocols in a Classical Environment
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Foundations of Cryptography
- A Pseudorandom Generator from any One-way Function
- Feasibility and Completeness of Cryptographic Tasks in the Quantum World
- Post-quantum zero knowledge in constant rounds
- Quantifying the leakage of quantum protocols for classical two-party cryptography
- Unconditional Security From Noisy Quantum Storage
- Certifiable quantum dice
- Advances in Cryptology - CRYPTO 2003
This page was built for publication: Oblivious transfer is in MiniQCrypt
