Concurrent composition of secure protocols in the timing model

DOI10.1007/s00145-007-0567-1zbMath1130.68049OpenAlexW2030790893MaRDI QIDQ2463448

Yehuda Lindell, Manoj Prabhakaran, Yael Tauman Kalai

Publication date: 6 December 2007

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

Full work available at URL: https://doi.org/10.1007/s00145-007-0567-1

zbMATH Keywords

secure multiparty computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (8)

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Turn-based communication channels ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ Dynamic ad hoc clock synchronization ⋮ General composition and universal composability in secure multiparty computation ⋮ On black-box complexity of universally composable security in the CRS model

This page was built for publication: Concurrent composition of secure protocols in the timing model