Abstract
Linkable ring signatures can simultaneously provide the properties of anonymity, spontaneity as well as linkability. Linear feedback shift register (LFSR) sequence can be used to shorten the representation of elements in a field. This paper proposes an LFSR-based linkable ring signature scheme, whose main computation operations are performed in base field GF(q) whereas security properties are under the state based discrete logarithm assumption (S-DLA) (and a new state based computational assumption weaker than state based decisional Diffie-Hellman assumption). The latter potentially says that the scheme is secure in the extension field GF(q d)(d the stage of the LFSR). All these make our scheme a flexible primitive for ubiquitous computing in which information processing has been thoroughly integrated into everyday objects and activities.
Supported by NSFC (No. 60573030, 60673076, 60672068) and NCET (No. NCET-06-0393).
Chapter PDF
Similar content being viewed by others
References
Abe, M., Ohkubo, M., Suzuki, K.: 1-out-of-n signatures from a variety of keys. In: Advances in Cryptology-Asiacrypt 2002, pp. 415–432 (2002)
Camenisch, J., Stadler, M.: Proof systems for general systems of discrete logarithms. ETH Technical Report No, 260 (1997), ftp://ftp.inf.ethz.ch/pub/publications/tech-reports/
Giuliani, K., Gong, G.: New LFSR-Based cryptosystems and the trace discrete log problem (Trace-DLP). In: Proceedings of sequences and their applications-SETA 2004, pp. 298–312 (2004)
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 (1999)
Koblitz, N., Menezes, A.: Another look at generic group. Cryptology ePrint Archive, 2006/230, http://eprint.iacr.org/2006/230
Lenstra, A., Verheul, E.: The XTR public key system. In: Advances in Cryptology-Crypto 2000, pp. 1–19 (2000)
Li, X., Zheng, D., Chen, K.: LFSR-based signatures with message recovery. Intenational Journal of Network Security 4(3), 266–270 (2007)
Lipmaa, H.: Proofs of knowledge of certain problems, http://www.cs.ut.ee/lipmaa/crypto/link/zeroknowledge/pok.php
Liu, J., Wei, V., Wong, D.: Linkable spontaneous anonymous group signature for ad hoc groups. In: Proceedings of Australasian Conf. Information Security and Privacy-ACISP 2004, pp. 325–335 (2004)
Niederreiter, H.: Finite fields and cryptology. In: Proceedings of Finite fields,coding theory, and Advances in communications and computing, Dekker, New York, pp. 359–373 (1992)
Rivest, R., Shamir, A., Tauman, Y.: How to leak a secret. In: Advances in Cryptology-Asiacrypt 2001, pp. 552–565 (2001)
Smith, P., Skinner, C.: A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms. In: Advances in Cryptology-Asiacrypt 1994, pp. 357–364 (1994)
Tan, C., Yi, X., Siew, C.: On the n-th order shift register based discrete logarithm. IEICE Transaction on Fundamentals E86-A(5), 1213–1216 (2003)
Wei, V.: A bilinear spontaneous anonymous threshold signature for ad hoc groups. Cryptology ePrint Archive, 2004/039, http://eprint.iacr.org/
Zhang, F., Kim, K.: ID-Based blind signature and ring signature from pairings. In: Advances in Cryptology-Asiacrypt 2002, pp. 535–547 (2002)
Zheng, D., Wei, V., Chen, K.: GDH group-based signature scheme with linkability. Communications, IEE Proceedings 153(5), 639–644
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, D., Li, X., Chen, K., Li, J. (2007). Linkable Ring Signatures from Linear Feedback Shift Register. In: Denko, M.K., et al. Emerging Directions in Embedded and Ubiquitous Computing. EUC 2007. Lecture Notes in Computer Science, vol 4809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77090-9_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-77090-9_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77089-3
Online ISBN: 978-3-540-77090-9
eBook Packages: Computer ScienceComputer Science (R0)