Improving Smart Card Security Using Elliptic Curve Cryptography over Prime Field (F p )

Abdurahmonov, Tursun; Yeoh, Eng-Thiam; Hussain, Helmi Mohamed

doi:10.1007/978-3-642-22288-7_11

Cited by 7 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides, the modified protocol figures out the aforementioned particular situation. Even though the aggregated timestamps ATS 3 of V 1 and ATS 3 ' of V 2 are very similar, the certificates have different previous RSU information PID 1 and PID 2 . Therefore, the certificates can avoid the misjudgment.…”

Section: B Driver's Privacy Protectionmentioning

confidence: 99%

“…The estimated signature generation time is 36.82ms and the verification requires 38.05ms [1]. SHA-1 generates a hash value of 20 bytes long.…”

Section: Simulation and Performance Evaluationmentioning

confidence: 99%

“…For the consistency with signature, we adopt Elliptic Curve Cryptography (ECC) encryption and decryption with a key of 163bits for our asymmetric algorithm. The estimated encryption and decryption time are 2.65ms and 1.31ms, respectively [1]. Generating an update request by a vehicle requires one signature generation (36.82ms), one asymmetric encryption (2.65ms) and one symmetric encryption (ignored).…”

Section: B Processing Timementioning

confidence: 99%

“…In this paper, based on our preliminary work [19], we introduce two temporary certificate-based approaches. Our schemes are designed to satisfy two goals: (1) to minimize the requirements of the system architecture and the computational costs for the certificate management; and (2) the ability to deploy in an early-stage VANET.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Defense against Sybil attack in the initial deployment stage of vehicular ad hoc network based on roadside unit support

Park

Aslam

Turgut

et al. 2013

Security Comm Networks

View full text Add to dashboard Cite

Abstract-In this paper, we propose two certificate mechanisms for preventing the Sybil attack in a vehicular ad hoc network (VANET): the timestamp series approach and the temporary certificate approach. We focus on an early-stage VANET when the number of smart vehicles is only a small fraction of the vehicles on the road and the only infrastructure components available are the roadside units (RSUs). Unlike previously proposed schemes, which require a dedicated vehicular public key infrastructure to certify individual vehicles, in our approach the RSUs are the only components issuing certificates. The vehicles can obtain certificates by simply driving by RSUs, without the need to pre-register at a certificate authority (CA).The timestamp series approach exploits the fact that due to the variance of the movement patterns of the vehicles, it is extremely rare that the two vehicles pass by a series of RSUs at exactly the same time points. The vehicles obtain a series of certificates signed by the RSUs, which certify their passing by at the RSU at a certain timepoint. By exploiting the spatial and temporal correlation between vehicles and RSUs, the Sybil attack can be detected by checking the similarity of timestamp series.In the temporary certificate-based approach, an RSU issues temporary certificates valid only in a particular area for a limited time. To guarantee that each vehicle is assigned only a single certificate, at the issuance of the first certificate it is required that the RSU physically authenticate the vehicle. When driving by the subsequent RSUs, however, the certificate can be updated in chained manner. By guaranteeing that each vehicle is issued a single certificate in a single area, the Sybil attack is prevented.We provide mathematical analysis and simulation for the timestamp series approach. The simulation shows that it works with a small false-positive rate in simple roadway architecture.

show abstract

Section: B Driver's Privacy Protectionmentioning

confidence: 99%

“…The estimated signature generation time is 36.82ms and the verification requires 38.05ms [1]. SHA-1 generates a hash value of 20 bytes long.…”

Section: Simulation and Performance Evaluationmentioning

confidence: 99%

Section: B Processing Timementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Defense against Sybil attack in the initial deployment stage of vehicular ad hoc network based on roadside unit support

Park

Aslam

Turgut

et al. 2013

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…So using ECC [14] [15] in the SET instead of RSA improves the performance and velocity of internet exchange gains enhancement thoughtlessly There is a distinguished benefit to ECDSA over DSA [7], RSA: the resultant signature size is much smaller. The 160-bit version of the ECDSA [3][4] [5] is roughly alike to a 1024-bit RSA. Smaller parameters can be used in ECDSA than in other competitive systems such as RSA and DSA, but with the same levels of security.…”

Section: Introductionmentioning

confidence: 99%

Design of a Dual Signature Scheme using ECDSA in Set Protocol

Sarkar¹,

Tripathi²

2014

IJCA

View full text Add to dashboard Cite

Dual signature is a significant modernization of SET protocol. The function of the dual signature is to guarantee the authenticity and integrity of data. It links two messages wished-for for two different recipients In this case; the customer wants to send the order information (OI) to the trader and the payment information (PI) to the bank. The one recipient should not need to know another recipient's information. The link is needed so that the customer can confirm that the payment is intended for this order.Elliptic Curve Digital Signature Algorithm (ECDSA) which is one of the variants of Elliptic Curve Cryptography (ECC) have newly come into wide consideration, particularly by the standard developers, as an alternatives to established standard cryptosystems such as the integer factorization cryptosystems and the cryptosystems based on the discrete logarithm problem. The main reason for the attractiveness of ECDSA is the fact that there is no sub exponential algorithm known to solve the elliptic curve discrete logarithm problem on a properly chosen elliptic curve. The present work is first designing a dual signature scheme with ECDSA then comparing their experimental running-times with RSA in an attempt to measure the experimental time efficiencies of each. Simulation results show that proposed design of dual signature scheme reduces the design complexity and computation time of dual signature generation at the same time when ECDSA is applied for dual signature in place of RSA in SET protocol it scales enhanced than RSA.

show abstract

A key agreement authentication protocol using an improved parallel Pollard rho for electronic payment system

Vincent

Lawal

2017

J Supercomput

View full text Add to dashboard Cite

Improving Smart Card Security Using Elliptic Curve Cryptography over Prime Field (F p )

Cited by 7 publications

References 12 publications

Defense against Sybil attack in the initial deployment stage of vehicular ad hoc network based on roadside unit support

Defense against Sybil attack in the initial deployment stage of vehicular ad hoc network based on roadside unit support

Design of a Dual Signature Scheme using ECDSA in Set Protocol

A key agreement authentication protocol using an improved parallel Pollard rho for electronic payment system

Contact Info

Product

Resources

About