Universally-Composable Two-Party Computation in Two Rounds

DOI10.1007/978-3-540-74143-5_7zbMath1215.94052OpenAlexW1526518474MaRDI QIDQ3612546

Omer Horvitz, Jonathan N. Katz

Publication date: 10 March 2009

Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_7

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

Security of blind signatures revisited ⋮ Black-box reusable NISC with random oracles ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ Abuse resistant law enforcement access systems ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings

This page was built for publication: Universally-Composable Two-Party Computation in Two Rounds