A Variant of BLS Signature Scheme with Tight Security Reduction

2018 ◽  
pp. 150-163 ◽  
Author(s):  
Tiong-Sik Ng ◽  
Syh-Yuan Tan ◽  
Ji-Jian Chin
Keyword(s):  
Signature Scheme ◽  
Tight Security

New Signature and Multi-Signature Schemes with Tight Security Reduction Based on D-DDH Problem

2012 ◽  
Vol 263-266 ◽  
pp. 3052-3059
Author(s):  
Ze Cheng Wang
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Main Method ◽  
Discrete Logarithms ◽  
Diffie Hellman ◽  
Intractable Problem ◽  
Tight Security

Based on the newly introduced d-decisional Diffie-Hellman (d-DDH) intractable problem, a signature scheme and a multi-signature scheme are proposed. The main method in the constructions is a transformation of a knowledge proof on the equality of two discrete logarithms. The two schemes are proved secure in the random oracle model and the security reductions to the d-DDH problem are tight. Moreover, one can select different d for different security demand of applications. Thus the schemes are secure, efficient and practical.

A CDH-Based Multi-Signature Scheme with Tight Security Reduction

2008 ◽  
Author(s):  
Zecheng Wang ◽  
Taozhi Si ◽  
Haifeng Qian ◽  
Zhibin Li
Keyword(s):  
Signature Scheme ◽  
Tight Security
Sign in / Sign up

Export Citation Format

Share Document