Automated unbounded analysis of cryptographic constructions in the generic group model

DOI10.1007/978-3-662-49896-5_29MaRDI QIDQ5739224zbMATH OpenOpenAlexFDO

Authors Miguel Ambrona, Gilles Barthe, Benedikt Schmidt

Publication date 15 July 2016

Published in Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49896-5_29

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Automated analysis of cryptographic assumptions in generic group models
• Automated analysis of cryptographic assumptions in generic group models
• On the Equivalence of Generic Group Models
• Automated Security Proofs with Sequences of Games
• Computer-aided cryptographic proofs

Cited in

(7)

• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
• Automated analysis of cryptographic assumptions in generic group models
• Automated analysis of cryptographic assumptions in generic group models
• A shuffle argument secure in the generic model
• On the security of functional encryption in the generic group model
• Local XOR unification: definitions, algorithms and application to cryptography
• Formal analysis of symbolic authenticity

This page was built for publication: Automated unbounded analysis of cryptographic constructions in the generic group model

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