Linkable Ring Signatures from Linear Feedback Shift Register

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 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.