New Monotones and Lower Bounds in Unconditional Two-Party Computation

DOI10.1109/TIT.2008.921674MaRDI QIDQ3604712zbMATH OpenOpenAlexFDO

Authors S. Wolf, Jürg Wullschleger

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2008.921674

zbMATH Keywords

lower boundsmonotonesoblivious transfertwo-party computationunconditional security

Mathematics Subject Classification ID

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

Recommendations

• New Monotones and Lower Bounds in Unconditional Two-Party Computation
• Lower Bounds for Oblivious Transfer Reductions
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• Oblivious Transfer and Linear Functions

Cited in

(4)

• Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
• New Monotones and Lower Bounds in Unconditional Two-Party Computation
• Categorical composable cryptography: extended version
• Categorical composable cryptography

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 Q3604712)