Abstract
The Inner-Product Argument (IPA) is a subroutine of well-known zero-knowledge proof systems, such as Bulletproofs and Halo. These proof systems are then applied in large cryptographc protocols for anonymous and private transactions in the public blockchain. Despite its trustless nature and logarithmic communication efficiency, IPA suffers from low computational efficiency. While not specifically aimed at optimizing the IPA, Attema et al. propose the compressed \(\Sigma \)-protocol theory. Their intuition is simple: the prover provides an argument for a single committed vector to the verifier, whose commitment satisfies an arbitrary linear relation. We follow this intuition, but instead we provide an argument for two vectors committed under a single compact commitment, satisfying a linear form that is the inner-product relation. Hence, we propose the compressed \(\Sigma \)-protocol version of the original IPA, namely the compressed \(\Sigma \)-Inner-Product Argument (\(\Sigma \)-IPA). To this end, we prove security and provide a \(\Sigma \)-IPA that is complete and has soundness in standard DLOG setting. Finally, we conduct an efficiency analysis showing that our IPA reduces the computational complexity of prover and verifier algorithms by a factor of 2 compared to the original IPA.
This is a preview of subscription content, log in via an institution to check access.
References
Alonso, K.M., et al. Zero to monero (2020)
Attema, T.: Compressed\(\Sigma \)-protocol theory. PhD thesis, Leiden University (2023)
Attema, T., Cramer, R.: Compressed-protocol theory and practical application to plug & play secure algorithmics. In: Annual International Cryptology Conference, pp. 513–543. Springer (2020)
Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327–357. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49896-5_12
Bowe, S., Grigg, J., Hopwood, D.: Recursive proof composition without a trusted setup. Cryptology ePrint Archive (2019)
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
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)
Bünz, B., Chiesa, A., Mishra, P., Spooner, N.: Proof-carrying data from accumulation schemes. Cryptology ePrint Archive (2020)
Bünz, B., Maller, M., Mishra, P., Tyagi, N., Vesely, P.: Proofs for inner pairing products and applications. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 65–97. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-92078-4_3
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
Daza, V., Ràfols, C., Zacharakis, A.: Updateable inner product argument with logarithmic verifier and applications. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 527–557. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-45374-9_18
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
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
Jivanyan, A.: Lelantus: towards confidentiality and anonymity of blockchain transactions from standard assumptions. In: IACR Cryptol. ePrint Arch., p. 373 (2019)
Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 1–34. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-90453-1_1
Lindell: Parallel coin-tossing and constant-round secure two-party computation. J. Cryptol. 16(3), 143–184 (2003). https://doi.org/10.1007/s00145-002-0143-7
Scala, E., Dong, C., Corradini,F., Mostarda, L.: Zero-knowledge multi-transfer based on range proofs and homomorphic encryption. In: International Conference on Advanced Information Networking and Applications, pp. 461–472. Springer (2023)
Scala, E., Mostarda, L.: Range proofs with constant size and trustless setup. In: International Conference on Advanced Information Networking and Applications, pp. 301–310. Springer (2023)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Scala, E., Mostarda, L. (2024). Efficient Inner-Product Argument from Compressed \(\Sigma \)-Protocols and Applications. In: Barolli, L. (eds) Advanced Information Networking and Applications. AINA 2024. Lecture Notes on Data Engineering and Communications Technologies, vol 202. Springer, Cham. https://doi.org/10.1007/978-3-031-57916-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-031-57916-5_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-57915-8
Online ISBN: 978-3-031-57916-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)