Identity-Based Anonymous Remote Authentication for Value-Added Services in Mobile Networks

Cao, Xiaofeng; Zeng, Xingwen; Kou, Weidong; Hu, Liangbing

doi:10.1109/tvt.2009.2012389

Cited by 55 publications

(40 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Section 5.2 makes comparisons based on computation and communication costs. Table 2 shows the computational time of public key operations under the same security level [43]. The notations TRSA-SIG-DEC, TRSA-VFY-ENC, TPAIR, and TECSM in Table 2 represent one RSA signing/decryption with a 1024-bit modulus, one RSA verification/encryption with a 1024-bit modulus, one admissible bilinear pairing, and one elliptic curve-based scalar multiplication as suggested by IEEE Standard P1363.3 [44], respectively.…”

Section: Discussionmentioning

confidence: 99%

Provable Fair Document Exchange Protocol with Transaction Privacy for E-Commerce

Hwang

Lai

2015

Symmetry

View full text Add to dashboard Cite

Abstract:Transaction privacy has attracted a lot of attention in the e-commerce. This study proposes an efficient and provable fair document exchange protocol with transaction privacy. Using the proposed protocol, any untrusted parties can fairly exchange documents without the assistance of online, trusted third parties. Moreover, a notary only notarizes each document once. The authorized document owner can exchange a notarized document with different parties repeatedly without disclosing the origin of the document or the identities of transaction participants. Security and performance analyses indicate that the proposed protocol not only provides strong fairness, non-repudiation of origin, non-repudiation of receipt, and message confidentiality, but also enhances forward secrecy, transaction privacy, and authorized exchange. The proposed protocol is more efficient than other works.

show abstract

Section: Discussionmentioning

confidence: 99%

Provable Fair Document Exchange Protocol with Transaction Privacy for E-Commerce

Hwang

Lai

2015

Symmetry

View full text Add to dashboard Cite

show abstract

“…We discuss security properties of the above four aspects in these schemes respectively. The scheme in [27] only has the property nonrepudiation and unlinkability. In [19], only nonrepudiation property is satisfied.…”

Section: Unlinkabilitymentioning

confidence: 99%

Practical blacklist-based anonymous authentication scheme for mobile crowd sensing

Jia

Yang

et al. 2015

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

Mobile crowd sensing (MCS) represents one of the most promising approaches for improving life quality of individuals with sensing and computing devices. MCS is playing a more and more important role in various fields of service, such as traffic monitoring and commercial advertisement. Security and privacy of communication in MCS attract increasing attention from the academia and industry since the sensing data are usually sensitive for users. Some users worry about the leakage of their private information when they share their data to the third parties. To address this issue, in this paper, we propose a practical blacklist-based anonymous authentication scheme in which users can enjoy an anonymous environment and share their information without worrying about any information leakage. Security analysis shows that our scheme can achieve anonymity, blacklistability, nonrepudiation and unlinkability. Performance evaluation demonstrates that our scheme is more efficient in terms of computation overhead compared with the existing works.

show abstract

“…A tree-based authentication scheme and suffers from a high amount of overhead on the non-signature packets. The new protocols discussed in [4], [5], [9], [10], [11], [18], [23], [26] for authenticating the mobile users and it enjoys better computation efficiency and security like [8], [12]. And also these schemes do not require long term secret keys on the server and not suited for the large power devices.…”

Section: Related Workmentioning

confidence: 99%

“…An enhanced key exchange protocol is proposed in [10], provides anonymous remote authentication. The scheme proposed in [9] differs from [21] in the way that provides authentication with the help of client account index, which helps to realize client anonymity with no encryption operations. An ID-based signature scheme is followed the Weil pairing algorithm and is secure if the Diffie-Hellman problem is hard.…”

Section: Related Workmentioning

confidence: 99%

Re-authentication in Wireless Sensor Network

Selvalingam¹,

Mahalakshmi²,

Jinna³

2012

IJCA

View full text Add to dashboard Cite

In an unprotected environment of Wireless Sensor Network, the authentication scheme for multicast secure communication has to be designed with limited usage of resources and computation. In Multicast Authentication Based on Batch Signature-Enhanced (MABS-E) scheme, a tree construction to counteract the Denial of Service (DoS) attack requires latency at the sender. This authentication latency leads to the jitter effect on real-time applications at the receiver. In few applications, user mobility is considered for authentication process. And also, due to user mobility, the sensor node is compromised. This paper proposes a technique called Batch based Selective Bin Verification (BSBV), which avoids the construction of merkle tree. It reduces latency and allows the receiver to tolerate DoS attack even in the case where the attack fails to be detected. In order to prevent to compromise a node, re-authentication scheme is employed, can prolong the lifetime of the sensor network is provided. The number of inspections of each packet is decreased when binning technique is used. In BSBV technique, the packet failure rate is decreased to 0.01 from 0.04 because all are verified with the batch verification, when the chosen bin is two. The Packet Delivery Ratio is 82.95% when fifteen malicious nodes are presented.

show abstract

Identity-Based Anonymous Remote Authentication for Value-Added Services in Mobile Networks

Cited by 55 publications

References 14 publications

Provable Fair Document Exchange Protocol with Transaction Privacy for E-Commerce

Provable Fair Document Exchange Protocol with Transaction Privacy for E-Commerce

Practical blacklist-based anonymous authentication scheme for mobile crowd sensing

Re-authentication in Wireless Sensor Network

Contact Info

Product

Resources

About