Abstract
McEliece cryptosystem is a public key cryptosystem that combines channel coding and encryption, and the oldest PKC that is conjectured to be post-quantum secure. To decrease the key size of the original scheme, alternative codes have been adopted to replace Goppa codes. In this paper, we propose a ring signature using low-density generator-matrix codes. Our new scheme satisfies anonymity and existential unforgeability under chosen message attacks (EUF-CMA). As for efficiency, the number of decoding operations has been reduced largely compared with ZLC ring signature, and the size of the public key is about 0.2 % of the ZLC scheme.
This work is supported by National Natural Science Foundation of China (61572521, 61103231, 61272492), Project funded by China Postdoctoral Science Foundation (2014M562445, 2015T81047), and Natural Science Basic Research Plan in Shanxi Province of China (2015JM6353, 2014JQ8358, 2014JQ8307).
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
Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384–386 (1978)
Baldi, M.: QC-LDPC Code-Based Cryptosystem. QC-LDPC Code-Based Cryptography, p. 75. Springer International Publishing, Heidelberg (2014)
Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check codes in the McEliece cryptosystem. In: Proceedings of the IEEE ISIT 2000, Sorrento, Italy, p. 215, June 2000
Baldi, M: Quasi-cyclic low-density parity-check codes and their application to cryptography. Ph.D thesis, Universita Politecnica delle Marche, Ancona, Italy (2006)
Baldi, M., Bambozzi, F., Chiaraluce, F.: On a family of circulant matrices for quasi-cyclic low-density generator matrix codes. IEEE Trans. Inf. Theory 57(9), 6052–6067 (2011)
Baldi, M., Bianchi, M., Chiaraluce, F.: Security and complexity of the McEliece cryptosystem based on QC-LDPC codes. IET Inf. Secur. 7(3), 212–220 (2013)
Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Using LDGM codes and sparse syndromes to achieve digital signatures. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 1–15. Springer, Heidelberg (2013)
Courtois, N., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157–174. Springer, Heidelberg (2001)
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)
Zheng, D., Li, X., Chen, K.: Code-based ring signature scheme. Int. J. Netw. Secur. 5(2), 154–157 (2007)
Bresson, E., Stern, J., Szydlo, M.: Threshold ring signatures and applications to ad-hoc groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 465–480. Springer, Heidelberg (2002)
Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Proceedings of the ASIACRYPT 2009, Tokyo, Japan, 6–10 December 2009. LNCS, vol. 5912, pp. 88–105. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
Liu, M., Han, Y., Yang, X. (2016). A Ring Signature Based on LDGM Codes. In: Chen, W., et al. Big Data Technology and Applications. BDTA 2015. Communications in Computer and Information Science, vol 590. Springer, Singapore. https://doi.org/10.1007/978-981-10-0457-5_15
Download citation
DOI: https://doi.org/10.1007/978-981-10-0457-5_15
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0456-8
Online ISBN: 978-981-10-0457-5
eBook Packages: Computer ScienceComputer Science (R0)