New Monotones and Lower Bounds in Unconditional Two-Party Computation

DOI10.1109/TIT.2008.921674zbMath1306.94107OpenAlexW2157086200MaRDI QIDQ3604712

Stefan 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

unconditional securitylower boundsoblivious transfertwo-party computationmonotones

Mathematics Subject Classification ID

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

Related Items (3)

Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources ⋮ Categorical composable cryptography: extended version ⋮ Categorical composable cryptography

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