A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness

DOI10.1007/978-3-540-74143-5_27MaRDI QIDQ3612566zbMATH OpenOpenAlexFDO

Authors Emmanuel Bresson, Laurent Mazaré, Bogdan Warinschi, Yassine Lakhnech

Publication date 10 March 2009

Published in Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74143-5_27

zbMATH Keywords

computational soundnessDiffie-Hellman assumptionsprotocol securityprovable security

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1951620
• Advances in Cryptology - EUROCRYPT 2004
• DDH-like assumptions based on extension rings
• scientific article; zbMATH DE number 2086715
• An algebraic framework for Diffie-Hellman assumptions

Cited in

(7)

• Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
• Moving the bar on computationally sound exclusive-or
• Automated analysis of cryptographic assumptions in generic group models
• Sound and complete computational interpretation of symbolic hashes in the standard model
• Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
• A survey of symbolic methods in computational analysis of cryptographic systems
• Capybara and Tsubaki: verifiable random functions from group actions and isogenies

This page was built for publication: A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness

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