scholarly journals A New Provably Secure Certificateless Signature with Revocation in the Standard Model

Informatica ◽  
2019 ◽  
Vol 30 (4) ◽  
pp. 711-728 ◽  
Author(s):  
Qian Mei ◽  
Yanan Zhao ◽  
Hu Xiong
Keyword(s):  
Standard Model ◽  
The Standard Model ◽  
Certificateless Signature ◽  
Provably Secure

Provably secure multi-proxy signature scheme with revocation in the standard model

2011 ◽  
Vol 34 (3) ◽  
pp. 494-501 ◽  
Author(s):  
Zhenhua Liu ◽  
Yupu Hu ◽  
Xiangsong Zhang ◽  
Hua Ma
Keyword(s):  
Standard Model ◽  
Proxy Signature ◽  
Signature Scheme ◽  
The Standard Model ◽  
Provably Secure

New Constructions of Hierarchical Identity-Based Signature in the Standard Model

2011 ◽  
Vol 474-476 ◽  
pp. 1356-1361
Author(s):  
Qing Wu ◽  
Su Xia Sun
Keyword(s):  
Standard Model ◽  
Provable Security ◽  
Security Model ◽  
Private Key ◽  
Random Oracles ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Cdh Assumption ◽  
Identity Based ◽  
Provably Secure

In this paper, a new construct of hierarchical identity-based signature(HIBS) scheme is proposed at first. It has many advantages over those available, such as fully secure without using random oracles, efficient signing algorithm. Additionally, it is provably secure under the computational Diffie-Hellman(CDH) assumption. This assumption is more natural than many of the hardness assumptions recently introduced to HIBS in the standard model. However, the length of its private key and signature increases as the hierarchy depth expands. Then a modified scheme is presented. The signature of modified scheme consists of three group elements and the private keys size shrinks as the identity depth increases. Under the h-CDH assumption, it is provable security in full security model without using random oracles.

scholarly journals Practical (fully) distributed signatures provably secure in the standard model

2015 ◽  
Vol 595 ◽  
pp. 143-158 ◽  
Author(s):  
Yujue Wang ◽  
Duncan S. Wong ◽  
Qianhong Wu ◽  
Sherman S.M. Chow ◽  
Bo Qin ◽  
...  
Keyword(s):  
Standard Model ◽  
The Standard Model ◽  
Provably Secure

scholarly journals A Different Encryption System Based on the Integer Factorization Problem

2020 ◽  
Vol 3 (1) ◽  
pp. 50-54
Author(s):  
Karima Djebaili ◽  
Lamine Melkemi
Keyword(s):  
Standard Model ◽  
Group Element ◽  
Integer Factorization ◽  
Factorization Problem ◽  
Computational Problem ◽  
Integer Factorization Problem ◽  
The Standard Model ◽  
One Way Function ◽  
Provably Secure

We present a new computational problem in this paper, namely the order of a group element problem which is based on the factorization problem, and we analyze its applications in cryptography. We present a new one-way function and from this function we propose a homomorphic probabilistic scheme for encryption. Our scheme, provably secure under the new computational problem in the standard model.

Cryptanalysis and improvement of a new certificateless signature scheme in the standard model

2021 ◽  
Vol 18 (1) ◽  
pp. 151-160
Author(s):  
Chenhuang Wu ◽  
Hui Huang ◽  
Kun Zhou ◽  
Chunxiang Xu
Keyword(s):  
Standard Model ◽  
Signature Scheme ◽  
The Standard Model ◽  
Certificateless Signature
Sign in / Sign up

Export Citation Format

Share Document