Skip to main content

ZeroMT: Multi-transfer Protocol for Enabling Privacy in Off-Chain Payments

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

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

Abstract

The privacy problem in public blockchains is a well-know challenge. Despite the robustness and decentralisation properties of the blockchain, transaction information remains visible to everyone in the network. Several proposals aim at solving these issues with advanced cryptographic techniques, such as zero-knowledge proofs, which turned out to be the best candidates. However, previous works are not aimed at off-chain sessions, which often end with a transfer that involves multiple payees, coming from a single payer or from more than one. With this paper, we introduce ZeroMT, a protocol for multiple confidential balance transfers that occur in a single transaction. With this novel approach, parties of an off-chain session gain privacy for their balances and transfer amounts. In addition, all transfers occur within a single transaction that benefits scalability, reducing the number of transactions to be validated in the main-chain. We provide the generic construction of a confidential multi-transfer transaction that can be assembled off-chain and verified by smart contract platforms. As a part of our protocol, we design the multi-transfer proof system by combining the aggregate version of Bulletproofs and an extended \(\Sigma \)-Protocol to \(n\) ciphertexts, generalising the Zether-\(\Sigma \)-Bullets protocol .

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.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

Similar content being viewed by others

Notes

  1. 1.

    The relation specifies a valid pair of instance-witnesses and the relative statements expressed in algebraic form for which the proof is constructed.

References

  1. Abdalla, M., An, J.H., Bellare, M., Namprempre, C.: From identification to signatures via the Fiat-Shamir transform: minimizing assumptions for security and forward-security. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 418–433. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-46035-7_28

    Chapter  Google Scholar 

  2. Alonso, K.M., et al.: Zero to Monero (2020)

    Google Scholar 

  3. Ben-Sasson, E., Chiesa, A., Green, M., Tromer, E., Virza, M.: Secure sampling of public parameters for succinct zero knowledge proofs. In: 2015 IEEE Symposium on Security and Privacy, pp. 287–304. IEEE (2015)

    Google Scholar 

  4. Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 31–60. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53644-5_2

    Chapter  Google Scholar 

  5. Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 329–349 (2019)

    Google Scholar 

  6. Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., Wu, H.: Zexe: enabling decentralized private computation. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 947–964. IEEE (2020)

    Google Scholar 

  7. 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 

  8. 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 

  9. Buterin, V., et al.: A next-generation smart contract and decentralized application platform (2014)

    Google Scholar 

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

    Google Scholar 

  11. Cacciagrano, D., Corradini, F., Mazzante, G., Mostarda, L., Sestili, D.: Off-chain execution of IoT smart contracts. In: Barolli, L., Woungang, I., Enokido, T. (eds.) AINA 2021. LNNS, vol. 226, pp. 608–619. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-75075-6_50

    Chapter  Google Scholar 

  12. Cacciagrano, D., Corradini, F., Mostarda, L.: Blockchain and IoT integration for society 5.0. In: Gerber, A., Hinkelmann, K. (eds.) Society 5.0 2021. CCIS, vol. 1477, pp. 1–12. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-86761-4_1

    Chapter  Google Scholar 

  13. 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 

  14. 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 

  15. 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 

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

  17. 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 

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

    Google Scholar 

  19. Noether, S., Mackenzie, A., et al.: Ring confidential transactions. Ledger 1, 1–18 (2016)

    Article  Google Scholar 

  20. 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 

  21. 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 

  22. Sekaran, R., Patan, R., Raveendran, A., Al-Turjman, F., Ramachandran, M., Mostarda, L.: Survival study on blockchain based 6G-enabled mobile edge computation for IoT automation. IEEE Access 8, 143453–143463 (2020)

    Article  Google Scholar 

Download references

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

© 2022 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

Corradini, F., Mostarda, L., Scala, E. (2022). ZeroMT: Multi-transfer Protocol for Enabling Privacy in Off-Chain Payments. In: Barolli, L., Hussain, F., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2022. Lecture Notes in Networks and Systems, vol 450. Springer, Cham. https://doi.org/10.1007/978-3-030-99587-4_52

Download citation

Publish with us

Policies and ethics