On the Efficiency of Classical and Quantum Oblivious Transfer Reductions

DOI10.1007/978-3-642-14623-7_38zbMath1283.81054OpenAlexW1507124880MaRDI QIDQ3582785

Jürg Wullschleger, Severin Winkler

Publication date: 24 August 2010

Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_38

zbMATH Keywords

unconditional securitylower boundsquantum cryptographyoblivious transfertwo-party computation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (3)

Quantum cryptography and security analysis ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Cryptanalysis and improvement of Wu–Cai–Wu–Zhang’s quantum private comparison protocol

This page was built for publication: On the Efficiency of Classical and Quantum Oblivious Transfer Reductions