The Decision Diffie-Hellman problem
Dan Boneh · Lecture notes in computer science · 1998
Cited by 895 works. doi:10.1007/bfb0054851
Authors
References
- New directions in cryptography
- Probabilistic encryption
- How to construct random functions
- Factoring polynomials with rational coefficients
- Non-malleable cryptography
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Public-key cryptosystems provably secure against chosen ciphertext attacks
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
- Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
- Lower Bounds for Discrete Logarithms and Related Problems