Universally composable security with local adversaries

DOI10.1007/978-3-642-32928-9_16MaRDI QIDQ2912802zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

• Security and composition of multiparty cryptographic protocols
• Universally Composable Security with Global Setup
• General composition and universal composability in secure multiparty computation
• scientific article; zbMATH DE number 1504552
• Security against covert adversaries: Efficient protocols for realistic adversaries

Cited in

(7)

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

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)