Dan Boneh, Ben Lynn, Craig Gentry, Hovav Shacham
An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into...
Short Signatures from the Weil Pairing (2008)
Dan Boneh, Ben Lynn, Hovav Shacham
We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. For standard security parameters, the signature length is...
Dan Boneh, Ben Lynn, Craig Gentry, Hovav Shacham
An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into...
Dan Boneh, Ben Lynn, Craig Gentry, Hovav Shacham
We survey two recent signature constructions that support signature aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into...
Efficient Algorithms for (2008)
Pairing-based Cryptosystems, Hae Y. Kim, Ben Lynn, Michael Scott, Escola Politécnica
Abstract. We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared...
We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. For standard security parameters, the signature length is...
Efficient Algorithms for (2008)
Pairing-based Cryptosystems, Hae Y. Kim, Ben Lynn, Michael Scott, Escola Politécnica
Abstract. We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared...
Short Signatures from the Weil Pairing * Dan Boneh # (2008)
Abstract We introduce a short signature scheme based on the Computational Diffie-Hellman assump-tion on certain elliptic and hyper-elliptic curves. For standard security parameters, the signature...
We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. For standard security parameters, the signature length is...
Dan Boneh, Ben Lynn, Craig Gentry, Hovav Shacham
An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into...
Aggregate and Veriably Encrypted Signatures from Bilinear Maps (2007)
Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham
An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into...
Ben Lynn, Michael Scott, Escola Politecnica
Abstract. We propose a simple algorithm to select group generators suitable for pairing-based cryptosystems. The selected parameters are shown to favor implementations of the Tate pairing that are at...
Aggregate and Veriably Encrypted Signatures from Bilinear Maps (2007)
Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham
An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into...
Dan Boneh, Ben Lynn, Craig Gentry, Hovav Shacham
An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into...
Authenticated identity-based encryption (2007)
Suppose Alice wishes to send a message to Bob using an identity-based encryption scheme (recall such a scheme is a public key cryptosystem where any string is a valid public key), but desires...
Ben Lynn, Michael Scott, Escola Politecnica
Abstract. We propose a simple algorithm to select group generators suitable for pairing-based cryptosystems. The selected parameters are shown to favor implementations of the Tate pairing that are at...
Efficient implementation of pairing-based cryptosystems (2004)
Ben Lynn, John Mitchell, Xavier Boyen
ii
On the selection of pairing-friendly groups (2004)
Abstract. We propose a simple algorithm to select group generators suitable for pairing-based cryptosystems. The selected parameters are shown to favor implementations of the Tate pairing that are at...
On the selection of pairing-friendly groups (2004)
Ben Lynn, Michael Scott, Escola Politécnica
Abstract. We propose a simple algorithm to select group generators suitable for pairing-based cryptosystems. The selected parameters are shown to favor implementations of the Tate pairing that are at...
A survey of two signature aggregation techniques (2003)
Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham
We survey two recent signature constructions that support signature aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into...
A Survey of Two Signature Aggregation Techniques (2003)
Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham
We survey two recent signature constructions that support signature aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into...
Aggregate and verifiably encrypted signatures from bilinear maps (2003)
Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham
Abstract. An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these...
In this paper we propose a new network layer security protocol that allows encrypted and authenticated communication between hosts. The new protocol has a number of advantages over existing...
Efficient algorithms for pairing-based cryptosystems (2002)
Hae Y. Kim, Ben Lynn, Michael Scott
Abstract. We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared...
Toward Hierarchical Identity-Based Encryption (2002)
We introduce the concept of hierarchical identity-based encryption (HIBE) schemes, give precise de nitions of their security and mention some applications. A two-level HIBE (2-HIBE) scheme consists...
Toward hierarchical identity-based encryption (2002)
Abstract. We introduce the concept of hierarchical identity-based encryption (HIBE) schemes, give precise definitions of their security and mention some applications. A two-level HIBE (2-HIBE) scheme...
Constructing elliptic curves with prescribed embedding degrees (2002)
Ben Lynn, Michael Scott, Escola Politécnica
Abstract. Pairing-based cryptosystems depend on the existence of groups where the Decision Diffie-Hellman problem is easy to solve, but the Computational Diffie-Hellman problem is hard. Such is the...
Short signatures from the Weil pairing (2001)
Dan Boneh, Ben Lynn, Hovav Shacham
Abstract. We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the size of a DSA...
Short signatures from the Weil pairing (2001)
Dan Boneh, Ben Lynn, Hovav Shacham
Abstract. We introduce a short signature scheme based on the Computational Die-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the size of a DSA...
Short Signatures from the Weil Pairing (2001)
Dan Boneh, Ben Lynn, Hovav Shacham
We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. For standard security parameters, the signature length is...
Short Signatures from the Weil Pairing (2001)
Dan Boneh, Ben Lynn, Hovav Shacham
We introduce a short signature scheme based on the Computational Die-Hellman assumption on certain elliptic and hyper-elliptic curves.