Linkable ring signatures from linear feedback shift register

Authors:
Dong Zheng;Xiangxue Li;Kefei Chen;Jianhua Li
Affiliations:
Department of Computer Science and Engineering, Shanghai JiaoTong University and National Laboratory for Modern Communications, Chengdu;School of Information Security Engineering, Shanghai JiaoTong University;Department of Computer Science and Engineering, Shanghai JiaoTong University;School of Information Security Engineering, Shanghai JiaoTong University
Venue:
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Year:
2007

Citing 6
Cited 1

Shift Register Sequences

Shift Register Sequences
ID-Based Blind Signature and Ring Signature from Pairings

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
1-out-of-n Signatures from a Variety of Keys

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete Logarithms

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
New LFSR-based cryptosystems and the trace discrete log problem (Trace-DLP)

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Public-key cryptosystems based on cubic finite field extensions

IEEE Transactions on Information Theory

Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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(qd)(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.