Oblivious transfer is in MiniQCrypt

DOI10.1007/978-3-030-77886-6_18zbMATH Open1479.94182arXiv2011.14980OpenAlexW3108083825MaRDI QIDQ2056751FDOQ2056751

Alex Bredariol Grilo, Fang Song, Vinod Vaikuntanathan, Huijia Lin

Publication date: 8 December 2021

Abstract: MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious quantum polynomial-time adversaries, building on the foundational work of Bennett, Brassard, Cr'epeau and Skubiszewska (CRYPTO 1991). Combining the OT protocol with prior works, we obtain secure two-party and multi-party computation protocols also in MiniQCrypt. This is in contrast to the classical world, where it is widely believed that one-way functions alone do not give us OT. In the common random string model, we achieve a constant-round universally composable (UC) OT protocol.

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

Recommendations

• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• On the existence of loss-tolerant quantum oblivious transfer protocols
• Oblivious-Transfer Amplification
• Security in Communication Networks
• Quantum oblivious transfer: a secure practical implementation

zbMATH Keywords

quantum-secure one-way functionssecure multi-party computation protocolssecure two-party computation protocols

Mathematics Subject Classification ID

Cryptography (94A60) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Quantum cryptography: public key distribution and coin tossing
• Zero-knowledge against quantum attacks
• Title not available (Why is that?)
• A Pseudorandom Generator from any One-way Function
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Founding Cryptography on Oblivious Transfer – Efficiently
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Foundations of Cryptography
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Secure multi-party quantum computation
• A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Actively Secure Two-Party Evaluation of Any Quantum Operation
• Fully Simulatable Quantum-Secure Coin-Flipping and Applications
• Improving the Security of Quantum Protocols via Commit-and-Open
• Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
• Composing Quantum Protocols in a Classical Environment
• Unconditional Security From Noisy Quantum Storage
• Cryptography in the Bounded-Quantum-Storage Model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Single-Shot Security for One-Time Memories in the Isolated Qubits Model
• Quantum Proofs of Knowledge
• Building one-time memories from isolated qubits
• Universally Composable Quantum Multi-party Computation
• Feasibility and Completeness of Cryptographic Tasks in the Quantum World
• Quantifying the leakage of quantum protocols for classical two-party cryptography
• Certifiable quantum dice
• Sampling in a Quantum Population, and Applications
• Title not available (Why is that?)
• Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications
• A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
• Secure multi-party quantum computation with a dishonest majority
• Post-quantum multi-party computation
• Oblivious transfer is in MiniQCrypt
• Optimal bounds for semi-honest quantum oblivious transfer
• Title not available (Why is that?)
• Post-quantum zero knowledge in constant rounds

Cited In (21)

• Black-box separations for non-interactive classical commitments in a quantum world
• One-way functions imply secure computation in a quantum world
• Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
• Deterministic secure quantum communication against collective noise
• Public-key encryption with quantum keys
• Secure quantum computation with classical communication
• A new framework for quantum oblivious transfer
• Cryptography from pseudorandom quantum states
• Cryptography with certified deletion
• On concurrent multi-party quantum computation
• Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
• Oblivious transfer is in MiniQCrypt
• How (not) to build quantum PKE in Minicrypt
• Quantum public-key encryption with tamper-resilient public keys from one-way functions
• Unconditionally secure commitments with quantum auxiliary inputs
• Quantum cryptography in Algorithmica
• Quantum commitments and signatures without one-way functions
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• Classical binding for quantum commitments
• General properties of quantum bit commitments (extended abstract)

This page was built for publication: Oblivious transfer is in MiniQCrypt

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056751)