On the limitations of universally composable two-party computation without set-up assumptions

DOI10.1007/s00145-005-0419-9zbMath1101.68549OpenAlexW2099446123MaRDI QIDQ2499272

Yehuda Lindell, Eyal Kushilevitz, Ran Canetti

Publication date: 14 August 2006

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-005-0419-9

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (17)

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Feasibility and infeasibility of secure computation with malicious PUFs ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ The Layered Games Framework for Specifications and Analysis of Security Protocols ⋮ David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware ⋮ Resettably Secure Computation ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ General composition and universal composability in secure multiparty computation ⋮ On black-box complexity of universally composable security in the CRS model ⋮ A second note on the feasibility of generalized universal composability ⋮ How to Simulate It – A Tutorial on the Simulation Proof Technique

This page was built for publication: On the limitations of universally composable two-party computation without set-up assumptions