Concurrent general composition of secure protocols in the timing model

DOI10.1145/1060590.1060687zbMath1192.94121OpenAlexW2067958822MaRDI QIDQ3581455

Yehuda Lindell, Manoj Prabhakaran, Yael Tauman Kalai

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060687

Mathematics Subject Classification ID

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

Related Items (5)

Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Local Sequentiality Does Not Help for Concurrent Composition ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model

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