Using Identity-Based Public-Key Cryptography with Images to Preserve Privacy

It is an important challenge to find out suitable cryptography for WSN due to limitations of energy, computation capability and storage resources. Considering this sensor feature on limitations of resources, a security architecture based-on public key cryptography is proposed. The security architecture is based on identity based cryptosystem, but not requires key handshaking. The analysis shows that the security architecture ensures a good level of security and is very much suitable for the resources constrained trend of wireless sensor network.

Download Full-text

Secure message routing in structured peer-to-peer networks

10.32920/ryerson.14665623.v1 ◽

2021 ◽

Author(s):

Abdolkarim Hajfarajollah Dabbagh

Keyword(s):

Public Key Cryptography ◽

Peer To Peer ◽

Public Key ◽

Message Delivery ◽

Delivery Time ◽

P2p Networks ◽

Security Measures ◽

Message Routing ◽

Security Issues ◽

Identity Based

"Due to the lack of a centralized server in “Peer-to-Peer” (P2P) networks, users are responsible for the security of these networks. One of the security issues in P2P networks is the security of the message routing. Messages could be altered or modified by attackers while being routed. The conventional security method to avoid this has been “Public Key Cryptography” (PKC). To avoid the certificate management issue in PKC, “Identity-based Encryption” (IBE) has been suggested in which any arbitrary string could be used as a public key. Since IBE is a computationally expensive method, current proposed IBE-based methods are not effective in the message routing phase in P2P networks and highly affect the performance of message delivery time in these networks. This thesis proposes two IBE-based protocols that can be applied effectively to the message routing phase of structured P2P networks, yet provide a satisfactory message delivery time performance. Both protocols benefit from Identity-based key exchange scheme and, therefore, none of them impose any extra communication on the network to secure message routing. Protocol 1 significantly improves the performance of message delivery time compared to the current IBE-based proposed methods. Protocol 2, which requires nodes to store data, has a performance similar to the situations in which no security measures are applied for message routing."

Download Full-text

White-Box Implementation of the Identity-Based Signature Scheme in the IEEE P1363 Standard for Public Key Cryptography

IEICE Transactions on Information and Systems ◽

10.1587/transinf.2019inp0004 ◽

2020 ◽

Vol E103.D (2) ◽

pp. 188-195 ◽

Cited By ~ 2

Author(s):

Yudi ZHANG ◽

Debiao HE ◽

Xinyi HUANG ◽

Ding WANG ◽

Kim-Kwang Raymond CHOO ◽

...

Keyword(s):

Public Key Cryptography ◽

Public Key ◽

Signature Scheme ◽

Identity Based

Download Full-text

Certificateless Public Key Encryption Scheme with Hybrid Problems and Its Application to Internet of Things

Mathematical Problems in Engineering ◽

10.1155/2014/980274 ◽

2014 ◽

Vol 2014 ◽

pp. 1-9 ◽

Cited By ~ 5

Author(s):

Rui Guo ◽

Qiaoyan Wen ◽

Huixian Shi ◽

Zhengping Jin ◽

Hua Zhang

Keyword(s):

Internet Of Things ◽

Public Key Cryptography ◽

Public Key ◽

Encryption Scheme ◽

Public Key Encryption ◽

Certificateless Cryptography ◽

Diffie Hellman ◽

Identity Based ◽

Certificate Management ◽

Certificateless Public Key Encryption

Certificateless cryptography aims at combining the advantages of public key cryptography and identity based cryptography to avoid the certificate management and the key escrow problem. In this paper, we present a novel certificateless public key encryption scheme on the elliptic curve over the ring, whose security is based on the hardness assumption of Bilinear Diffie-Hellman problem and factoring the large number as in an RSA protocol. Moreover, since our scheme requires only one pairing operation in decryption, it is significantly more efficient than other related schemes. In addition, based on our encryption system, we also propose a protocol to protect the confidentiality and integrity of information in the scenario of Internet of Things with constrained resource nodes.

Download Full-text

Electronic Voting Protocol Using Identity-Based Cryptography

The Scientific World JOURNAL ◽

10.1155/2015/741031 ◽

2015 ◽

Vol 2015 ◽

pp. 1-6 ◽

Cited By ~ 2

Author(s):

Gina Gallegos-Garcia ◽

Horacio Tapia-Recillas

Keyword(s):

Key Agreement ◽

Public Key Cryptography ◽

Public Key ◽

Electronic Voting ◽

Certification Authority ◽

Public Keys ◽

Core Components ◽

Identity Based ◽

High Flexibility ◽

Agreement Protocols

Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps.

Download Full-text

Secure and Efficient Certificateless Signature and Blind Signature Scheme from Pairings

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.457-458.1262 ◽

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.

Download Full-text

Identity Based Encryption and Identity Based Signature Scheme: A Research on Security Schemes

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.f1270.0486s419 ◽

2019 ◽

Vol 8 (6S4) ◽

pp. 1330-1337

Keyword(s):

Key Management ◽

Public Key Cryptography ◽

Public Key Infrastructure ◽

Public Key ◽

Signature Scheme ◽

Certificate Authority ◽

Identity Based Encryption ◽

Computer Based ◽

Identity Based ◽

To Receive

In computer based system, key for the problem of identification, authentication and secrecy can be found in the field of cryptography. Dependence on public key infrastructure and to receive certificates signed by Certificate Authority (CA) to authenticate oneself for exchange of encrypted messages is one of the most significant limitation for the widespread adoption of Public Key Cryptography (PKC) as this process is time engrossing and error prone. Identity based cryptography (IBC) aspires to reduce the certificate and key management overhead of PKC. IBC’s important primordial is Identity-based Encryption (IBE). IBE provided emergent for perception of Identity based signature (IBS) schemes. In this paper, overview of IBE and IBS schemes has been given. Also, a survey on various IBE and IBS schemes has been performed to review different problems related to them. Finally, feasibility and applicability of IBC in current and future environments has been discussed.

Download Full-text

An Improved Identity-Based Multivariate Signature Scheme Based on Rainbow

Cryptography ◽

10.3390/cryptography3010008 ◽

2019 ◽

Vol 3 (1) ◽

pp. 8 ◽

Cited By ~ 1

Author(s):

Le Luyen

Keyword(s):

Quantum Cryptography ◽

Public Key Cryptography ◽

Public Key ◽

Signature Scheme ◽

Signature Schemes ◽

Identity Based ◽

Post Quantum Cryptography ◽

Multivariate Public Key

Multivariate Public Key Cryptography (MPKC) is one of the main candidates for post-quantum cryptography, especially in the area of signature schemes. In this paper, we instantiate a certificate Identity-Based Signature (IBS) scheme based on Rainbow, one of the most efficient and secure multivariate signature schemes. In addition, we revise the previous identity-based signature scheme IBUOV based on the Unbalanced Oil and Vinegar (UOV) scheme on the security and choice of parameters and obtain that our scheme is more efficient than IBUOV in terms of key sizes and signature sizes.

Download Full-text

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

Mathematical Problems in Engineering ◽

10.1155/2017/7696858 ◽

2017 ◽

Vol 2017 ◽

pp. 1-9 ◽

Cited By ~ 1

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.

Download Full-text