More Efficient Threshold Signature Scheme in Gap Diffie-Hellman Group

2009 ◽  
Vol E92-A (7) ◽  
pp. 1720-1723
Author(s):  
DaeHun NYANG ◽  
Akihiro YAMAMURA
Keyword(s):  
Signature Scheme ◽  
Threshold Signature ◽  
Diffie Hellman

Efficient threshold signature scheme in standard model

2013 ◽  
Vol 33 (1) ◽  
pp. 15-18
Author(s):  
Xianzhi SHI ◽  
Changlu LIN ◽  
Shengyuan ZHANG ◽  
Fei TANG
Keyword(s):  
Standard Model ◽  
Signature Scheme ◽  
Threshold Signature

scholarly journals Time-constrained strong multi-designated verifier signature suitable for Internet of things–based collaborative fog computing systems

2021 ◽  
Vol 17 (3) ◽  
pp. 155014772110017
Author(s):  
Han-Yu Lin
Keyword(s):  
Internet Of Things ◽  
Fog Computing ◽  
Discrete Logarithm ◽  
Signature Scheme ◽  
Computing Systems ◽  
Extended Technique ◽  
Diffie Hellman ◽  
Designated Verifier ◽  
Designated Verifier Signature ◽  
Cloud Servers

Fog computing is viewed as an extended technique of cloud computing. In Internet of things–based collaborative fog computing systems, a fog node aggregating lots of data from Internet of things devices has to transmit the information to distributed cloud servers that will collaboratively verify it based on some predefined auditing policy. However, compromised fog nodes controlled by an adversary might inject bogus data to cheat or confuse remote servers. It also causes the waste of communication and computation resources. To further control the lifetime of signing capability for fog nodes, an appropriate mechanism is crucial. In this article, the author proposes a time-constrained strong multi-designated verifier signature scheme to meet the above requirement. In particular, a conventional non-delegatable strong multi-designated verifier signature scheme with low computation is first given. Based on its constructions, we show how to transform it into a time-constrained variant. The unforgeability of the proposed schemes is formally proved based on the famous elliptic curve discrete logarithm assumption. The security requirement of strong signer ambiguity for our substantial constructions is also analyzed by utilizing the intractable assumption of decisional Diffie–Hellman. Moreover, some comparisons in terms of the signature size and computational costs for involved entities among related mechanisms are made.

A General Threshold Signature Scheme Based on Elliptic Curve

2013 ◽  
Vol 756-759 ◽  
pp. 1339-1343
Author(s):  
Yu Lian Shang ◽  
Xiu Juan Wang ◽  
Yu Juan Li ◽  
Yu Fei Zhang
Keyword(s):  
Elliptic Curve ◽  
Communication System ◽  
Public Key ◽  
Threshold Scheme ◽  
Elliptic Curve Cryptosystem ◽  
Signature Scheme ◽  
Threshold Signature ◽  
Private Key ◽  
Generating Polynomial ◽  
Directional Transmission

Based on Elliptic Curve cryptosystem, a threshold signature scheme characterized by (k,l) joint verification for (t,n) signature is put forward. After being signed by a signer company employing (t, n) threshold signature scheme, the informationmis transmitted to a particular verifier company, and then the signature is verified through the cooperation ofkones from the verifier company withlmembers, so as to realize a directional transmission between different companies. Finally, the application examples of the company encryption communication system, the generating polynomial of company private key and public key were given. The security of this scheme is based on Shamir threshold scheme and Elliptic Curve system, and due to the advantages of Elliptic Curve, the scheme enjoys wider application in practice.

Short Online/Off-line Signature Scheme for Wireless Sensor Networks

2015 ◽  
Vol 9 (1) ◽  
pp. 47-61
Author(s):  
Anser Ghazzaal Ali Alquraishee ◽  
Jayaprakash Kar ◽  
Naomie Salim
Keyword(s):  
Computational Cost ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Signature Scheme ◽  
Diffie Hellman ◽  
Two Phases ◽  
Chosen Message Attack

This article proposes a novel construction of short Online/Off-line signature scheme with provable security in the random oracle model for wireless sensor network (WSN). Security of the proposed scheme relies on k-CAA Problem as well as Computational Diffie-Hellman problem and is resistant against chosen message attack. The scheme is suited for broadcast authentication and integrity of message exchanging between the sensor nodes. The process of generation of the signature is carried out in two phases online and off-line. The heavy computation is performed in off-line phase, i.e the base station. The actual signature will be generated in the sensor nodes. The authors assume that the online phase is more efficient. Here they have evaluated the size of the signature with respect to the size of the user's public key and compare with some current schemes. Also, the authors have evaluated the computational cost and time which shows the scheme is most suited to implement on sensor node.

Sign in / Sign up

Export Citation Format

Share Document