## Short signatures from the Weil pairing (2001)

### Cached

### Download Links

- [www.iacr.org]
- [www.stanford.edu]
- [crypto.stanford.edu]
- [crypto.stanford.edu]
- [theory.stanford.edu]
- [rooster.stanford.edu]
- DBLP

### Other Repositories/Bibliography

by
Dan Boneh
,
Ben Lynn
,
Hovav Shacham

Citations: | 559 - 29 self |

### BibTeX

@INPROCEEDINGS{Boneh01shortsignatures,

author = {Dan Boneh and Ben Lynn and Hovav Shacham},

title = {Short signatures from the Weil pairing},

booktitle = {},

year = {2001},

pages = {514--532},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

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 signature for a similar level of security. Our short signature scheme is designed for systems where signatures are typed in by a human or signatures are sent over a low-bandwidth channel. 1