scholarly journals A Certificateless Ring Signature Scheme with High Efficiency in the Random Oracle Model

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Yingying Zhang ◽  
Jiwen Zeng ◽  
Wei Li ◽  
Huilin Zhu
Keyword(s):  
Digital Signature ◽  
High Efficiency ◽  
Random Oracle Model ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Bilinear Pairing ◽  
Public Key ◽  
Ring Signature ◽  
Certificateless Public Key Cryptography ◽  
Identity Based

Ring signature is a kind of digital signature which can protect the identity of the signer. Certificateless public key cryptography not only overcomes key escrow problem but also does not lose some advantages of identity-based cryptography. Certificateless ring signature integrates ring signature with certificateless public key cryptography. In this paper, we propose an efficient certificateless ring signature; it has only three bilinear pairing operations in the verify algorithm. The scheme is proved to be unforgeable in the random oracle model.

Secure and Efficient Certificateless Signature and Blind Signature Scheme from Pairings

2013 ◽  
Vol 457-458 ◽  
pp. 1262-1265
Author(s):  
Min Qin Chen ◽  
Qiao Yan Wen ◽  
Zheng Ping Jin ◽  
Hua Zhang
Keyword(s):  
Random Oracle Model ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Blind Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Diffie Hellman ◽  
Identity Based ◽  
Certificateless Signature

Based an identity-based signature scheme, we givea certificateless signature scheme. And then we propose a certificateless blind signature (CLBS) scheme in this paper. This schemeis more efficient than those of previous schemes by pre-computing the pairing e (P, P)=g. Based on CL-PKC, it eliminates theusing of certificates in the signature scheme with respect to thetraditional public key cryptography (PKC) and solves key escrowproblems in ID-based signature schemes. Meanwhile it retains themerits of BS schemes. The proposed CLBS scheme is existentialunforgeable in the random oracle model under the intractabilityof the q-Strong Diffie-Hellman problem.

Efficient Certificateless Signcryption in the Standard Model: Revisiting Luo and Wan’s Scheme from Wireless Personal Communications (2018)

2019 ◽  
Vol 62 (8) ◽  
pp. 1178-1193 ◽  
Author(s):  
Parvin Rastegari ◽  
Willy Susilo ◽  
Mohammad Dakhlalian
Keyword(s):  
Standard Model ◽  
Random Oracle Model ◽  
Personal Communication ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Research Literature ◽  
Public Key ◽  
Certificateless Public Key Cryptography ◽  
The Standard Model ◽  
Wireless Personal Communications

Abstract Certificateless public key cryptography (CL-PKC) promises a practical resolution in establishing practical schemes, since it addresses two fundamental issues, namely the necessity of requiring certificate managements in traditional public key infrastructure (PKI) and the key escrow problem in identity-based (ID-based) setting concurrently. Signcryption is an important primitive that provides the goals of both encryption and signature schemes as it is more efficient than encrypting and signing messages consecutively. Since the concept of certificateless signcryption (CL-SC) scheme was put forth by Barbosa and Farshim in 2008, many schemes have been proposed where most of them are provable in the random oracle model (ROM) and only a few number of them are provable in the standard model. Very recently, Luo and Wan (Wireless Personal Communication, 2018) proposed a very efficient CL-SC scheme in the standard model. Furthermore, they claimed that their scheme is not only more efficient than the previously proposed schemes in the standard model, but also it is the only scheme which benefits from known session-specific temporary information security (KSSTIS). Therefore, this scheme would indeed be very practical. The contributions of this paper are 2-fold. First, in contrast to the claim made by Luo and Wan, we show that unfortunately Luo and Wan made a significant error in the construction of their proposed scheme. While their main intention is indeed interesting and useful, the failure of their construction has indeed left a gap in the research literature. Hence, the second contribution of this paper is to fill this gap by proposing a CL-SC scheme with KSSTIS, which is provably secure in the standard model.

scholarly journals An efficient certificateless blind signature scheme without bilinear pairing

2014 ◽  
Vol 86 (2) ◽  
pp. 1003-1011 ◽  
Author(s):  
GUOFAGN DONG ◽  
FEI GAO ◽  
WENBO SHI ◽  
PENG GONG
Keyword(s):  
Security Analysis ◽  
Public Key Cryptography ◽  
Bilinear Pairing ◽  
Blind Signature ◽  
Public Key ◽  
Management Problem ◽  
Storage Security ◽  
Certificateless Public Key Cryptography ◽  
Identity Based ◽  
And Storage

