Adaptive versus Static Security in the UC Model

DOI10.1007/978-3-319-12475-9_2MaRDI QIDQ2948135zbMATH OpenOpenAlexFDO

Authors Jesper Buus Nielsen, Ivan B. Damgård

Publication date 29 September 2015

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12475-9_2

zbMATH Keywords

universal composition (UC) framework

Mathematics Subject Classification ID

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

Recommendations

• Adaptive versus non-adaptive security of multi-party protocols
• On the (Non-)Equivalence of UC Security Notions
• On adaptively secure protocols
• scientific article; zbMATH DE number 1722683

Cited in

(9)

• YOSO: You only speak once. Secure MPC with stateless ephemeral roles
• Probabilistic termination and composability of cryptographic protocols
• Probabilistic Termination and Composability of Cryptographic Protocols
• Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
• Efficient perfectly secure computation with optimal resilience
• Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW
• Threshold-optimal MPC with friends and foes
• Peeking into the future: MPC resilient to super-rushing adversaries
• Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph

This page was built for publication: Adaptive versus Static Security in the UC Model

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