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

DOI10.1007/978-3-540-74143-5_27zbMath1215.94033OpenAlexW2114486737MaRDI QIDQ3612566

Laurent Mazaré, Emmanuel Bresson, Bogdan Warinschi, Yassine Lakhneche

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

provable securityprotocol securityDiffie-Hellman assumptionscomputational soundness

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems

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