From: An efficient anonymous batch authentication scheme based on priority and cooperation for VANETs
Symbol | Semantics |
---|---|
M | A VANET |
V | A set of vehicles in M |
v i | A vehicle in V |
R | A roadside unit |
SV | A message sender |
NV | A message receiver |
m mid | The message |
b mid | The message body |
t mid | The message expiration time |
\(q_{t}^{i}\) | The queue of messages to be processed in vi at time t |
w mid | The total time that a message mmid stays in qi |
S mid | A signature |
\(z^{i}_{t}\) | The number of messages that vi has authenticated at time t |
E | A non-singular elliptic curve: y2=x3+ax+b mod p |
p | A large prime number |
q | A large prime number |
G | An additive group of q order |
P | The generator of G |
F p | The finite field over p |
H 1 | A one-way hash function |
H 2 | A one-way hash function |
H 3 | A one-way hash function |
s | The master key of the system |
P pub | The public key of the system, Ppub=s×P |
RID | A vehicle’s real identity |
AID | A vehicle’s anonymous identity |
PAD | The password matched with vehicle’s real identity |
I | The signal strength |
TH | The threshold that will trigger the cooperative authentication |
CP | The amount that a RSU can afford for entire authentication |
\(L_{RSU}^{t}\) | The set of id of messages waiting to be authenticated at |
 | RSU at time t |
e RID | The vehicle’s valuation of a single message |
\(L_{RID}^{t}\) | The set of id of overlapped messages between \(L_{RSU}^{t}\) and |
 | at time the messages authenticated by vRID. |
b RID | The bid price of a single message that vRID asks for |
α | The lowest bidding value that a bidder can win |
r(bRID) | The ranking order of received bids |
T p | The time for performing a bilinear pairing operation |
T MP | The execution time of a scale multiplication point operation |
T MTP | The execution time of a MapToPoint operation |