Desired Security Features Research Articles

A bilinear pairing based anonymous authentication scheme in wireless body area networks for mHealth.

Wireless body area networks (WBANs) have become one of the key components of mobile health (mHealth) which provides 24/7 health monitoring service and greatly improves the quality and efficiency of healthcare. However, users' concern about the security and privacy of their health information has become one of the major obstacles that impede the wide adoption of WBANs. Anonymous and unlinkable authentication is critical to protect the security and privacy of sensitive physiological information in transit from the client to the application provider. We first show that the anonymous authentication scheme of Wang and Zhang based on bilinear pairing is prone to client impersonation attack. Then, we propose an enhanced anonymous authentication scheme to remedy the flaw in Wang and Zhang's scheme. We give the security analysis to demonstrate that the enhanced scheme achieves the desired security features and withstands various known attacks.

A privacy‐aware two‐factor authentication protocol based on elliptic curve cryptography for wireless sensor networks

SummaryAs one of the enabling components of Internet of things (IoT), wireless sensor networks (WSNs) have found applications in a wide range of fields, in which outside users need to directly interact with sensors to obtain sensed data. However, WSNs are vulnerable to various attacks over wireless links, such as eavesdropping and tampering. How to ensure that sensitive or critical information is only available to legal users becomes a challenging issue. Two‐factor authentication combining password and smart card perfectly matches this requirement because of its practicality. However, a dozen of two‐factor authentication protocols have been suggested in recent years. Owing to the challenging mission of reconciling efficiency and security requirements, it is still challenging to propose a privacy‐aware two‐factor protocol that is capable of providing various security features while maintaining acceptable efficiency. In this paper, we put forward a privacy‐aware two‐factor authentication protocol based on elliptic curve cryptography for WSNs. Our new protocol accomplishes various security features necessary for real‐life application environments while maintaining acceptable efficiency. We prove that the new protocol fulfills mutual authentication in the Burrows–Abadi–Needham logic. Additionally, by way of informal security analysis, we show that the new protocol can withstand a variety of attacks and provide desirable security features. Copyright © 2016 John Wiley & Sons, Ltd.

Cost-Effective Security Support in Real-Time Video Surveillance

Visual surveillance has numerous applications. It can support public safety, traffic monitoring, and facility protection to name just a few. Networked digital surveillance devices are revolutionizing the surveillance industry by supporting high quality images, remote monitoring, and advanced image processing. However, they also raise serious privacy/security concerns. To address the issue, the surveillance industry has recently begun to provide basic support for secure communications. In this paper, we present a new protocol to significantly enhance the security and performance compared with the state-of-the-art baseline method widely taken in the video surveillance industry. Through extensive experiments for performance evaluation, our approach is shown to substantially reduce the delay to execute cryptographic mechanisms and increase the supported bit rate compared with the baseline, while providing desirable security features.

Robust extended chaotic maps-based three-factor authentication scheme preserving biometric template privacy

Due to its high level of security, three-factor authentication combining password, smart card and biometrics has received much interest in the past decades. Recently, Islam proposed a dynamic identity-based three-factor authentication scheme using extended chaotic map which attempts to fulfill three-factor security and resist various known attacks, offering many advantages over existing works. However, in this paper we first show that the process of password verification in the login phase is invalid. Besides this defect, it is also vulnerable to user impersonation attack and off-line password guessing attack, under the condition that the smart card is lost or stolen. Furthermore, it fails to preserve biometric template privacy in the case that the password and the smart card are compromised. To remedy these flaws, we propose a robust three-factor authentication scheme, which not only resists various known attacks, but also provides more desired security features. We demonstrate that our scheme provides mutual authentication using the Burrows–Abadi–Needham logic. Our scheme provides high security strength as well as low computational cost.

P_PAKA: Privacy Preserving Authenticated Key Agreement Protocol in Smart Grid

The current power grid is changing into a network of interoperating intelligent devices to form a smart grid. One of the technologies enabled by the bi-directional communication of the grid is demand response (DR), which allows regulation of energy loads by efficiently shifting consumer power demand of non-critical appliances from on-peak to off-peak with price incentives for compliance. However, security and privacy of communications between entities are the major constraining factors to the adoption of smart grid applications. Therefore, this paper proposes a privacy preserving authenticated key agreement protocol (P_PAKA) in smart grid that addresses the privacy issues for DR communications. We demonstrate the provision of desirable security features and requirements of confidentiality, integrity and availability in DR with unlinkability.

A survey of authentication schemes for vehicular ad hoc networks

