Secure composition of cryptographic protocols. (Abstract)

DOI10.1007/978-3-642-24316-5_2MaRDI QIDQ3092344zbMATH OpenOpenAlexFDO

Authors Vipul Goyal

Publication date 16 September 2011

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24316-5_2

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• General composition and universal composability in secure multiparty computation
• Information-theoretically secure protocols and security under composition
• Concurrent composition of secure protocols in the timing model
• Protocols for bounded-concurrent secure two-party computation in the plain model
• Security and composition of multiparty cryptographic protocols

Cited in

(15)

• Concurrent general composition of secure protocols in the timing model
• Secure composition of protocols
• scientific article; zbMATH DE number 5225572 (Why is no real title available?)
• Techniques for Efficient Secure Computation Based on Yao’s Protocol
• scientific article; zbMATH DE number 1955805 (Why is no real title available?)
• Concurrent security and non-malleability
• Information-theoretically secure protocols and security under composition
• Composition Implies Adaptive Security in Minicrypt
• Probabilistic Termination and Composability of Cryptographic Protocols
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Deciding the security of protocols with commuting public key encryption
• Resource fairness and composability of cryptographic protocols
• Progress in Cryptology - INDOCRYPT 2004
• Concurrent composition of secure protocols in the timing model
• Information-theoretically secure protocols and security under composition

This page was built for publication: Secure composition of cryptographic protocols. (Abstract)

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