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

Lecture notes in computer science

Local Sequentiality Does Not Help for Concurrent Composition

Andrew Y. Lindell

Published Jan 1, 2009• 0 citations
Publisher
DOI
10.1007/978-3-642-00862-7_25

Related papers

Lower Bounds for Concurrent Self Composition

Yehuda Lindell

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

What Information Is Leaked under Concurrent Composition?

Vipul Goyal, Divya Gupta, Abhishek Jain

Lecture notes in computer science•Jan 1, 2013•11 citations

Lower Bounds and Impossibility Results for Concurrent Self Composition

Yehuda Lindell

Journal of Cryptology•Sep 27, 2007•38 citations

Simulatable Security and Polynomially Bounded Concurrent Composition.

Dennis Hofheinz, Dominique Unruh

•Jan 1, 2006•2 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

On Sequential Composition of Precise Zero-Knowledge

丁宁, 谷大武

上海交通大学学报:英文版•Jan 1, 2010•0 citations