Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
4,912
result(s) for
"Impersonation."
Sort by:
The woman priest : a translation of Sylvain Maréchal's novella, La femme abbé
\"In pre-revolutionary Paris, a young woman falls for a handsome young priest. To be near him, she dresses as a man, enters his seminary, and is invited to become a fully ordained Catholic priest, a career forbidden to women then as now. Sylvain Maréchal's epistolary novella offers a biting rebuke to religious institutions and a hypocritical society; its views on love, marriage, class, and virtue remain relevant today. The book ends in la Nouvelle France, which had become part of Canada during Maréchal's lifetime. With thorough notes and introduction by Sheila Delany, this first translation of Maréchal's novella, La femme abbé, brings a little-known but revelatory text to the attention of readers interested in French history and literature, history of the novel, women's studies, and religious studies.\"-- Provided by publisher.
BOOK
SE-CPPA: A Secure and Efficient Conditional Privacy-Preserving Authentication Scheme in Vehicular Ad-Hoc Networks
Communications between nodes in Vehicular Ad-Hoc Networks (VANETs) are inherently vulnerable to security attacks, which may mean disruption to the system. Therefore, the security and privacy issues in VANETs are entitled to be the most important. To address these issues, the existing Conditional Privacy-Preserving Authentication (CPPA) schemes based on either public key infrastructure, group signature, or identity have been proposed. However, an attacker could impersonate an authenticated node in these schemes for broadcasting fake messages. Besides, none of these schemes have satisfactorily addressed the performance efficiency related to signing and verifying safety traffic-related messages. For resisting impersonation attacks and achieving better performance efficiency, a Secure and Efficient Conditional Privacy-Preserving Authentication (SE-CPPA) scheme is proposed in this paper. The proposed SE-CPPA scheme is based on the cryptographic hash function and bilinear pair cryptography for the signing and verifying of messages. Through security analysis and comparison, the proposed SE-CPPA scheme can accomplish security goals in terms of formal and informal analysis. More precisely, to resist impersonation attacks, the true identity of the vehicle stored in the tamper-proof device (TPD) is frequently updated, having a short period of validity. Since the MapToPoint hash function and a large number of cryptography operations are not employed, simulation results show that the proposed SE-CPPA scheme outperforms the existing schemes in terms of computation and communication costs. Finally, the proposed SE-CPPA scheme reduces the computation costs of signing the message and verifying the message by 99.95% and 35.93%, respectively. Meanwhile, the proposed SE-CPPA scheme reduces the communication costs of the message size by 27.3%.
Journal Article
The almost truth
When a teenaged con artist realizes that she looks like an age-enhanced photo of a missing child, she decides to pull the ultimate con--until she begins to suspect she may actually be the missing child.
BOOK
A secure authentication scheme for VANETs with batch verification
Vehicular Ad-hoc Networks (VANETs) will start becoming deployed within the next decade. Among other benefits, it is expected that VANETs will support applications and services targeting the increase of safety on the road, and assist in improving the efficiency of the road transportation network. However, several serious challenges remain to be solved before efficient and secure VANET technology becomes available, one of them been efficient authentication of messages in a VANET. In this paper, we analyse a recent authentication scheme for VANETs introduced by Lee et al. Unfortunately this scheme is vulnerable to the impersonation attack so that a malicious user can generate a valid signature on behalf of the other vehicles. Based on the attack, we propose an improved scheme and introduce a simulation expressing the efficiency of the proposed scheme.
Journal Article
The great impersonation
\"The year is 1913. The disgraced and formerly penniless aristocrat Sir Everard Dominey returns from Africa a reformed and wealthy man, determined to take his place in society. But is he Sir Everard--or the German spy, Baron Leopold von Ragastein? Written by the \"Prince of Storytellers,\" this landmark spy novel's fast-moving plot teems with vivid characters that offer a compelling portrait of the English aristocracy before the Great War\"-- Provided by publisher.
Book
An improved and provably secure privacy preserving authentication protocol for SIP
Session Initiation Protocol (SIP) has proved to be the integral part and parcel of any multimedia based application or IP-based telephony service that requires signaling. SIP supports HTTP digest based authentication, and is responsible for creating, maintaining and terminating sessions. To guarantee secure SIP based communication, a number of authentication schemes are proposed, typically most of these are based on smart card due to its temper resistance property. Recently Zhang et al. presented an authenticated key agreement scheme for SIP based on elliptic curve cryptography. However Tu et al. (Peer to Peer Netw. Appl 1–8,
2014
) finds their scheme to be insecure against user impersonation attack, furthermore they presented an improved scheme and claimed it to be secure against all known attacks. Very recently Farash (Peer to Peer Netw. Appl 1–10,
2014
) points out that Tu et al.’s scheme is vulnerable to server impersonation attack, Farash also proposed an improvement on Tu et al.’s scheme. However, our analysis in this paper shows that Tu et al.’s scheme is insecure against server impersonation attack. Further both Tu et al.’s scheme and Farash’s improvement do not protect user’s privacy and are vulnerable to replay and denial of services attacks. In order to cope with these limitations, we have proposed a privacy preserving improved authentication scheme based on ECC. The proposed scheme provides mutual authentication as well as resists all known attacks as mentioned by Tu et al. and Farash.
Journal Article
Godsend
\"Inspired by the story of John Walker Lindh, the \"American Taliban,\" Whiting Award winner John Wray explores the circumstances that could impel a young American to exchange identity, home, and to become an Islamist militant\"-- Provided by publisher.
Book
Design and analysis of data link impersonation attack for wired LAN application layer services
Impersonation attack, also known as MAC spoofing, is widespread in wireless local area networks. Under this attack, the senders cannot control the device that listens to their traffic. On the other hand, the physical layer of the wired local area network is more secure, where the traffic is transmitted through cables and network nodes to the intended receivers. Each network node builds its MAC address table, which states stations that are physically connected (directly or indirectly) to each port, so traffic encryption is an unnecessary process. This paper discusses the design and testing of a new attack called a data link impersonation attack. In this attack, the attacker is considered a hardware intruder that deceives data link layer apparatus like the switches of layer two or three, taking advantage of a vulnerability in the MAC address table of the network nodes. That leads the network switches to send all the network traffic to the intruder instead of the real network device (usually a network service provider under attack). Intruder accepts all incoming requests/traffic from the service requester. If the intruder does not reply to the received requests sent by service requesters, it acts as a black hole intruder, simply causing a denial-of-service attack. If an intruder responds to these requests with fake replies to steal information from service requesters, it acts as a white hole intruder. During the attack, the intruder is transparent for the whole network and does not affect overall network performance and generally the network services, so it is so hard to be discovered by the network software running the network apparatus. Different scenarios were tested using different network simulators and physical networks (CISCO L2/L3 switches). It is demonstrated that the attacker is successfully denied the service/application under attack. The proposed attack reveals the new vulnerability of the wired local area network and opens the door for network scientists to enhance network software that runs the network apparatus immune against the proposed attack.
Journal Article
A New Lightweight User Authentication and Key Agreement Scheme for WSN
The Internet of Things (IoT) is one of the most up-to-date and newest technologies that allows remote control of heterogeneous networks and has a good outlook for industrial applications. Wireless sensor networks (or in brief WSNs) have a key role on the Internet of industrial objects. Due to the limited resources of the sensor nodes, designing a balanced authentication scheme to provide security in reasonable performance in wireless sensor networks is a major challenge in these applications. So far, several security schemes have been presented in this context, but unfortunately, none of these schemes have provided desired security in reasonable cost. In 2017, Khemissa et al. proposed a security protocol for mutual authentication between sensor node and user in WSNs, however, in this paper we show that this protocol is not safe enough in the confrontation of desynchronization, user impersonation and gateway impersonation attacks. The proposed attacks succeed with the probability of one and to be realized only require an execution of the protocol. Given merits of the Khemissa et al.’s protocol, we also improved their protocol in such a way that provides suitable level of security, and also we prove its security using two formal ways, i.e. BAN logic and also the Scyther tool. We also argue informally about the improved protocol’s security.
Journal Article