Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Simulatable Security and Polynomially Bounded Concurrent Composition.

Dennis Hofheinz, Dominique Unruh

Published Jan 1, 2006• 2 citations
OpenAlex

Related papers

Lower Bounds for Concurrent Self Composition

Yehuda Lindell

Lecture notes in computer science•Jan 1, 2004•109 citations

Concurrent Composition of Secure Protocols in the Timing Model

Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran

Journal of Cryptology•Oct 1, 2007•25 citations

Lower Bounds and Impossibility Results for Concurrent Self Composition

Yehuda Lindell

Journal of Cryptology•Sep 27, 2007•38 citations

Protocols for Bounded-Concurrent Secure Two-Party Computation.

Yehuda Lindell

Chicago Journal of Theoretical Computer Science•Jan 1, 2006•2 citations

Concurrently Composable Security with Shielded Super-Polynomial Simulators

Brandon Broadnax, Nico Döttling, Gunnar Hartung +2 more

Lecture notes in computer science•Jan 1, 2017•18 citations

New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation

Shweta Agrawal, Vipul Goyal, Abhishek Jain +2 more

Lecture notes in computer science•Jan 1, 2012•19 citations