Transitive Signature Scheme from LFSR
نویسندگان
چکیده
Linear feedback sequence register (LFSR) is a useful cryptographic primitive which is widely implemented in many cryptosystems to represent finite field elements with the counterparts of minimal polynomials. In this paper, an efficient transitive signature scheme from LFSR (LFSR-TS) is considered. First, two derived LFSR sequence operations are designed for LFSR-TS, which are not proposed prior to the current work. Next, the security of LFSR-TS is proven to be existentially unforgeable against the adaptive chosen-message attack in the standard model, which only requires the assumption of the discrete logarithm problem (DLP). Finally, the comparison of performances is presented amongst LFSR-TS and some related schemes.
منابع مشابه
Directed Transitive Signature on Directed Tree1
In early 2000’s, Rivest [1,2] and Micali [2] introduced the notion of transitive signature, which allows a third party with public key to generate a valid signature for a composed edge (vi,vk), from the signatures for two edges (vi,v j) and (v j,vk). Since then, a number of works, including [2,3,4,5,6], have been devoted on transitive signatures. Most of them address the undirected transitive s...
متن کاملA New Provably Secure Transitive Signature Scheme
A transitive signature scheme allows a signer to publish a graph in an authenticated and cost-saving manner. The resulting authenticated graph is indeed the transitive closure of the graph constructed by edges which are explicitly signed by the signer. A property of the transitive signature scheme enables such scenario is called composability. Composability means that by knowing signatures on t...
متن کاملA New Transitive Signature Scheme based on RSA-based Security Assumptions
A transitive signature scheme allows a signer to publish a graph in an authenticated and cost-saving manner. The resulting authenticated graph is indeed the transitive closure of the graph constructed by edges which are explicitly signed by the signer. A property of the transitive signature scheme enables such scenario is called composability which means that by knowing signatures on two edges ...
متن کاملOn Directed Transitive Signature
In early 2000’s, Rivest [Riv00,MR02] and Micali [MR02] introduced the notion of transitive signature, which allows a third party to generate a valid signature for a composed edge (vi, vk), from the signatures for two edges (vi, vj) and (vj , vk), and using the public key only. Since then, a number of works, including [MR02,BN02,Hoh03,SFSM05,BN05], have been devoted on transitive signatures. Mos...
متن کاملA Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs
We present a realization of the transitive signature scheme based on the algebraic properties of bilinear group pairs. The scheme is proven secure, i.e. transitively unforgeable under adaptive chosen message attack, assuming hardness of the computational co-Diffie-Hellman problem in bilinear group pairs and the security of the underlying standard signature scheme under known message attack. Our...
متن کامل