On the Efficiency of Classical and Quantum Oblivious Transfer Reductions

DOI10.1007/978-3-642-14623-7_38MaRDI QIDQ3582785zbMATH OpenOpenAlexFDO

Authors Severin Winkler, Jürg Wullschleger

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

lower boundsoblivious transferquantum cryptographytwo-party computationunconditional security

Mathematics Subject Classification ID

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

Recommendations

• On the Efficiency of Classical and Quantum Secure Function Evaluation
• Quantum m-out-of-n oblivious transfer
• Lower Bounds for Oblivious Transfer Reductions
• Almost optimal oblivious transfer from QA-NIZK
• Randomized quantum oblivious transfer with application in hacker-resistant computation
• scientific article; zbMATH DE number 1030986
• Quantum oblivious transfer: a secure practical implementation
• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
• On oblivious transfer capacity

Cited in

(15)

• Oblivious transfer is in MiniQCrypt
• Optimal bounds for semi-honest quantum oblivious transfer
• On the communication required for unconditionally secure multiplication
• Lower bounds for quantum oblivious transfer
• On the efficiency of bit commitment reductions
• New Monotones and Lower Bounds in Unconditional Two-Party Computation
• Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation
• Lower Bounds for Oblivious Transfer Reductions
• scientific article; zbMATH DE number 2085197 (Why is no real title available?)
• scientific article; zbMATH DE number 826067 (Why is no real title available?)
• Cryptanalysis and improvement of Wu-Cai-Wu-Zhang's quantum private comparison protocol
• Quantum cryptography and security analysis
• New Monotones and Lower Bounds in Unconditional Two-Party Computation
• Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions

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

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