This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|Authors||Dan Boneh , Riad S. Wahby , Sergey Gorbunov , Hoeteck Wee , Zhenfei Zhang|
|Last updated||2020-02-13 (Latest revision 2019-08-12)|
|RFC stream||Internet Research Task Force (IRTF)|
|Additional resources||Mailing list discussion|
|Send notices to||(None)|
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
BLS is a digital signature scheme with compression properties. With a given set of signatures (signature_1, ..., signature_n) anyone can produce a compressed signature signature_compressed. The same is true for a set of secret keys or public keys, while keeping the connection between sets (i.e., a compressed public key is associated to its compressed secret key). Furthermore, the BLS signature scheme is deterministic, non-malleable, and efficient. Its simplicity and cryptographic properties allows it to be useful in a variety of use- cases, specifically when minimal storage space or bandwidth are required.
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)