Efficient and provably secure multi-receiver signcryption scheme using implicit certificate in edge computing

Yu, Xiaopeng; Zhao, Wei; Tang, Dianhua

doi:10.1016/j.sysarc.2022.102457

Cited by 15 publications

(8 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Li and Pang [33] declared that Niu et al's scheme [32] could not really achieve receiver anonymity because of the fixed Lagrange interpolation polynomial results. Then, Pang et al [34] devised an efficient MRCLSC scheme without bilinear pairing, while Yu et al [35] substantiated that Pang's et al scheme [34] could not achieve unforgeability and confidentiality, as the adversary can randomly forge the public and private key pairs of users. Yu et al [35] also found that the schemes in [36][37][38] could not ensure the integrity of transmitted data.…”

Section: Certificateless Signcryption Schemesmentioning

confidence: 99%

“…Then, Pang et al [34] devised an efficient MRCLSC scheme without bilinear pairing, while Yu et al [35] substantiated that Pang's et al scheme [34] could not achieve unforgeability and confidentiality, as the adversary can randomly forge the public and private key pairs of users. Yu et al [35] also found that the schemes in [36][37][38] could not ensure the integrity of transmitted data. Considering the secure data transmission of wireless body area networks, Shen et al [7] proposed a lightweight MRCLSC scheme.…”

Section: Certificateless Signcryption Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Lightweight and Secure Multi-Message Multi-Receiver Certificateless Signcryption Scheme for the Internet of Vehicles

Xu,

Yin,

2023

Electronics

View full text Add to dashboard Cite

The Internet of Vehicles (IoV) improves traffic efficiency and enhances driving safety through the real-time collection and analysis of traffic-related data. Numerous secure and privacy-preserving communication protocols have been proposed for the IoV. However, various security threats, privacy leakage, and inefficient communications remain unaddressed. Therefore, a lightweight and secure multi-message multi-receiver certificateless signcryption (LS-MRCLSC) scheme based on elliptic curve cryptography (ECC) is proposed. The proposed scheme guarantees secure communication and promotes messaging efficiency with multi-cast mode. Multiple key generation centers (KGCs) collaborate to generate and update the system master key (SMK) using Feldman’s verifiable secret-sharing (FVSS) algorithm, avoiding the single point of failure (SPoF) problem. Formal security proofs under the random oracle model (ROM) demonstrate that the proposed scheme meets requirements such as data confidentiality, message unforgeability, anonymity, and unlinkability. Performance evaluations confirm that the LS-MRCLSC scheme is better than similar schemes in terms of efficiency, feasibility, and scalability.

show abstract

Section: Certificateless Signcryption Schemesmentioning

confidence: 99%

Section: Certificateless Signcryption Schemesmentioning

confidence: 99%

Lightweight and Secure Multi-Message Multi-Receiver Certificateless Signcryption Scheme for the Internet of Vehicles

Xu,

Yin,

2023

Electronics

View full text Add to dashboard Cite

show abstract

“…Based on bilinear pairing groups, several PKI-MRSC schemes [22], [23] were proposed. For achieving better performance, several efficient PKI-MRSC schemes [24]- [27] based on elliptic curve or hyperelliptic curve cryptography have been proposed. Moreover, Wang et al [11] proposed a PKI-AMRSC scheme to combine privacypreserving property into the original PKI-MRSC scheme.…”

Section: A Evolution Of Mrsc and Amrsc Schemesmentioning

confidence: 99%

“…Table 1 lists the comparisons among the proposed PKI-LR-AMRSC scheme with PKI-MRSC, PKI-AMRSC, ID-AMRSC and CL-AMRSC schemes [11], [27], [39], [44] in terms of the public-key setting, the cost of multi-signcryption algorithm, the cost of unsigncryption algorithm, recipient anonymity, the ability of withstanding side-channel attacks, and leakage-unbounded property. For recipients of the schemes in [11], [27], [39], [44], a sender computes a key k r by using each recipient ID r 's public key (for r=1, 2, . .…”

Section: Comparisonsmentioning

confidence: 99%

“…The point is that the proposed scheme is the f irst LR-AMRSC scheme withstanding side-channel attacks and possesses leakage-unbounded property even though some bilinear pairing operations are required. Additionally, Table 2 lists the comparisons between our LR-AMRSC scheme with PKI-MRSC, PKI-AMRSC, ID-AMRSC and CL-AMRSC schemes [11], [27], [39], [44] Multi-signcryption saving 0% 48% 73% 81% 85% 87%…”

Section: Comparisonsmentioning

confidence: 99%

See 1 more Smart Citation

Leakage-Resilient Anonymous Multi-Recipient Signcryption Under a Continual Leakage Model

et al. 2022

View full text Add to dashboard Cite

A multi-recipient signcryption (MRSC) scheme possesses the functionalities of both multi-recipient public-key encryption and digital signature to ensure both integrity and confidentiality of transmitted messages. Moreover, an anonymous MRSC (AMRSC) scheme retains the functionalities of an MRSC scheme while offering privacy-preserving, namely, a recipient's identity or public key being hidden to other recipients. In the past, numerous MRSC and AMRSC schemes based on various publickey cryptographies (i.e., public key infrastructure (PKI)-based, identity (ID)-based and certificateless (CL)) were proposed. Recently, an attacker can realize side-channel attacks to acquire partial bits of private keys participated in cryptographic computations. However, up to date, no MRSC or AMRSC scheme can resist side-channel attacks so that these schemes might suffer from such attacks and could be broken. To resist such attacks under a continual leakage model, we propose the f irst PKI-based leakage-resilient AMRSC (PKI-LR-AMRSC) scheme in this paper. In the proposed scheme, an attacker is permitted to continually acquire partial bits of private keys partook in computations of the PKI-LR-AMRSC scheme, and formal security proofs are given to show that the proposed scheme still retains the original security of AMRSC schemes. As compared with the relevant AMRSC schemes, our PKI-LR-AMRSC scheme not only resists side-channel attacks but also reduces the cost of executing the multi-signcryption and unsigncryption algorithms. In particular, the point is that the computational complexities of our scheme respectively require only O(t) and O(1) in executing the Multi-signcryption algorithm and the Unsigncryption algorithm, where t is the number of recipients.

show abstract

Extreme learning with projection relational algebraic secured data transmission for big cloud data

Sakthivel,

Madhubala

2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryCloud Computing (CC) and big data are growing technology in the business. Big data is demonstrated in terms of volume, variety, and velocity. CC is employed for storing, processing, and accessing data. Many cryptographic techniques have been developed to enhance big data security in cloud computing. However, security and privacy are the primary concerns in protecting data, as it is highly sensitive. Yet, it faces the major problems of inefficient performance, increased time consumption, and lack of data confidentiality and integrity. To address this issue, proposed Extreme Learning with Projection Relational Algebraic Secured Data Transmission (ELPRA‐SDT) is introduced to secure data transactions from cloud users to cloud servers with enhanced data confidentiality and reduced time consumption for big cloud data. The proposed ELPRA‐SDT consists of two major processes namely registration and key generation. At first, the user's IP address is registered employing a transitive advanced set relation theory graph model in a cloud server (CS) for retrieving the numerous services. The CS generates private and public keys for each registered user's IP address using the Transitive Operational and Time Synchronized Random Winternitz Key generation model. After, the user sends a request to the CS for acquiring data. The CS validates the requested user based on security policy attributes. Second, the Projection Relational Algebraic Signcryption and Unsigncryption algorithm performs signature verification to ensure secure data access for protecting the data. Results of experiments carried out by using Coburg Intrusion Detection Data Sets‐001 dataset in Java. ELPRA‐SDT method is more efficient and more suitable for providing security and privacy to network traces in the Cloud. The result shows maximum performance with data confidentiality by 10% and data integrity by 13%. In addition, delay is reduced by 32%, and data delivery time and communication complexity is decreased by 28% and 24% to other existing methods.

show abstract

Efficient and provably secure multi-receiver signcryption scheme using implicit certificate in edge computing

Cited by 15 publications

References 21 publications

Lightweight and Secure Multi-Message Multi-Receiver Certificateless Signcryption Scheme for the Internet of Vehicles

Lightweight and Secure Multi-Message Multi-Receiver Certificateless Signcryption Scheme for the Internet of Vehicles

Leakage-Resilient Anonymous Multi-Recipient Signcryption Under a Continual Leakage Model

Extreme learning with projection relational algebraic secured data transmission for big cloud data

Contact Info

Product

Resources

About