Quantum protocols for rabin oblivious transfer

DOI10.4230/LIPICS.FSTTCS.2025.7MaRDI QIDQ7391877zbMATH OpenFDO

Authors Erika Andersson, Akshay Bansal, James T. Peat, Jamie Sikora, Jiawei Wu

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2025.7

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A constant lower bound for any quantum protocol for secure function evaluation
• A secure protocol for the oblivious transfer. (Extended abstract)
• A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias
• scientific article; zbMATH DE number 7788396 (Why is no real title available?)
• Optimal Bounds for Quantum Bit Commitment
• Optimal bounds for semi-honest quantum oblivious transfer
• Optimal Quantum Strong Coin Flipping
• Robust cryptography in the noisy-quantum-storage model
• The impossibility of efficient Quantum weak coin flipping

This page was built for publication: Quantum protocols for rabin oblivious transfer

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