Abstract
Ring signature, introduced by Rivest, allows the signer to make valid signatures without the knowledge of the signer. But unconditional anonymity also protects malicious users, so that the reputation of the group can be affected. Lin et al. proposed a rejectable signature scheme, which solved this problem well, but it has a drawback of increasing the signature’s size with the number of ring members. To address the problem, a new scheme is proposed in combination with the existing short associated ring signature scheme. This proposed scheme utilizes a dynamic accumulator to accumulate public keys and knowledge signatures for rapid identity verification without revealing one’s private key or identity. By doing so, in our scheme we can maintain a constant signature length and minimize the signature overhead. Additionally, in this paper we prove that the resulting signature is both unforgeable and anonymous while also being able to repudiate. Furthermore, related experiments are conducted to demonstrate the effectiveness of this approach. Experimental results show reduced time overhead and shorter signal length compared to theoretical calculations, reinforcing the feasibility of our scheme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552–565. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45682-1_32
Noether, S.: Ring signature confidential transactions for monero. IACR Cryptol. ePrint Arch., p. 1098 (2015)
Xu, X., Dong, X., Li, X., He, G., Xu, S.: Patient-friendly medical data security sharing scheme based on blockchain and proxy re-encryption. In: Zhao, X., Yang, S., Wang, X., Li, J. (eds.) Web Information Systems and Applications. WISA 2022. LNCS, vol. 13579, pp. 615–626. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-20309-1_54
Zeng, S., Jiang, S.: A new framework for conditionally anonymous ring signature. Comput. J. 57(4), 567–578 (2014)
Komano, Y., Ohta, K., Shimbo, A., Kawamura, S.: Toward the fair anonymous signatures: deniable ring signatures. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1), 54–64 (2007)
Park, S., Sealfon, A.: It wasn’t me! - repudiability and claimability of ring signatures. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology – CRYPTO 2019. LNCS, vol. 11694, pp. 159–190. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-26954-8_6
Lin, H., Wang, M.: Repudiable ring signature: stronger security and logarithmic-size. Comput. Stand. Interfaces 80, 103562 (2022)
Jiechang, W., Yuling, L., Ping, Z., Muhua, L., Jie, L.: Short linkable-and-redactable ring signature and its blockchain correcting application. J. Beijing Univ. Aeron. Astron 48 (2022)
Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410–424. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0052252
Liu, J.K., Wei, V.K., Wong, D.S.: Linkable spontaneous anonymous group signature for Ad Hoc groups. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 325–335. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27800-9_28
Tsang, P.P., Wei, V.K.: Short linkable ring signatures for e-voting, e-cash and attestation. In: Deng, R.H., Bao, F., Pang, H.H., Zhou, J. (eds.) ISPEC 2005. LNCS, vol. 3439, pp. 48–60. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31979-5_5
Au, M.H., Chow, S.S.M., Susilo, W., Tsang, P.P.: Short linkable ring signatures revisited. In: Atzeni, A.S., Lioy, A. (eds.) EuroPKI 2006. LNCS, vol. 4043, pp. 101–115. Springer, Heidelberg (2006). https://doi.org/10.1007/11774716_9
Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361–396 (2000)
Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: FOCS’99, pp. 120–130. IEEE Computer Society (1999). https://doi.org/10.1109/SFFCS.1999.814584
Okamoto, T., Pietrzak, K., Waters, B., Wichs, D.: New realizations of somewhere statistically binding hashing and positional accumulators. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 121–145. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48797-6_6
Acknowledgement
This work is supported by the Major projects of National Social Science Foundation of China (No. 21 &ZD124): research on community home care model and quality safety System based on blockchain. We also thank anonymous reviewers for the helpful reports.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wen, Z., Dong, X., Yang, C., Zhang, N. (2023). Short Repudiable Ring Signature: Constant Size and Less Overhead. In: Yuan, L., Yang, S., Li, R., Kanoulas, E., Zhao, X. (eds) Web Information Systems and Applications. WISA 2023. Lecture Notes in Computer Science, vol 14094. Springer, Singapore. https://doi.org/10.1007/978-981-99-6222-8_31
Download citation
DOI: https://doi.org/10.1007/978-981-99-6222-8_31
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-6221-1
Online ISBN: 978-981-99-6222-8
eBook Packages: Computer ScienceComputer Science (R0)
