Abstract
For many practical usages or resource-limited environments, it is often desirable to speed up the cryptographic systems without any security lost. Linkable ring signature is a kind of signatures which can simultaneously provide the properties of anonymity, spontaneity as well as linkability. Threshold signature is a useful tool for decentralizing the power to sign a message by distributed computing. The paper presents linkable ring signatures and threshold signatures using n-th order characteristic sequences generated by a linear feedback shift register (LFSR). Our schemes enjoy the following attractive features: (i) main computation operations are performed in GF(q); and (ii) security properties rely on the difficulty of solving the state based discrete logarithm problem(S-DLP) and on state based decisional Diffie-Hellman(S-DDH) assumption. Since the complexity of breaking S-DLP(S-DDHP, resp.) is computationally equivalent to that of solving traditional DLP(DDHP, resp.) in GF(q n), the proposed schemes successfully enhance the security of the system and meanwhile maintain low computational costs. All these make our schemes more flexible.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman group signature scheme. In: Proceedings of the 6th International Workshop on Practice and Theory in Public Key Cryptography (PKC 2003) Miami, FL, USA, pp. 31–46 ( 2003)
Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)
Desmedt, Y.: Threshold cryptography. European Transactions on Telecommunications 5(4), 449–457 (1994)
Giuliani, K., Gong, G.: New LFSR-based cryptosystems and the trace discrete logrithm problem (Trace-DLP). In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 298–312. Springer, Heidelberg (2005)
Golomb, S.: Shift register sequences. Laguna Hills, CA, Aegean Park (1982)
Gong, G., Harn, L.: Public-key cryptosystems based on cubic finite field extensions. IEEE Transaction on Information Theory 24, 2601–2605 (1998)
Lenstra, A., Verheul, E.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 1–19. Springer, Heidelberg (2000)
Li, X., Zheng, D., Chen, K.: LFSR-based signatures with message recovery. Intenational Journal of Network Security 4(3), 266–270 (2007)
Liu, J., Wei, V., Wong, D.: Linkable spontaneous anonymous group signature for ad hoc groups. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, Springer, Heidelberg (2004)
Liu, J., Wong, D.: Linkable Ring Signatures: Security Models and New Schemes. In: Proceedings of the International Conference on Computational Science and Its Applications (ICCSA 2005), Singapore, pp. 614–623 (2005)
Niederreiter, H.: Finite Fields and cryptology. Finite Fields, Coding Theory, and Advances in Communications and Computing, pp. 359–373, M. Dekker, New York (1993)
Ohta, K., Okamoto, T.: On concrete security treatment of signatures derived from identification. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 354–369. Springer, Heidelberg (1998)
Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology 13(3), 361–396 (2000)
Rivest, R., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, Springer, Heidelberg (2001)
Smith, P., Skinner, C.: A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917, Springer, Heidelberg (1995)
Tan, C., Yi, X., Siew, C.: On the n-th order shift register based discrete logrithm. IEICE Trans. Fundamentals E86-A, 1213–1216 (2003)
Wei, V.: A bilinear spontaneous anonymous threshold signature for ad hoc groups. Cryptology ePrint Archive, Report 2004/039, available at: http://eprint.iacr.org/
Zhang, F., Kim, K.: ID-Based blind signature and ring signature from pairings. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 415–432. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Zheng, D., Chen, K. (2007). Efficient Linkable Ring Signatures and Threshold Signatures from Linear Feedback Shift Register. In: Jin, H., Rana, O.F., Pan, Y., Prasanna, V.K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2007. Lecture Notes in Computer Science, vol 4494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72905-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-72905-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72904-4
Online ISBN: 978-3-540-72905-1
eBook Packages: Computer ScienceComputer Science (R0)