Idioma:

0

Nguyen, Quan Thoi Minh

arXiv.org, 2021-04

Texto completo disponível

Citações Citado por

Título:
0
Autor: Nguyen, Quan Thoi Minh
Assuntos: Computer Science - Cryptography and Security ; Cryptography
É parte de: arXiv.org, 2021-04
Descrição: What is the funniest number in cryptography? 0. The reason is that for all x, x*0 = 0, i.e., the equation is always satisfied no matter what x is. This article discusses crypto bugs in four BLS signatures' libraries (ethereum/py ecc, supranational/blst, herumi/bls, sigp/milagro bls) that revolve around 0. Furthermore, we develop "splitting zero" attacks to show a weakness in the proof-of-possession aggregate signature scheme standardized in BLS RFC draft v4. Eth2 bug bounties program generously awarded $35,000 in total for the reported bugs.
Editor: Ithaca: Cornell University Library, arXiv.org
Idioma: Inglês

Links

Voltar para lista de resultados