A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security

DOI10.1007/978-3-642-14623-7_32zbMath1283.94097OpenAlexW1537467256MaRDI QIDQ3582779

Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek

Publication date: 24 August 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_32

Mathematics Subject Classification ID

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

Related Items (8)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ On the structure of unconditional UC hybrid protocols ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Oblivious transfer is in MiniQCrypt ⋮ Network Oblivious Transfer ⋮ Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications ⋮ On black-box complexity of universally composable security in the CRS model ⋮ The Limits of Common Coins: Further Results

This page was built for publication: A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security