An efficient signcryption scheme with forward secrecy and public verifiability based on hyper elliptic curve cryptography

Ashraf, Shehzad; Uddin, Nizam; Sher, Muhammad; Ghani, Anwar; Naqvi, Husnain; Irshad, Azeem

doi:10.1007/s11042-014-2283-9

Cited by 46 publications

(25 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further, a vehicle should register using services provided by RS before it joins the session or after it departs from session. The forward secrecy and backward secrecy properties are implied and defined in Ch et al 35 Authenticated vehicle. The RS needs to guarantee that its use of LBS services is only for its subscribers.…”

Section: Trust Management System Requirementsmentioning

confidence: 99%

MADPTM: Mix zones and dynamic pseudonym trust management system for location privacy

Memon

Mirza

2018

Int J Communication

View full text Add to dashboard Cite

Summary In intelligent transportation systems, the messages transmitted and received from one vehicle to another vehicle may enhance location privacy scheme; falsification message forwarding collusion attack, timing, and transition attacks all are serious issues and must be addressed in event trust management. Without which, decision making on event message may endanger the whole transportation system and may even threat the human life. In addition, pseudonym expiry is another critical issue of location privacy. The time interval of decision waiting even has been the critical accident response time. In this paper, we proposed a new novel mix zones and dynamic pseudonym trust management system, called MADPTM, which aims to prevent against attackers under privacy‐enhanced road networks. On shortening the pseudonym expiry, we propose dynamic pseudonym trust management system, with the assistance of reported server. We performed a set of simulations under many trust attack models to evaluate the performance and efficiency of the proposed system. Our proposed MADPTM method proved to be highly resilient to various attacks, and simulation results verified that our method outperforms other existing methods.

show abstract

Section: Trust Management System Requirementsmentioning

confidence: 99%

MADPTM: Mix zones and dynamic pseudonym trust management system for location privacy

Memon

Mirza

2018

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Moreover, they analyzed the security of their protocol in terms of authenticity, unforgeability, confidentiality, nonrepudiation and forward secrecy. As mentioned previously, the signcryption protocols (Zheng, 1997;Zheng and Imai, 1998;Deng and Bao, 1998;Jung et al, 2001;Han et al, 2004;Hwang et al, 2005b;Yuan and Hung, 2008;Toorani and Beheshti, 2009;Mohapatra, 2010;Ashraf et al, 2015;Nasreldin et al, 2015b;Singh 2016) are based on ECC that will be described in details in the next subsection.…”

Section: Digital Forensics In Cloud Computingmentioning

confidence: 99%

Accelerating Digital Forensics through Parallel Computing

ElKabbany¹,

Rasslan²,

Aslan³

2018

Journal of Computer Science

View full text Add to dashboard Cite

Digital crimes in the era of big data and cloud computing imposes significant challenges in digital forensics. Cloud environment provides low cost, easy management and reasonable solutions. Moreover, it supports big data structures and solutions (i.e., security, privacy and digital forensics). In order to achieve a secure digital forensics analysis in cloud environment, researchers have proposed solutions with expensive communication cost and computation overheads. Among these solutions Nasereldin et al. proposed a protocol which solves the problem of authenticity and integrity of evidence using signcryption technique. This leads to low communication and implementation overheads. Furthermore, identity-based cryptography is used to solve Public Key Infrastructure (PKI) problems. In addition, it is characterized by the ability to divide the message into small messages which is suitable for pipelining techniques. Nasreldin et al.'s signcryption protocol is based on Elliptic Curve Cryptography (ECC) which is implemented by using different mathematical operations. In this protocol, ECC mathematical operations take huge time during the execution of the algorithm. ECC consists of point doubling and point addition operations. These operations require the execution of many Montgomery modular multiplications that consume time. In this study, we introduce a technique to speed up ECC operations in order to enhance the efficiency of Nasreldin et al. protocol. In particular, we propose a multi-stage parallel design which consists of three stages. First, we speed up the point doubling and point addition operation. Secondly, we enhance the execution time of Montgomery multiplications. Finally, pipelining is used to obtain a better performance. The results show that the proposed design enhances Nasreldin et al. protocol's execution time by 47.1, 64.7, 73.5 and 79.4%, assuming that the number of nodes is 2, 4, 6 and 12, respectively.

show abstract

“…Upon reception of encrypted message and signature tuple, the recipient generate same key and decrypts the message. Finally the recipient verifies the signatures [27][28][29][30][31].…”

Section: Authenticated Encryptionmentioning

confidence: 99%

A secure and efficient authenticated encryption for electronic payment systems using elliptic curve cryptography

Chaudhry

Farash

Naqvi

et al. 2015

Electron Commer Res

Self Cite

View full text Add to dashboard Cite

The use of e-payment system for electronic trade is on its way to make daily life more easy and convenient. Contrarily, there are a number of security issues to be addressed, user anonymity and fair exchange have become important concerns along with authentication, confidentiality, integrity and non-repudiation. In a number of existing e-payment schemes, the customer pays for the product before acquiring it. Furthermore, many such schemes require very high computation and communication costs. To address such issues recently Yang et al. proposed an authenticated encryption scheme and an e-payment scheme based on their authenticated encryption. They excluded the need of digital signatures for authentication. Further they claimed their schemes to resist replay, man-in-middle, impersonation and identity theft attack while providing confidentiality, authenticity, integrity and privacy protection. However our analysis exposed that Yang et al.'s both authenticated encryption scheme and e-payment system are vulnerable to impersonation attack. An adversary just having knowledge of public parameters can easily masquerade as a legal user. Furthermore, we proposed improved authenticated encryption and e-payment schemes to overcome weaknesses of Yang et al.'s schemes. We prove the security of our schemes using automated tool ProVerif. The & Mohammad Sabzinejad Farash improved schemes are more robust and more lightweight than Yang et al.'s schemes which is evident from security and performance analysis.

show abstract

An efficient signcryption scheme with forward secrecy and public verifiability based on hyper elliptic curve cryptography

Cited by 46 publications

References 21 publications

MADPTM: Mix zones and dynamic pseudonym trust management system for location privacy

MADPTM: Mix zones and dynamic pseudonym trust management system for location privacy

Accelerating Digital Forensics through Parallel Computing

A secure and efficient authenticated encryption for electronic payment systems using elliptic curve cryptography

Contact Info

Product

Resources

About