Some Open Issues and New Directions in Group Signatures
FC '99 Proceedings of the Third International Conference on Financial Cryptography
The Security and Privacy of Smart Vehicles
IEEE Security and Privacy
Detecting and correcting malicious data in VANETs
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
The security of vehicular ad hoc networks
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
Efficient secure aggregation in VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
An Efficient Group Signature Scheme from Bilinear Maps
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient and robust pseudonymous authentication in VANET
Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Journal of Cryptology
Securing vehicular ad hoc networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
BAT: a robust signature scheme for vehicular networks using binary authentication tree
IEEE Transactions on Wireless Communications
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Pseudonymous PKI for ubiquitous computing
EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
Foundations of group signatures: the case of dynamic groups
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Security in mobile ad hoc networks: challenges and solutions
IEEE Wireless Communications
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Correctness of exchanged information and guaranteeing the privacy of vehicle owners are the two most significant security concerns for VANETs. Pseudonymous public key infrastructure (PPKI) is a practical solution to these two issues. Almost all PPKI technologies are comprehensive schemes, such as the group signature-based and identity-based cryptosystems. An applicable PPKI scheme for secure vehicular communication (VC) should support revocability because it is a significant functionality in VANETs to revoke certificates of vehicles for surrendering or transferring the registrations. However, the computation or space complexity in most of the revocable PPKI-based protocols is linear when the number of vehicles or revoked vehicles increases over time. This drawback markedly degrades the efficiency and stability of secure VC. This work therefore reduces the computation complexities of authentication message verification, certificate tracing, membership revocation, and space complexity of system parameters (e.g., revocation information and public keys), such that they are independent of the number of vehicles or revoked vehicles using a novel and efficient PPKI mechanism based on bilinear mapping. The proposed scheme uses the concept of accumulator schemes and transfers the computation of accumulators from vehicles to certificate authority (CA) for achieving constant computation and storage complexities on vehicles. The computation of accumulators on CA is also low in the proposed scheme. Finally, we formally prove that the proposed scheme, which is based on q-strong Diffie–Hellman, n-Diffie–Hellman exponent (DHE), variant n-DHE, and decision linear Diffie–Hellman assumptions, is secure under the definitions of traceability and anonymity. Copyright © 2011 John Wiley & Sons, Ltd.