Perspectivas em BLS e DKG para Consenso Anti-MEV na Blockchain Neo
Resumo
Este artigo de comunicação de pesquisa apresenta os avanços recentes em um consenso resistente ao Valor Extraível Máximo (MEV) inspirado no Neo dBFT, aprimorado com as primitivas de criptografia Boneh-Lynn-Shacham (BLS) e Geração Distribuída de Chaves (DKG), também exigindo uma fase extra no dBFT. Esta combinação de segredos compartilhados com técnicas de criptografia fornece propriedades únicas em relação às conhecidas assinaturas de limiar, que são usadas para a descriptografia de transações de blockchain anônimas. Isso representa uma melhoria em relação ao consenso existente para o blockchain público Neo, contribuindo também para a introdução de um mecanismo descentralizado capaz de gerar números aleatórios verificáveis e determinísticos em contratos inteligentes, outra característica importante para aplicativos descentralizados de blockchain (DApps).Referências
Abraham, I., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G., and Tomescu, A. (2021).
Reaching consensus for asynchronous distributed key generation. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 363–373.
Aublin, P., Mokhtar, S. B., and Quéma, V. (2013). Rbft: Redundant byzantine fault tolerance. In 2013 IEEE 33rd International Conference on Distributed Computing Systems, pages 297–306.
Boneh, D., Lynn, B., and Shacham, H. (2001). Short signatures from the weil pairing. In Boyd, C., editor, Advances in Cryptology — ASIACRYPT 2001, pages 514–532, Berlin, Heidelberg. Springer Berlin Heidelberg.
Boneh, D., Lynn, B., and Shacham, H. (2004). Short signatures from the weil pairing. Journal of Cryptology, 17(4):297–319.
Bowe, S., Chiesa, A., Green, M., Jain, A., Miers, I., and Tromer, E. (2020). Scalable multi-signatures for blockchain applications. In Proceedings of the ACM Conf. on Computer and Communications Security.
Castro, M. and Liskov, B. (1999). Practical byzantine fault tolerance. In OSDI, volume 99, pages 173–186.
Coelho, I. M., Coelho, V. N., Araujo, R. P., Yong Qiang, W., and Rhodes, B. D. (2020). Challenges of pbft-inspired consensus for blockchain and enhancements over neo dbft. Future Internet, 12(8).
Das, S. and Ren, L. (2023). Adaptively secure bls threshold signatures from ddh and co-cdh. Cryptology ePrint Archive, Paper 2023/1553. [link].
Frankel, Y., MacKenzie, P. D., and Yung, M. (1998). Robust efficient distributed rsakey generation. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 663–672.
Hongfei, Da and Zhang, Erik (2015). Neo: A distributed network for the smart economy. Technical report, NEO Foundation.
Judmayer, A., Stifter, N., Schindler, P., and Weippl, E. (2023). Estimating (miner) extractable value is hard, let’s go shopping! In Matsuo, S., Gudgeon, L., Klages-Mundt, A., Perez Hernandez, D., Werner, S., Haines, T., Essex, A., Bracciali, A., and Sala, M., editors, Financial Cryptography and Data Security. FC 2022 International Workshops, pages 74–92, Cham. Springer International Publishing.
Kate, A. and Goldberg, I. (2009). Distributed key generation for the internet. In 2009 29th IEEE International Conference on Distributed Computing Systems, pages 119–128.
Lamport, L., Shostak, R., and Pease, M. (1982). The byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382–401.
Malkhi, D. and Szalachowski, P. (2022). Maximal extractable value (mev) protection on a dag. arXiv preprint arXiv:2208.00940.
Micali, S., Rabin, M., and Vadhan, S. (1999). Verifiable random functions. In 40th annual symposium on foundations of computer science (cat. No. 99CB37039), pages 120–130. IEEE.
Nakamoto, S. (2008). Bitcoin: A peer-to-peer electronic cash system. Accessed on February 06, 2024.
Pedersen, T. P. (1991). A threshold cryptosystem without a trusted party. In Proceedings of the EUROCRYPT ’91, volume 547 of Lecture Notes in Computer Science.
Qin, K., Zhou, L., and Gervais, A. (2022). Quantifying blockchain extractable value: How dark is the forest? In 2022 IEEE Symposium on Security and Privacy (SP), pages 198–214. IEEE.
Sguanci, C., Spatafora, R., and Vergani, A. M. (2021). Layer 2 blockchain scaling: A survey. arXiv preprint arXiv:2107.10881.
Tanwar, S. (2022). Basics of cryptographic primitives for blockchain development. In Blockchain Technology: Theory to Practice. Springer.
Reaching consensus for asynchronous distributed key generation. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 363–373.
Aublin, P., Mokhtar, S. B., and Quéma, V. (2013). Rbft: Redundant byzantine fault tolerance. In 2013 IEEE 33rd International Conference on Distributed Computing Systems, pages 297–306.
Boneh, D., Lynn, B., and Shacham, H. (2001). Short signatures from the weil pairing. In Boyd, C., editor, Advances in Cryptology — ASIACRYPT 2001, pages 514–532, Berlin, Heidelberg. Springer Berlin Heidelberg.
Boneh, D., Lynn, B., and Shacham, H. (2004). Short signatures from the weil pairing. Journal of Cryptology, 17(4):297–319.
Bowe, S., Chiesa, A., Green, M., Jain, A., Miers, I., and Tromer, E. (2020). Scalable multi-signatures for blockchain applications. In Proceedings of the ACM Conf. on Computer and Communications Security.
Castro, M. and Liskov, B. (1999). Practical byzantine fault tolerance. In OSDI, volume 99, pages 173–186.
Coelho, I. M., Coelho, V. N., Araujo, R. P., Yong Qiang, W., and Rhodes, B. D. (2020). Challenges of pbft-inspired consensus for blockchain and enhancements over neo dbft. Future Internet, 12(8).
Das, S. and Ren, L. (2023). Adaptively secure bls threshold signatures from ddh and co-cdh. Cryptology ePrint Archive, Paper 2023/1553. [link].
Frankel, Y., MacKenzie, P. D., and Yung, M. (1998). Robust efficient distributed rsakey generation. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 663–672.
Hongfei, Da and Zhang, Erik (2015). Neo: A distributed network for the smart economy. Technical report, NEO Foundation.
Judmayer, A., Stifter, N., Schindler, P., and Weippl, E. (2023). Estimating (miner) extractable value is hard, let’s go shopping! In Matsuo, S., Gudgeon, L., Klages-Mundt, A., Perez Hernandez, D., Werner, S., Haines, T., Essex, A., Bracciali, A., and Sala, M., editors, Financial Cryptography and Data Security. FC 2022 International Workshops, pages 74–92, Cham. Springer International Publishing.
Kate, A. and Goldberg, I. (2009). Distributed key generation for the internet. In 2009 29th IEEE International Conference on Distributed Computing Systems, pages 119–128.
Lamport, L., Shostak, R., and Pease, M. (1982). The byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382–401.
Malkhi, D. and Szalachowski, P. (2022). Maximal extractable value (mev) protection on a dag. arXiv preprint arXiv:2208.00940.
Micali, S., Rabin, M., and Vadhan, S. (1999). Verifiable random functions. In 40th annual symposium on foundations of computer science (cat. No. 99CB37039), pages 120–130. IEEE.
Nakamoto, S. (2008). Bitcoin: A peer-to-peer electronic cash system. Accessed on February 06, 2024.
Pedersen, T. P. (1991). A threshold cryptosystem without a trusted party. In Proceedings of the EUROCRYPT ’91, volume 547 of Lecture Notes in Computer Science.
Qin, K., Zhou, L., and Gervais, A. (2022). Quantifying blockchain extractable value: How dark is the forest? In 2022 IEEE Symposium on Security and Privacy (SP), pages 198–214. IEEE.
Sguanci, C., Spatafora, R., and Vergani, A. M. (2021). Layer 2 blockchain scaling: A survey. arXiv preprint arXiv:2107.10881.
Tanwar, S. (2022). Basics of cryptographic primitives for blockchain development. In Blockchain Technology: Theory to Practice. Springer.
Publicado
21/07/2024
Como Citar
COELHO, Igor M.; HU, Shili; LIU, Mengyu; QIANG, Wang Yong; DA, Hongfei; COELHO, Vitor N..
Perspectivas em BLS e DKG para Consenso Anti-MEV na Blockchain Neo. In: COLÓQUIO EM BLOCKCHAIN E WEB DESCENTRALIZADA (CBLOCKCHAIN), 2. , 2024, Brasília/DF.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2024
.
p. 56-61.
DOI: https://doi.org/10.5753/cblockchain.2024.3179.
