Estudo preliminar da adoção de assinaturas baseadas em hash no blockchain do Bitcoin

• Antônio Unias de Lucena Unicamp
• Marco Aurélio Amaral Henriques Unicamp

DOI: https://doi.org/10.5753/sbseg.2018.4271

Abstract

A quantum computer with high processing capacity will break the digital signatures used by the main blockchains. This work brings a preliminary study on the adoption of hash-based signatures in the Bitcoin’s blockchain in order to make it resistant to quantum computers. Our study describes which features need to be changed and their impacts. The major impact is on the digital signature size, leading to a bigger transaction and lowering the number of transactions per block. The solutions to such a problem can be to increase the block size, reduce the size of hash-based signatures and/or adopt post-quantum algorithms with smaller digital signatures.

References

Aumasson, J. P., & Endignoux, G. (2018, April). Improving stateless hash-based signatures. In Cryptographers’ Track at the RSA Conference (pp. 219-242). Springer, Cham.

Bernstein, D. J., Dobraunig, C., Eichlseder, M., Fluhrer, S., Gazdag, S., Hülsing, A., Kampanakis, P., Kölbl, S., Lange, T., Lauridsen, M.M., Mendel, F., ... (2017, November). SPHINCS+ - Submission to the NIST post-quantum project [link] (acesso: 04/07/2018).

Bernstein, D. J., Hopwood, D., Hülsing, A., Lange, T., Niederhagen, R., ... & Wilcox- O’Hearn, Z. (2015, April). SPHINCS: practical stateless hash-based signatures. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 368-397). Springer, Berlin, Heidelberg.

BitcoinCash (2018). [link] (acesso: 04/09/2018).

Buchmann, J., Dahmen, E., & Hülsing, A. (2011, November). XMSS-a practical forward secure signature scheme based on minimal security assumptions. In International Workshop on Post-Quantum Cryptography (pp. 117-129). Springer, Berlin, Heidelberg.

Cryptopp (2018). [link] (acesso 11/09/2018).

Grover, L. K. (1996, July). A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (pp. 212-219). ACM.

Hoffstein, J., Pipher, J., & Silverman, J. H. (1998, June). NTRU: A ring-based public key cryptosystem. In International Algorithmic Number Theory Symposium (pp. 267-288). Springer, Berlin, Heidelberg.

Hülsing, A., (2013, June). W-OTS+–shorter signatures for hash-based signature schemes. In International Conference on Cryptology in Africa (pp. 173-188). Springer, Berlin, Heidelberg.

Lamport, L. (1979). Constructing digital signatures from a one-way function (Vol. 238). Palo Alto: Technical Report CSL-98, SRI International.

Merkle, R. C. (1979). Secrecy, authentication, and public key systems, ph.D. thesis, Electrical Engineering, Stanford.

Merkle, R. C. (1980, April). Protocols for public key cryptosystems. In Security and Privacy, 1980 IEEE Symposium on (pp. 122-122). IEEE.

Nakamoto, S. (2008). Bitcoin: A peer-to-peer electronic cash system. [link] (acesso: 01/09/2018).

Post-Quantum Cryptography Standardization (2018). [link] (acesso: 06/09/2018).

Reyzin, L., & Reyzin, N. (2002, July). Better than BiBa: Short one-time signatures with fast signing and verifying. In Australasian Conference on Information Security and Privacy (pp. 144-153). Springer, Berlin, Heidelberg.

Shor, P. W. (1994, November). Algorithms for quantum computation: Discrete logarithms and factoring. In Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on (pp. 124-134). Ieee.