New Monotones and Lower Bounds in Unconditional Two-Party Computation

DOI10.1007/11535218_28zbMath1145.94476OpenAlexW1833038439MaRDI QIDQ5451043

Jürg Wullschleger, Stefan Wolf

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

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

Related Items (6)

Local randomness in Cabello's non-locality argument from the information causality principle ⋮ The physics of no-bit-Commitment: Generalized quantum non-locality versus oblivious transfer ⋮ Complete characterization of broadcast and pseudo-signatures from correlations ⋮ Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions ⋮ Oblivious Transfer Is Symmetric ⋮ Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification

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