Digital signatures;
Short signatures;
Elliptic curves;
Pairings;
Bilinear maps;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
We introduce a short signature scheme based on the Computational
Diffie–Hellman assumption on certain elliptic and hyperelliptic
curves. For standard security parameters, the signature length is
about half that of a DSA signature with a similar level of security. Our
short signature scheme is designed for systems where signatures are
typed in by a human or are sent over a low-bandwidth channel. We
survey a number of properties of our signature scheme such as
signature aggregation and batch verification.