Ben Lynn

According to our database, Ben Lynn authored at least 10 papers between 2001 and 2007.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2007

On the implementation of pairing-based cryptosystems.

Ben Lynn

PhD thesis, 2007

2004

Efficient Implementation of Pairing-Based Cryptosystems.

Paulo S. L. M. Barreto, Ben Lynn, Michael Scott

J. Cryptol., 2004

Positive Results and Techniques for Obfuscation.

Ben Lynn, Manoj Prabhakaran, Amit Sahai

Proceedings of the Advances in Cryptology, 2004

2003

On the Selection of Pairing-Friendly Groups.

Paulo S. L. M. Barreto, Ben Lynn, Michael Scott

Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

Aggregate and Verifiably Encrypted Signatures from Bilinear Maps.

Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham

Proceedings of the Advances in Cryptology, 2003

2002

Authenticated Identity-Based Encryption.

Ben Lynn

IACR Cryptol. ePrint Arch., 2002

Constructing Elliptic Curves with Prescribed Embedding Degrees.

Paulo S. L. M. Barreto, Ben Lynn, Michael Scott

Proceedings of the Security in Communication Networks, Third International Conference, 2002

Toward Hierarchical Identity-Based Encryption.

Jeremy Horwitz, Ben Lynn

Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Efficient Algorithms for Pairing-Based Cryptosystems.

Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott

Proceedings of the Advances in Cryptology, 2002

2001

Short Signatures from the Weil Pairing.

Dan Boneh, Ben Lynn, Hovav Shacham

Proceedings of the Advances in Cryptology, 2001