Oblivious transfer is in MiniQCrypt
From MaRDI portal
Publication:2056751
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 6492476 (Why is no real title available?)
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 176554 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1263182 (Why is no real title available?)
- scientific article; zbMATH DE number 1302858 (Why is no real title available?)
- scientific article; zbMATH DE number 1775399 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- A zero-one law for cryptographic complexity with respect to computational UC security
- Actively secure two-party evaluation of any quantum operation
- Adaptive versus non-adaptive strategies in the quantum setting with applications
- Advances in Cryptology - CRYPTO 2003
- Building one-time memories from isolated qubits (extended abstract)
- Certifiable quantum dice, or, true random number generation secure against quantum adversaries
- Composing Quantum Protocols in a Classical Environment
- Cryptography in the Bounded-Quantum-Storage Model
- Feasibility and completeness of cryptographic tasks in the quantum world
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully simulatable quantum-secure coin-flipping and applications
- Improving the Security of Quantum Protocols via Commit-and-Open
- Oblivious transfer is in MiniQCrypt
- Optimal bounds for semi-honest quantum oblivious transfer
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Post-quantum multi-party computation
- Post-quantum zero knowledge in constant rounds
- Quantifying the leakage of quantum protocols for classical two-party cryptography
- Quantum cryptography: public key distribution and coin tossing
- Quantum proofs of knowledge
- Sampling in a quantum population, and applications
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Secure multi-party quantum computation
- Secure multi-party quantum computation with a dishonest majority
- Single-shot security for one-time memories in the isolated qubits model
- Unconditional Security From Noisy Quantum Storage
- Universally composable quantum multi-party computation
Cited in
(21)- One-way functions imply secure computation in a quantum world
- Deterministic secure quantum communication against collective noise
- Black-box separations for non-interactive classical commitments 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
- 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
- Classical binding for quantum commitments
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- 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)
