New Monotones and Lower Bounds in Unconditional Two-Party Computation

DOI10.1007/11535218_28MaRDI QIDQ5451043zbMATH OpenOpenAlexFDO

Authors S. Wolf, Jürg Wullschleger

Publication date 17 March 2008

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

Full work available at URL https://doi.org/10.1007/11535218_28

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Recommendations

• New Monotones and Lower Bounds in Unconditional Two-Party Computation
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• Lower Bounds for Oblivious Transfer Reductions
• Oblivious-Transfer Amplification
• On the efficiency of bit commitment reductions

Cited in

(7)

• The physics of no-bit-Commitment: Generalized quantum non-locality versus oblivious transfer
• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
• Local randomness in Cabello's non-locality argument from the information causality principle
• Complete characterization of broadcast and pseudo-signatures from correlations
• 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 Is Symmetric

This page was built for publication: New Monotones and Lower Bounds in Unconditional Two-Party Computation

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