Local Sequentiality Does Not Help for Concurrent Composition
type: Item
instance of: scholarly article
title: Local Sequentiality Does Not Help for Concurrent Composition
zbMATH Open document ID: 1237.94073
DOI: 10.1007/978-3-642-00862-7_25
author: Andrew Y. Lindell
published in: Topics in Cryptology – CT-RSA 2009
publication date: 2009-04-29T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 5549173
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-00862-7 25
OpenAlex ID: W1540703400
cites work: Q4035733
cites work: Security and composition of multiparty cryptographic protocols
cites work: Q4783717
cites work: Q4434869
cites work: Universally composable two-party and multi-party secure computation
cites work: Nonmalleable Cryptography
cites work: Q4542559
cites work: Q4279565
cites work: Concurrent general composition of secure protocols in the timing model
cites work: Bounded-concurrent secure two-party computation without setup assumptions
cites work: Lower bounds and impossibility results for concurrent self composition
cites work: Q4434874
cites work: Bounded-concurrent secure multi-party computation with a dishonest majority
cites work: New notions of security: achieving universal composability without trusted setup
cites work: Q4250778
Recommended article: Lower bounds and impossibility results for concurrent self composition
Recommended article: Concurrent composition of secure protocols in the timing model
Recommended article: Information-theoretically secure protocols and security under composition
Recommended article: Theory of Cryptography
Recommended article: General composition and universal composability in secure multiparty computation
description: scientific article; zbMATH DE number 5549173