Efficient linkable ring signatures and threshold signatures from linear feedback shift register

Authors:
Xiangxue Li;Dong Zheng;Kefei Chen
Affiliations:
School of Information Security Engineering, Shanghai JiaoTong University and State Key Laboratory of Information Security, Institute of Software of Chinese Academy of Sciences, China;Department of Computer Science and Engineering, Shanghai JiaoTong University and National Laboratory for Modern Communications, Chengdu;Department of Computer Science and Engineering, Shanghai JiaoTong University and National Laboratory for Modern Communications, Chengdu
Venue:
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Year:
2007

Citing 9
Cited 0

Shift Register Sequences

Shift Register Sequences
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On Concrete Security Treatment of Signatures Derived from Identification

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
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
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
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
Linkable ring signatures: security models and new schemes

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
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

Quantified Score

Hi-index	0.00

Visualization

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(SDLP) 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(qn),the proposed schemes successfully enhance the security of the system and meanwhile maintain low computational costs. All these make our schemes more flexible.