scholarly journals A Pairing-Free Identity-Based Identification Scheme with Tight Security Using Modified-Schnorr Signatures

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1330
Author(s):  
Jason Chia ◽  
Ji-Jian Chin ◽  
Sook-Chin Yip
Keyword(s):  
Key Management ◽  
Discrete Logarithm ◽  
Probability Bounds ◽  
Diffie Hellman ◽  
Identity Based ◽  
Symmetric Key ◽  
Security Guarantees ◽  
Lightweight Authentication ◽  
Tight Security ◽  
Schnorr Signatures

The security of cryptographic schemes is proven secure by reducing an attacker which breaks the scheme to an algorithm that could be used to solve the underlying hard assumption (e.g., Discrete Logarithm, Decisional Diffie–Hellman). The reduction is considered tight if it results in approximately similar probability bounds to that of solving the underlying hard assumption. Tight security is desirable as it improves security guarantees and allows the use of shorter parameters without the risk of compromising security. In this work, we propose an identity-based identification (IBI) scheme with tight security based on a variant of the Schnorr signature scheme known as TNC signatures. The proposed IBI scheme enjoys shorter parameters and key sizes as compared to existing IBI schemes without increasing the number of operations required for its identification protocol. Our scheme is suitable to be used for lightweight authentication in resource-constrained Wireless Sensor Networks (WSNs) as it utilizes the lowest amount of bandwidth when compared to other state-of-the-art symmetric key lightweight authentication schemes. Although it is costlier than its symmetric key counterparts in terms of operational costs due to its asymmetric key nature, it enjoys other benefits such as decentralized authentication and scalable key management. As a proof of concept to substantiate our claims, we perform an implementation of our scheme to demonstrate its speed and memory usage when it runs on both high and low-end devices.

scholarly journals Twin-Schnorr: A Security Upgrade for the Schnorr Identity-Based Identification Scheme

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Ji-Jian Chin ◽  
Syh-Yuan Tan ◽  
Swee-Huay Heng ◽  
Raphael Chung-Wei Phan
Keyword(s):  
Recent Literature ◽  
Discrete Logarithm ◽  
Identification Scheme ◽  
Operation Costs ◽  
Operational Costs ◽  
Interactive Nature ◽  
Identity Based ◽  
Schnorr Signature ◽  
The One ◽  
Security Guarantees

Most identity-based identification (IBI) schemes proposed in recent literature are built using pairing operations. This decreases efficiency due to the high operation costs of pairings. Furthermore, most of these IBI schemes are proven to be secure against impersonation under active and concurrent attacks using interactive assumptions such as the one-more RSA inversion assumption or the one-more discrete logarithm assumption, translating to weaker security guarantees due to the interactive nature of these assumptions. The Schnorr-IBI scheme was first proposed through the Kurosawa-Heng transformation from the Schnorr signature. It remains one of the fastest yet most secure IBI schemes under impersonation against passive attacks due to its pairing-free design. However, when required to be secure against impersonators under active and concurrent attacks, it deteriorates greatly in terms of efficiency due to the protocol having to be repeated multiple times. In this paper, we upgrade the Schnorr-IBI scheme to be secure against impersonation under active and concurrent attacks using only the classical discrete logarithm assumption. This translates to a higher degree of security guarantee with only some minor increments in operational costs. Furthermore, because the scheme operates without pairings, it still retains its efficiency and superiority when compared to other pairing-based IBI schemes.

scholarly journals FUZZY IDENTITY-BASED DATA INTEGRITY AUDITING FOR DEPENDABLE CLOUD STORAGE SYSTEMS

2020 ◽  
pp. 44-50
Keyword(s):  
Cloud Storage ◽  
Distributed Storage ◽  
Discrete Logarithm ◽  
Security Model ◽  
Security Issue ◽  
Diffie Hellman ◽  
Framework Model ◽  
Identity Based ◽  
The Common ◽  
Fuzzy Identity

Information honesty, a center security issue in solid distributed storage, has gotten a lot of consideration. Information inspecting conventions empower a verifier to productively check the trustworthiness of the re-appropriated information without downloading the information. A key exploration challenge related with existing plans of information reviewing conventions is the intricacy in key administration. In this paper, we look to address the unpredictable key administration challenge in cloud information uprightness checking by presenting fluffy personality based examining, the first in such a methodology, as far as we could possibly know. All the more explicitly, we present the crude of fluffy character based information examining, where a client's personality can be seen as a lot of spellbinding qualities. We formalize the framework model and the security model for this new crude. We at that point present a solid development of fluffy personality based inspecting convention by using biometrics as the fluffy character. The new convention offers the property of mistake resistance, in particular, it ties with private key to one personality which can be utilized to confirm the rightness of a reaction created with another character, if and just if the two characters are adequately close. We demonstrate the security of our convention dependent on the computational Diffie-Hellman suspicion and the discrete logarithm supposition in the particular ID security model. At long last, we build up a model usage of the convention which shows the common sense of the proposition.

scholarly journals Revocable Identity-Based Encryption and Server-Aided Revocable IBE from the Computational Diffie-Hellman Assumption

Cryptography ◽  
2018 ◽  
Vol 2 (4) ◽  
pp. 33 ◽  
Author(s):  
Ziyuan Hu ◽  
Shengli Liu ◽  
Kefei Chen ◽  
Joseph Liu
Keyword(s):  
Key Management ◽  
Time Slot ◽  
Complete Binary Tree ◽  
The Past ◽  
Identity Based Encryption ◽  
Diffie Hellman ◽  
Public Keys ◽  
The Standard Model ◽  
Cdh Assumption ◽  
Identity Based

