Polynomial runtime and composability

DOI10.1007/S00145-012-9127-4MaRDI QIDQ2392095zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Dominique Unruh, Joern Mueller-Quade, Dennis Hofheinz

Publication date 1 August 2013

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-012-9127-4

zbMATH Keywords

universal composabilityprotocol compositionmulti-party protocolspolynomial runtime

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Recommendations

• Information Security
• General composition and universal composability in secure multiparty computation
• Security and composition of multiparty cryptographic protocols
• Long-term security and universal composability
• Theory of Cryptography

Cites work

• Analyzing security protocols using time-bounded task-PIOAs
• Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
• Coercion-resistant electronic elections
• Composition of secure multi-party protocols. A comprehensive study.
• Foundations of Cryptography
• Foundations of Cryptography
• GNUC: a new universal composability framework
• How to construct constant-round zero-knowledge proof systems for NP
• On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols

Cited in

(12)

• GNUC: a new universal composability framework
• Run-time type computations in the Warren Abstract machine
• scientific article; zbMATH DE number 63120 (Why is no real title available?)
• MoSS: modular security specifications framework
• The IITM model: a simple and expressive model for universal composability
• Universal composition with responsive environments
• Ideal key derivation and encryption in simulation-based security
• Embedding the UC model into the IITM model
• scientific article; zbMATH DE number 782052 (Why is no real title available?)
• Adaptive security of multi-party protocols, revisited
• On expected polynomial runtime in cryptography
• Self-correcting polynomial programs

Describes a project that uses

Uses Software

• GNUC

This page was built for publication: Polynomial runtime and composability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392095)