Recently, the certificateless public key cryptography (CLPKC) has been studied widely since it could solve both of the certificate management problem in traditional public key cryptography (TPKC) and the key escrow problem in the identity-based public key cryptography (ID-based PKC). To satisfy requirements of different applications, many certificateless blind signature (CLBS) schemes using bilinear pairing for the CLPKC setting have been proposed. However, the bilinear pairing operation is very complicated. Therefore, the performance of those CLBS schemes is not very satisfactory. To solve the problem, we propose an efficient CLBS scheme without bilinear pairing. Performance analysis shows that the proposed scheme could reduce costs of computation and storage. Security analysis shows the proposed scheme is provably secure against both of two types of adversaries.

Multi-Node of Synergy Certificateless Authentication in WSNs

2012 ◽  
Vol 263-266 ◽  
pp. 3047-3051
Author(s):  
Guang Cong Liu ◽  
Yuan Jie Shi ◽  
Cong Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
High Efficiency ◽  
Low Cost ◽  
Public Key Cryptography ◽  
Security Requirements ◽  
Public Key ◽  
Wireless Sensor ◽  
Certificateless Public Key Cryptography ◽  
Certificateless Authentication

Certificateless Public Key Cryptography (CL-PKC) overcomes not only the key escrow problem in public key cryptography but also the cost of the certificate publishing and management in the Certificateless Public Key Cryptography (CL-PKC). No certificate public key cryptosystem just meet the requirements of this, but it relies on a special authentication server, which has high operating costs and lack of flexibility and it cannot meet the requirements of wireless sensor networks directly. Considering these problems, a multi-node of synergy certificateless authentication approach is proposed for WSN. The certificate of the nodes would be done by the certification set. And the set was consited of trusted neighbor nodes. Analysis indicates that this certification meets the security requirements of general wireless sensor networks and has advantages of low-cost and high efficiency.

Structure and Analysis of Certificateless Proxy Blind Signature Scheme without Bilinear Pairing

2013 ◽  
Vol 734-737 ◽  
pp. 3194-3198
Author(s):  
Yi Wang
Keyword(s):  
Finite Field ◽  
Discrete Logarithm ◽  
Public Key Cryptography ◽  
Bilinear Pairing ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Signature Scheme ◽  
Proxy Blind Signature ◽  
Certificateless Public Key Cryptography

Combined with certificateless public key cryptography and proxy blind signature, an efficient certificateless proxy blind signature scheme is proposed. Its security is based on the discrete logarithm problem. Compared with the existed certificateless proxy blind signature scheme, because without bilinear pairing, it have higher efficiency. According to the different attacker and all kinds of attacks, the scheme is proved to be correct and security under the hardness of discrete logarithm problem in the finite field.

scholarly journals Identity-Based Identification Scheme without Trusted Party against Concurrent Attacks

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Fei Tang ◽  
Jiali Bao ◽  
Yonghong Huang ◽  
Dong Huang ◽  
Fuqun Wang
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Bilinear Pairing ◽  
Key Generation ◽  
Secret Key ◽  
Key Escrow ◽  
Identification Scheme ◽  
Identification Schemes ◽  
Secret Keys ◽  
Identity Based

Identification schemes support that a prover who holding a secret key to prove itself to any verifier who holding the corresponding public key. In traditional identity-based identification schemes, there is a key generation center to generate all users’ secret keys. This means that the key generation center knows all users’ secret key, which brings the key escrow problem. To resolve this problem, in this work, we define the model of identity-based identification without a trusted party. Then, we propose a multi-authority identity-based identification scheme based on bilinear pairing. Furthermore, we prove the security of the proposed scheme in the random oracle model against impersonation under passive and concurrent attacks. Finally, we give an application of the proposed identity-based identification scheme to blockchain.

scholarly journals A Certificateless Authenticated Key Agreement Scheme for the Power IoT

Energies ◽  
2021 ◽  
Vol 14 (19) ◽  
pp. 6317
Author(s):  
Wenchao Cui ◽  
Rui Cheng ◽  
Kehe Wu ◽  
Yuling Su ◽  
Yuqing Lei
Keyword(s):  
Key Management ◽  
Key Agreement ◽  
Public Key Cryptography ◽  
Public Key ◽  
Security Model ◽  
Operating Environment ◽  
Authenticated Key Agreement ◽  
Certificateless Public Key Cryptography ◽  
Actual Application ◽  
Identity Based

