Local Sequentiality Does Not Help for Concurrent Composition
From MaRDI portal
Recommendations
- Lower bounds and impossibility results for concurrent self composition
- Concurrent composition of secure protocols in the timing model
- Information-theoretically secure protocols and security under composition
- Theory of Cryptography
- General composition and universal composability in secure multiparty computation
Cites work
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 1304087 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 2009949 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Bounded-concurrent secure two-party computation without setup assumptions
- Concurrent general composition of secure protocols in the timing model
- Lower bounds and impossibility results for concurrent self composition
- New notions of security: achieving universal composability without trusted setup
- Nonmalleable Cryptography
- Security and composition of multiparty cryptographic protocols
- Universally composable two-party and multi-party secure computation
Cited in
(4)
This page was built for publication: Local Sequentiality Does Not Help for Concurrent Composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623059)