A self-encryption authentication protocol for teleconference services

Jiang, Yixin; Chen, Lin; Shi, Minghui; Shen, Xuemin

doi:10.1504/ijsn.2006.011779

Cited by 20 publications

(17 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the literature, a number of protocols have been proposed for conference key establishment [1], [2], [3], [5], [6]. The first conference key agreement protocol was proposed by Ingemasson et al [1] which is a generalization of two party Diffie-Hellman protocol.…”

Section: Introductionmentioning

confidence: 99%

“…The first conference key agreement protocol was proposed by Ingemasson et al [1] which is a generalization of two party Diffie-Hellman protocol. The first conference key establishment scheme for mobile communication was proposed by Hwang and Yang in [2]. Hwang later published an improved solution in [3] to allow dynamic joining and leaving from the conference.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A secure verifiable key agreement protocol for mobile conferencing

Saha

Chowdhury

Sengupta

2008

2008 3rd International Conference on Communication Systems Software and Middleware and Workshops (COMSWARE '08)

View full text Add to dashboard Cite

A growing application area in wireless communications is mobile teleconference. However, wireless communication are more susceptible to eavesdropping and unauthorized access than the wired communication. It is therefore crucial to build secure conference scheme for such communication. In this work, propose a true conference key agreement scheme which addresses some security issues not considered in previous works on conference key schemes. In the proposed protocol, the users can verify the utilization of their share in key construction. Also, the scheme is forward secure, provides mutual authentication and secure dynamic joining and leaving. The protocol is shown to be resistant against replay and impersonation attacks.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A secure verifiable key agreement protocol for mobile conferencing

Saha

Chowdhury

Sengupta

2008

2008 3rd International Conference on Communication Systems Software and Middleware and Workshops (COMSWARE '08)

View full text Add to dashboard Cite

show abstract

“…In a large number of BE applications ranging from DVD encryption [1]- [3] to multicast access control [4]- [9] and teleconference [10] [11], the application data are protected by a symmetric cipher with the (short-term) group key; only legitimate users hold confidential information to first derive the common secret and then decrypt the data:…”

Section: Introductionmentioning

confidence: 99%

“…As a result, these schemes offer a convenience that upon receiving the rekey message, instead of employing a standard decryption (e.g., on a ciphertext extracted from (1), (2), or alike), a member only needs to perform a simple modular operation to derive the secret. Such a remainder approach has been generally adopted in recent works including [7]- [11].…”

Section: Introductionmentioning

confidence: 99%

“…• As depicted in (2), multiple independent remainders are involved in [4], each of which is for a distinct member M i ∈ G respectively, while [7]- [11] employ one universal remainder for the entire group G, which essentially results in the weakness we have discovered. • In [4] each member M i still needs to perform a symmetric decryption as with (1), while in [7]- [11] no member does so.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

General Weakness in Certain Broadcast Encryption Protocols Employing the Remainder Approach

Zhu¹

2008

2008 IEEE International Conference on Communications

View full text Add to dashboard Cite

We address the problem of distributing a grouporiented secret from a centralized key server to a number of privileged recipients, known as broadcast encryption. In a set of existent schemes, this common shared secret is distributed as an arithmetic remainder embedded in a broadcast keying message, such that upon receiving the message, a legitimate recipient only needs to perform one modular operation upon the keying information to derive the secret. In this article, however, we point out a generic weakness in these protocols and demonstrate efficient methods for cryptanalysis. The presented approaches follow a collision attack paradigm and can work in a manner that even a completely passive outsider may somehow acquire the secret. Numerical analysis shows that in practical scenarios, our technique can compromise the common shared secret with a significant probability, implying that these broadcast encryption schemes are highly vulnerable.Index Terms-Data and communication security, broadcast encryption, common secret, remainder, collision, passive outsider attack, magic number. I. INTRODUCTIONThe broadcast encryption (BE) problem [1] [2] involves distributing a common shared secret, typically in the form of a short-term group key, from a centralized key server (KS) to a large number of intended receivers forming a possibly dynamic subscriber group, such that at any give time instance only the privileged group members are able to actually utilize certain application data that are publicly available, e.g., from a broadcast communication channel.In a large number of BE applications ranging from DVD encryption [1]-[3] to multicast access control [4]-[9] and teleconference [10] [11], the application data are protected by a symmetric cipher with the (short-term) group key; only legitimate users hold confidential information to first derive the common secret and then decrypt the data:• In BE solutions, cost-efficient manipulations like arithmetic operations, one-way (hash) functions, and symmetric encryptions / decryptions are preferred in distributing the common secret itself [1]. As an approach for content protection, broadcast encryption is envisioned to promise more flexible and resilient security compared with traditional public-key cryptography techniques [2]. • Moreover, in many cases the receivers are assumed to be stateless [3], i.e., they hold certain static cryptographic information like a pairwise key shared with the KS, and they do not update their rekey states from session to

show abstract

A survey of cyber crimes

Zhang

Xiao

Ghaboosi

et al. 2011

Security Comm Networks

View full text Add to dashboard Cite

With the advancement of computer and information technology, cyber crime is now becoming one of the most significant challenges facing law enforcement organizations. Cyber crimes are generally referred as criminal activities that use computers or networks. An understanding of the characteristics and nature of cyber crimes is important in helping research communities find ways to effectively prevent them. Most existing research focuses more on attacks and attack models, including either actual attacks or imaginary/possible attacks over all layers of networks or computers, but there has been less work carried out on a comprehensive survey of cyber crimes. This paper provides a survey of cyber crimes that have actually occurred. First, cyber crimes in the digital world are compared with crimes in the physical world. Then, cyber crimes are categorized according to the roles of computers or networks. Furthermore, we also notice that some cyber crimes are actually traditionally non‐cyber crimes that are facilitated by computers or networks. It is surprising that there are so many recurrent cyber crimes. More efforts are needed to protect people from cyber crimes. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

A self-encryption authentication protocol for teleconference services

Cited by 20 publications

References 9 publications

A secure verifiable key agreement protocol for mobile conferencing

A secure verifiable key agreement protocol for mobile conferencing

General Weakness in Certain Broadcast Encryption Protocols Employing the Remainder Approach

A survey of cyber crimes

Contact Info

Product

Resources

About