2012
DOI: 10.1016/j.comcom.2011.09.003
|View full text |Cite
|
Sign up to set email alerts
|

An efficient and secure mobile payment protocol for restricted connectivity scenarios in vehicular ad hoc network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
42
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 68 publications
(42 citation statements)
references
References 16 publications
0
42
0
Order By: Relevance
“…Kungpisdan et al (2004). It has continued through the years in 512 related studies by Hassinen et al (2008) and Li et al (2012). 513 Building on previous studies, Isaac and Zeadally (2013) solutions (Isaac and Zeadally 2014), which is another rare feature 517 of technology articles (see Table 5).…”
mentioning
confidence: 96%
“…Kungpisdan et al (2004). It has continued through the years in 512 related studies by Hassinen et al (2008) and Li et al (2012). 513 Building on previous studies, Isaac and Zeadally (2013) solutions (Isaac and Zeadally 2014), which is another rare feature 517 of technology articles (see Table 5).…”
mentioning
confidence: 96%
“…Online fund transfer is easy and fast, however it is risky at the same time and it becomes more risky in Vehicular ad-hoc Network. In one of the research paper, Author has suggested an efficient and secured payment protocol for VANET [13].…”
Section: Payment Protocol For Vehicular Ad Hoc Networkmentioning
confidence: 99%
“…These keys are generated by selfcertified key agreement protocol. After registration, all these entities own a pair of public/private key which is updated at the beginning of every payment transaction to ensure freshness of the keys [13].…”
Section: The Proposed Mobile Payment Protocolmentioning
confidence: 99%
“…Table 1 is performance comparison of login and key agreement phase, as we know that login and key agreement is the main body of an authentication scheme, and registration phase only performs one time before authentication. Let , ℎ , , and be the time for performing a modular exponentiation, a one-way hash function, a symmetric encryption/decryption, and a scalar multiplication on elliptic curve, which need 0.522 seconds, 0.0005 seconds, 0.0087 seconds, and 0.063075 seconds [17][18][19], respectively. We ignore modular addition, exclusive OR operation, and string concatenation operation which are negligible compared to others.…”
Section: Performance Comparisonmentioning
confidence: 99%