An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
From MaRDI portal
Publication:2218485
DOI10.1007/s00607-018-0689-3zbMath1487.68025OpenAlexW2903608625WikidataQ128747297 ScholiaQ128747297MaRDI QIDQ2218485
G. P. Biswas, Sankar Mukherjee, Daya Sagar Gupta
Publication date: 15 January 2021
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-018-0689-3
Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Internet topics (68M11) Privacy of data (68P27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- LESPP: lightweight and efficient strong privacy preserving authentication scheme for secure VANET communication
- Lattice Signatures and Bimodal Gaussians
- Identity-Based Cryptosystems and Signature Schemes
- Trapdoors for hard lattices and new cryptographic constructions
- Elliptic Curve Cryptosystems
- New directions in cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice