Privacy-preserving Communication for Vehicular with Multi Receiver Conditionally Anonymous Ring Signcryption

Wang, Qian; He, Mingyi; Zheng, Xin

doi:10.2991/icmemtc-16.2016.96

Cited by 2 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

“…Moreover, based on his own signcryption scheme [7], Zheng [8] proposed a multi-recipient signcryption (MRSC) scheme that possesses the functionalities of multi-recipient encryption and digital signature to ensure both integrity and confi-dentiality of transmitted contents. Furthermore, for protecting recipient's identity from concealing to other recipients, anonymous MRE (AMRE) schemes [9], [10] and anonymous MRSC (AMRSC) scheme [11] were proposed to combine privacy-preserving property into the original MRE or MRSC schemes.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Section: A Evolution Of Mrsc and Amrsc Schemesmentioning

confidence: 99%