scispace - formally typeset
Journal ArticleDOI

User-anonymous and short-term Conference Key Distribution System via link-layer routing in mobile communications

Reads0
Chats0
TLDR
This paper designs a user-anonymous and short-term Conference Key Distribution System (CKDS) to ensure secure communications over an open channel and to protect the identities of the users.
Abstract
There are occasions when some people carry their portable devices to a hotel room or office to hold a short-term conference over wireless networks. This paper designs a user-anonymous and short-term Conference Key Distribution System (CKDS) to ensure secure communications over an open channel and to protect the identities of the users. Furthermore, linker-layer routing between the Mobile Hosts (MHs) makes it possible for MHs to directly communicate with one another. Under the random oracle model and the elliptic curve version of the Computational Diffie-Hellman (CDH) assumption, the proposed system is demonstrated to be provably secure against active adversaries. Compared with previously proposed systems, the proposed system is efficient in terms of communication and computational complexity, and is suitable for low-power mobile devices.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A secure routing protocol with node selfishness resistance in MANETs

TL;DR: The proposed routing protocol with payment mechanism not only avoids the sel?sh nodes that may refuse to route packets, but also restrains the nodes from sending useless packets into the networks.
Journal Article

Attack on An ID-based Authenticated Group Key Exchange Protocol with Identifying Malicious Participants

TL;DR: It is shown that Wu et al.'s protocol is insecure against an insider colluding attack and the authors figure out what has gone wrong with the protocol and how to fix it.
Journal Article

A Conference Key Scheme Based on the Die-Hellman Key Exchange

TL;DR: The protocol bases on the two-party Diffie-Hellman protocol to build intermediate keys from each subgroups gradually until the entire conference key is obtained, which will reduce the times of encryption and decryption than butterfly scheme key distribution systems.
Journal ArticleDOI

Cryptanalysis of some user identification schemes for distributed computer networks

TL;DR: This paper presents two attacks to examine that some user identification schemes have a serious security loophole, and proposes a new user identification scheme, which is more secure than the existing schemes.
References
More filters
Proceedings ArticleDOI

Random oracles are practical: a paradigm for designing efficient protocols

TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Journal ArticleDOI

Security problems in the TCP/IP protocol suite

TL;DR: A variety of attacks based on a number of serious security flaws inherent in the TCP/IP protocols are described, including sequence number spoofed, routing attacks, source address spoofing, and authentication attacks.
Journal ArticleDOI

The State of Elliptic Curve Cryptography

TL;DR: This paper surveys the development of elliptic curve cryptosystems from their inception in 1985 by Koblitz and Miller to present day implementations.
Book

Modern Cryptography: Theory and Practice

Wenbo Mao
TL;DR: This book explains why "textbook crypto" is only good in an ideal world where data are random and bad guys behave nicely, and reveals the general unfitness of "textbooks crypto" for the real world by demonstrating numerous attacks on such schemes, protocols and systems under various real-world application scenarios.
Proceedings ArticleDOI

Provably authenticated group Diffie-Hellman key exchange

TL;DR: This paper presents a security model for this problem and uses it to precisely define AKE (with "implicit" authentication) as the fundamental goal, and the entity-authentication goal as well, and defines the execution of an authenticated group Diffie-Hellman scheme and proves its security.
Related Papers (5)