Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems

DOI10.1007/978-3-540-89255-7_30zbMath1184.94244OpenAlexW1848025830MaRDI QIDQ3600393

Endre Bangerter, Andy Rupp, Ahmad-Reza Sadeghi, Gregor Leander, Alexander W. Dent

Publication date: 10 February 2009

Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_30

zbMATH Keywords

lower boundsstraight-line programsgeneric group modelhardness conditions

Mathematics Subject Classification ID

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

Related Items (5)

On the analysis of cryptographic assumptions in the generic ring model ⋮ On tight security proofs for Schnorr signatures ⋮ A Signature Scheme with Efficient Proof of Validity ⋮ Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems ⋮ Everybody's a target: scalability in public-key encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of a determinate algorithm for the discrete logarithm
• Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
• A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• Advances in Cryptology - EUROCRYPT 2004
• Hierarchical Identity Based Encryption with Constant Size Ciphertext

This page was built for publication: Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems