# Search results for: David Jao

IEEE Transactions on Dependable and Secure Computing > 2017 > 14 > 6 > 605 - 619

IEEE Transactions on Circuits and Systems I: Regular Papers > 2017 > 64 > 1 > 86 - 99

*holistic*approach to security must be taken...

Lecture Notes in Computer Science > Advances in Cryptology - ASIACRYPT 2005 > Algebra and Number Theory > 21-40

Lecture Notes in Computer Science > Pairing-Based Cryptography – Pairing 2008 > Implementation of Pairings > 243-264

Lecture Notes in Computer Science > Progress in Cryptology - INDOCRYPT 2009 > Key Agreement Protocols > 57-71

Lecture Notes in Computer Science > Stochastic Algorithms: Foundations and Applications > Contributed Papers > 105-117

*D*such as

*D*= {0,1, − 1} require...

Lecture Notes in Computer Science > Selected Areas in Cryptography > Elliptic and Hyperelliptic Curve Arithmetic > 18-34

Lecture Notes in Computer Science > Pairing-Based Cryptography – Pairing 2009 > Signature Security > 1-16

*q*-Strong Diffie-Hellman assumption. In this paper, we prove the converse of this statement, and show that forging Boneh-Boyen signatures is actually equivalent to solving the

*q*-Strong Diffie-Hellman problem. Using this equivalence, we exhibit an algorithm which, on the...

Lecture Notes in Computer Science > Progress in Cryptology – INDOCRYPT 2007 > Elliptic Curve > 33-47

IEEE Transactions on Information Theory > 2015 > 61 > 5 > 2357 - 2369

Journal of Number Theory > 2009 > 129 > 6 > 1491-1504

Journal of Number Theory > 2005 > 113 > 2 > 208-225