Skip to main content

Zero-Knowledge Multi-transfer Based on Range Proofs and Homomorphic Encryption

  • Conference paper
  • First Online:
Advanced Information Networking and Applications (AINA 2023)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 654))

Abstract

Zero-knowledge proofs are widely adopted in Confidential Transactions (CTs). In particular, with these proofs, it is possible to prove the validity of transactions without revealing sensitive information. This has become an attractive property in public blockchain where transactions must be publicly verifiable. However, several challenges must be addressed in order not to alter important properties of the blockchain, such as not introducing trusted third parties and/or circuit-dependent trusted setups. Moreover, there are limited proposals working on the standard account model and considering extended payment models where multiple payees are involved in one transaction. With this paper, we first present our concept of Multi-Transfer (MT) in CTs settings, i.e., a transfer that involves multiple payees in a single transaction with privacy guarantees for balances and transfer amounts. Inspired by the work of Zether, we design the MT zero-knowledge proof system, named MTproof, by combining the aggregate version of Bulletproofs and several \(\Sigma \)-Protocols to prove that an MT transaction is legit. We provide concrete evaluations of the MTproof in terms of proof size, prover and verifier execution time.

This work was supported by HD3FLAB project the Nationally funded by POR MARCHE FESR.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 229.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 299.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alonso, K.M., et al.: Zero to monero (2020)

    Google Scholar 

  2. arkworks rs. arkworks

    Google Scholar 

  3. Bünz, B., Agrawal, S., Zamani, M., Boneh, D.: Zether: towards privacy in a smart contract world. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 423–443. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-51280-4_23

    Chapter  Google Scholar 

  4. Bünz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 315–334. IEEE (2018)

    Google Scholar 

  5. Buterin, V., et al.: A next-generation smart contract and decentralized application platform

    Google Scholar 

  6. Butler, D., Aspinall, D., Gascón, A.: On the formalisation of \(\sigma \)-protocols and commitment schemes. In: POST, pp. 175–196 (2019)

    Google Scholar 

  7. Chan, W., Olmsted, A.: Ethereum transaction graph analysis. In: 2017 12th International Conference for Internet Technology and Secured Transactions (ICITST), pp. 498–500. IEEE (2017)

    Google Scholar 

  8. Corradini, F., Mostarda, L., Scala, E.: ZeroMT: multi-transfer protocol for enabling privacy in off-chain payments. In: Barolli, L., Hussain, F., Enokido, T. (eds.) AINA 2022. LNNS, vol. 450, pp. 611–623. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-99587-4_52

    Chapter  Google Scholar 

  9. Diamond, B.E.: Many-out-of-many proofs and applications to anonymous zether. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 1800–1817. IEEE (2021)

    Google Scholar 

  10. EmanueleSc. Zeromt

    Google Scholar 

  11. Fauzi, P., Meiklejohn, S., Mercer, R., Orlandi, C.: Quisquis: a new design for anonymous cryptocurrencies. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 649–678. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-34578-5_23

    Chapter  Google Scholar 

  12. Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-47721-7_12

    Chapter  Google Scholar 

  13. Fleder, M., Kester, M.S., Pillai, S.: Bitcoin transaction graph analysis. arXiv preprint arXiv:1502.01657 (2015)

  14. Guan, Z., Wan, Z., Yang, Y., Zhou, Y., Huang, B.: Blockmaze: an efficient privacy-preserving account-model blockchain based on zk-snarks. IEEE Trans. Dependable Secure Comput. (2020)

    Google Scholar 

  15. Jivanyan, A.: Lelantus: towards confidentiality and anonymity of blockchain transactions from standard assumptions. IACR Cryptol. ePrint Arch. 2019, 373 (2019)

    Google Scholar 

  16. Mehmood, N.Q., Culmone, R., Mostarda, L.: Modeling temporal aspects of sensor data for MongoDB NoSQL database. J. Big Data 4(1) (2017)

    Google Scholar 

  17. Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Technical report, Manubot (2019)

    Google Scholar 

  18. Poelstra, A.: Mimblewimble (2016)

    Google Scholar 

  19. Ron, D., Shamir, A.: Quantitative analysis of the full bitcoin transaction graph. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 6–24. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39884-1_2

    Chapter  Google Scholar 

  20. Rondelet, A., Zajac, M.: Zeth: on integrating zerocash on ethereum. arXiv preprint arXiv:1904.00905 (2019)

  21. Russello, G., Mostarda, L., Dulay, N.: A policy-based publish/subscribe middleware for sense-and-react applications. J. Syst. Softw. 84(4), 638–654 (2011)

    Article  Google Scholar 

  22. Sasson, E.B., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459–474. IEEE (2014)

    Google Scholar 

  23. Vannucchi, C., et al.: Symbolic verification of event–condition–action rules in intelligent environments. J. Reliable Intell. Environ. 3(2), 117–130 (2017)

    Article  Google Scholar 

Download references

Acknowledgment

We acknowledge the master student Francesco Pio Stelluti for his contribution to the codebase of MTproof.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Emanuele Scala .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Scala, E., Dong, C., Corradini, F., Mostarda, L. (2023). Zero-Knowledge Multi-transfer Based on Range Proofs and Homomorphic Encryption. In: Barolli, L. (eds) Advanced Information Networking and Applications. AINA 2023. Lecture Notes in Networks and Systems, vol 654. Springer, Cham. https://doi.org/10.1007/978-3-031-28451-9_41

Download citation

Publish with us

Policies and ethics