Local Sequentiality Does Not Help for Concurrent Composition

DOI10.1007/978-3-642-00862-7_25zbMath1237.94073OpenAlexW1540703400MaRDI QIDQ3623059

Andrew Y. Lindell

Publication date: 29 April 2009

Published in: Topics in Cryptology – CT-RSA 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00862-7_25

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security and composition of multiparty cryptographic protocols
• Lower bounds and impossibility results for concurrent self composition
• Universally composable two-party and multi-party secure computation
• Bounded-concurrent secure multi-party computation with a dishonest majority
• New notions of security
• Bounded-concurrent secure two-party computation without setup assumptions
• Concurrent general composition of secure protocols in the timing model
• Nonmalleable Cryptography

This page was built for publication: Local Sequentiality Does Not Help for Concurrent Composition