Pseudo-random functions and factoring (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Provably authenticated group Diffie-Hellman key exchange
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
The Group Diffie-Hellman Problems
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Oblivious signature-based envelope
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
On the complexity of the discrete logarithm and Diffie-Hellman problems
Journal of Complexity - Special issue on coding and cryptography
Non-automatizability of bounded-depth frege proofs
Computational Complexity
Oblivious signature-based envelope
Distributed Computing
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.89 |