On the (Non-)Equivalence of UC Security Notions

DOI10.1007/978-3-642-33272-2_8zbMATH Open1303.94108OpenAlexW193924916MaRDI QIDQ5200576

Oana Ciobotaru

Publication date: 6 November 2012

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33272-2_8

zbMATH Keywords

game theorysecurity modelstime-lock puzzlesUC security

Mathematics Subject Classification ID

Game theory (91A99) Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Adaptive versus Static Security in the UC Model ⋮ Relationship of Three Cryptographic Channels in the UC Framework

Recommendations

• On the semantics of Alice \& Bob specifications of security protocols 👍 👎
• Security definitions for hash functions: combining UCE and indifferentiability 👍 👎
• A decidable class of security protocols for both reachability and equivalence properties 👍 👎
• The Hitchhiker's guide to decidability and complexity of equivalence properties in security protocols 👍 👎
• A new approach for UC security concurrent deniable authentication 👍 👎
• Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes 👍 👎
• All-But-Many Encryption 👍 👎
• On the power of nonuniformity in proofs of security 👍 👎
• Equivalence of Uniform Key Agreement and Composition Insecurity 👍 👎
• Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks 👍 👎

This page was built for publication: On the (Non-)Equivalence of UC Security Notions

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