An Identity-based encryption (IBE) simplifies key management by taking users’ identities as public keys. However, how to dynamically revoke users in an IBE scheme is not a trivial problem. To solve this problem, IBE scheme with revocation (namely revocable IBE scheme) has been proposed. Apart from those lattice-based IBE, most of the existing schemes are based on decisional assumptions over pairing-groups. In this paper, we propose a revocable IBE scheme based on a weaker assumption, namely Computational Diffie-Hellman (CDH) assumption over non-pairing groups. Our revocable IBE scheme is inspired by the IBE scheme proposed by Döttling and Garg in Crypto2017. Like Döttling and Garg’s IBE scheme, the key authority maintains a complete binary tree where every user is assigned to a leaf node. To adapt such an IBE scheme to a revocable IBE, we update the nodes along the paths of the revoked users in each time slot. Upon this updating, all revoked users are forced to be equipped with new encryption keys but without decryption keys, thus they are unable to perform decryption any more. We prove that our revocable IBE is adaptive IND-ID-CPA secure in the standard model. Our scheme serves as the first revocable IBE scheme from the CDH assumption. Moreover, we extend our scheme to support Decryption Key Exposure Resistance (DKER) and also propose a server-aided revocable IBE to decrease the decryption workload of the receiver. In our schemes, the size of updating key in each time slot is only related to the number of newly revoked users in the past time slot.

An IBE-Based Authenticated Key Transfer Protocol on Elliptic Curves

2020 ◽  
pp. 1112-1122
Author(s):  
Daya Sagar Gupta
Keyword(s):  
Elliptic Curve ◽  
Computational Cost ◽  
Session Key ◽  
Private Key ◽  
Diffie Hellman ◽  
Security Properties ◽  
Hard Problems ◽  
Identity Based ◽  
Symmetric Key ◽  
Transfer Protocol

The key exchanged using key transfer protocols is generally used for symmetric key encryption where this key is known as private key and used for both encryption as well as decryption. As we all know, many key transfer protocols including basic Diffie-Hellman protocol are proposed in the literature. However, many of these key transfer protocols either are proven insecure or had a burden of communication and computational cost. Therefore, a more secure and efficient key transfer protocol is needed. In this article, the author proposes an authenticated key transfer protocol that securely and efficiently negotiates a common session key between two end users. He calls this protocol as IBE-TP-AKE. This proposal is based on the elliptic-curve cryptography (ECC) and uses the idea of identity-based encryption (IBE) with pairing. The security of the proposed work is based on the hard problems of elliptic curve and their pairing. Further, the author has shown the security of his proposed protocol and proved it using the security properties discussed later.

EIPS: An Efficient Identity-Based Ring Signature Scheme

2014 ◽  
Vol 687-691 ◽  
pp. 2100-2103
Author(s):  
Jian Hong Zhang ◽  
Wei Wang ◽  
Wei Na Zhen ◽  
Qiao Cui Dong
Keyword(s):  
Discrete Logarithm ◽  
Public Key ◽  
Signature Scheme ◽  
Ring Signature ◽  
Computation Cost ◽  
Diffie Hellman ◽  
Graphical Tool ◽  
Identity Based ◽  
Schnorr Signature ◽  
Identity Protection

As an important crypto graphical tool, ring signature is able to realize full anonymity and identity protection. Comparison the traditional PKI, Identity-based (ID-based) cryptography is a very good cryptosystem since it eliminates the need for checking the validity of the certificates of traditional public key system. In this work, we propose an efficient ring signature scheme by combining ID-based cryptography and Schnorr signature conception. Our scheme has some advantages for efficiency. In our proposed scheme, no pairing operators are needed in the whole signing phase and the verifying phase. It reduces the signer’s computation cost and increases the whole signature algorithm’s efficiency. In terms of signature’s length, our scheme only needs (n+1)|G| bits. Our ring signature can achieve full anonymity and unforgeability. The security of the scheme is related to two classical security assumptions: computational diffie-hellman problem and discrete logarithm problem.

A secure anonymous proxy signcryption scheme

2017 ◽  
Vol 11 (2) ◽  
Author(s):  
Vishal Saraswat ◽  
Rajeev Anand Sahu ◽  
Amit K. Awasthi
Keyword(s):  
Discrete Logarithm ◽  
Formal Definition ◽  
Security Model ◽  
Diffie Hellman ◽  
Cryptographic Primitive ◽  
Primitive Identity ◽  
Identity Based ◽  
Efficiency Comparison ◽  
Definition Of ◽  
Signcryption Scheme

AbstractWe introduce a new cryptographic primitive identity-based anonymous proxy signcryption which provides anonymity to the proxy sender while also providing a mechanism to the original sender to expose the identity of the proxy sender in case of misuse. We introduce a formal definition of an identity-based anonymous proxy signcryption (IBAPS) scheme and give a security model for it. We also construct an IBAPS scheme and prove its security under the discrete logarithm assumption and computational Diffie–Hellman assumption. Moreover, we do an efficiency comparison with the existing identity-based signcryption schemes and anonymous signcryption schemes and show that our scheme is much more efficient than those schemes, we also compare the efficiency of our scheme with the available proxy signcryption schemes and show that our scheme provides anonymity to the proxy sender at cost less than those of existing proxy signcryption schemes.

Sign in / Sign up

Export Citation Format

Share Document