Universally composable security with local adversaries

DOI10.1007/978-3-642-32928-9_16zbMATH Open1296.94098OpenAlexW182972476MaRDI QIDQ2912802FDOQ2912802

Authors: Ran Canetti, Margarita Vald 

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32928-9_16

Recommendations

• Security and composition of multiparty cryptographic protocols
• Universally Composable Security with Global Setup
• General composition and universal composability in secure multiparty computation
• Publication:4502503
• Security against covert adversaries: Efficient protocols for realistic adversaries

Mathematics Subject Classification ID

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

Cited In (7)

• A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
• Algebraic adversaries in the universal composability framework
• Public randomness extraction with ephemeral roles and worst-case corruptions
• Adaptive hardness and composable security in the plain model from standard assumptions
• Universally composable incoercibility
• Rational sumchecks
• MPC with friends and foes

This page was built for publication: Universally composable security with local adversaries

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