Power Internet of Things (IoT) is the application of IoT technology in the field of power grid, which can better control all kinds of power equipment, power personnel and operating environment. However, access to mass terminals brings higher requirements for terminal authentication and key management for the power IoT. And the traditional public key infrastructure (PKI) and identity-based public key cryptography (IB-PKC) exist the problems of certificate management and key escrow. Therefore, the paper proposes a novel authenticated key agreement scheme based on the certificateless public key cryptography (CL-PKC) mechanism. In addition, the proposed scheme is proven with the improved extended Canetti-Krawczyk (eCK) security model. Finally, the implementation of the authenticated key agreement protocol is given based on the actual application requirement of the power IoT, and the analysis and comparison of the simulation demonstrates that the proposed scheme has higher efficiency and would be suitable for the power IoT.

scholarly journals The Implementation Results of Identity-Based Hashing Algorithm for Iot

2019 ◽  
Vol 8 (11) ◽  
pp. 4249-4252
Keyword(s):  
Digital Signature ◽  
Public Key Cryptography ◽  
Public Key ◽  
Light Weight ◽  
Mobile Environment ◽  
Signature Schemes ◽  
Iot Security ◽  
Identity Based ◽  
Hashing Algorithm ◽  
Constrained Devices

Nonrepudiation in Mobile environment is a major challenge in the area of IoT security. Public-key-based Digital Signature schemes are common and their computational requirements and complexities do not support constrained devices. This paper presents the design and implementation results of light weight nonrepudiation architecture based on public key cryptography and Elliptic Curve addition to reduce the overhead of processing and communication

scholarly journals Identity-Based Linkable Ring Signature on NTRU Lattice

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Yongli Tang ◽  
Feifei Xia ◽  
Qing Ye ◽  
Mengyao Wang ◽  
Ruijie Mu ◽  
...  
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Small Integer ◽  
Rejection Sampling ◽  
Signature Schemes ◽  
Ring Signature ◽  
Storage Overhead ◽  
Signature Generation ◽  
Identity Based ◽  
And Storage

Although most existing linkable ring signature schemes on lattice can effectively resist quantum attacks, they still have the disadvantages of excessive time and storage overhead. This paper constructs an identity-based linkable ring signature (LRS) scheme over NTRU lattice by employing the technologies of trapdoor generation and rejection sampling. The security of this scheme relies on the small integer solution (SIS) problem on NTRU lattice. We prove that this scheme has unconditional anonymity, unforgeability, and linkability under the random oracle model (ROM). Through the performance analysis, this scheme has a shorter size of public/private keys, and when the number of ring members is small (such as N ≤ 8 ), this scheme has a shorter signature size compared with other existing latest lattice-based LRS schemes. The computational efficiency of signature has also been further improved since it only involves multiplication in the polynomial ring and modular operations of small integers. Finally, we implemented our scheme and other similar schemes, and it is shown that the time for the signature generation and verification of this scheme decreases roughly by 44.951% and 33.503%, respectively.

Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model

2019 ◽  
Vol 30 (04) ◽  
pp. 589-606
Author(s):  
Qiqi Lai ◽  
Bo Yang ◽  
Zhe Xia ◽  
Yannan Li ◽  
Yuan Chen ◽  
...  
Keyword(s):  
Standard Model ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Proof System ◽  
Secret Key ◽  
Random Lattice ◽  
The Standard Model ◽  
Identity Based ◽  
Hash Proof System

As the progress of quantum computers, it is desired to propose many more efficient cryptographic constructions with post-quantum security. In the literatures, almost all cryptographic schemes and protocols can be explained and constructed modularly from certain cryptographic primitives, among which an Identity-Based Hash Proof System (IB-HPS) is one of the most basic and important primitives. Therefore, we can utilize IB-HPSs with post-quantum security to present several types of post-quantum secure schemes and protocols. Up until now, all known IB-HPSs with post-quantum security are instantiated based on latticed-based assumptions. However, all these lattice-based IB-HPSs are either in the random oracle model or not efficient enough in the standard model. Hence, it should be of great significance to construct more efficient IB-HPSs from lattices in the standard model. In this paper, we propose a new smooth IB-HPS with anonymity based on the Learning with Errors (LWE) assumption in the standard model. This new construction is mainly inspired by a classical identity-based encryption scheme based on LWE due to Agreawal et al. in Eurocrypt 2010. And our innovation is to employ the algorithm SampleGaussian introduced by Gentry et al. and the property of random lattice to simulate the identity secret key with respect to the challenge identity. Compared with other existing IB-HPSs in the standard model, our master public key is quite compact. As a result, our construction has much lower overheads on computation and storage.

Sign in / Sign up

Export Citation Format

Share Document