AbstractVehicular ad hoc networks (VANETs) are planned to be deployed within the next decade to improve driver safety, prevent collisions, and provide traffic optimization. Recent years have witnessed an increasing interest in the security schemes for VANETs as this area was relatively less explored compared to other areas such as medium access and routing. In particular, efficient authentication of the messages in a VANET with other desirable security features have been heavily studied. However, there are still several issues to be addressed before such authentication mechanisms can be readily and widely used in real‐life deployments. In this paper, we examine several proposed authentication solutions and categorize them based on certain criteria. We provide a comparison of the advantages and disadvantages of the proposed schemes identifying their suitability under various conditions. Finally, to foster further research in the area, we address some of the challenges that need to be tackled in the future in order to realize the deployment of VANETs. Copyright © 2010 John Wiley & Sons, Ltd.

Securing credit card transactions with one-time payment scheme

Traditional credit card payment is not secure against credit card frauds because an attacker can easily know a semi-secret credit card number that is repetitively used. Recently one-time transaction number has been proposed by some researchers and credit card companies to enhance the security in credit card payment. Following this idea, we present a practical security enhancement scheme for one-time credit card payment. In our scheme, a hash function is used in generation of one-time credit card numbers with a secret only known to the card holder and issuer. Compared with related work, our scheme places less burden on credit card issuers, and can be easily deployed in on-line or off-line payment scenarios. Analysis and simulation show that the time and space complexity is affordable to the card issuer with desired security features.

SIGEST

Previous article Next article Full AccessSIGESThttps://doi.org/10.1137/SIREAD000045000004000725000001BibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract The editors of SIAM Review are delighted to present a SIGEST paper about cryptography, a topic that appears frequently these days in mainstream news media. Stories about computer security, defenses against terrorism, privacy, and file swapping invariably refer to cryptographic systems, which thus represent an extraordinarily visible example of the practical application of mathematics and computer science. Encryption systems depend on a stream of new mathematical results and algorithms; it may take years of study by experts to prove that a proposed technique is secure (or not). An additional wrinkle is that humans tend to avoid any encryption procedure that they perceive to be too much trouble, which means that researchers in cryptography need to consider criteria like ease of use as well as more precise properties. Cryptographers are blessed with, and continue to devise, engaging terminology and even some implied personalities. No discussion of cryptography is complete without Alice and Bob---so much more appealing than A and B---whose roles may, however, vary. For example, Alice and Bob are sometimes friends eager to communicate secrets without others learning them, and sometimes two people who need to communicate but do not know or trust each other; new variations on Alice, Bob, and their relationship are constantly emerging. Another fixture in cryptography is the presumably evil adversary, who may be passive (an eavesdropper limited to observing the information traffic sent between Alice and Bob) or active (someone who can see and modify the traffic). Wide use is made of "zero knowledge proof systems" (an apparently contradictory term), and this paper defines an evocatively named "garbage/not garbage" oracle that is useful in validity checks. The standard requirement of semantic security for cryptosystems means that an adversary learns nothing about the original text (the "plaintext") from its encrypted form (the "ciphertext"). The stricter requirement of nonmalleability, needed to hide information from active adversaries, means, roughly speaking, that an adversary cannot use the ciphertext associated with an original plaintext to produce an encryption of a related plaintext. This issue's SIGEST paper, "Nonmalleable Cryptography," by D. Dolev, C. Dwork, and M. Naor, which first appeared in 2000 in volume 30 of the SIAM Journal on Computing, identified and addressed the concept of nonmalleability. The paper has been extremely influential, is widely cited, and has inspired a substantial level of related research. For the paper's appearance in SIGEST, the authors have added an extended and completely new preface, intended for the general SIREV reader, that introduces much of the terminology, presents easily understood examples, and brings the reader up-to-date on related problems. Section 1.4, on deniable authentication, clarifies some of the many complications in defining new protocols and their desired (or undesired) security features. The original paper itself explores in detail the implications of nonmalleability, presenting nonmalleable schemes for three key problem classes and proving security against strong ciphertext attacks. We are grateful indeed to the authors for their extra efforts to make this important paper accessible to nonexperts in cryptography. Previous article Next article FiguresRelatedReferencesCited ByDetails Volume 45, Issue 4| 2003SIAM Review History Published online:04 August 2006 InformationCopyright © 2003 Society for Industrial and Applied Mathematics Article & Publication DataArticle DOI:10.1137/SIREAD000045000004000725000001Article page range:pp. 725-725ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics