Cryptanalysis of Modification to Self-Certified Group-Oriented Cryptosystem without A Combiner

نویسندگان

  • Willy Susilo
  • Hiroaki Kikuchi
چکیده

In a (t, n) group-oriented cryptosystem collaboration of at least t participants is required to perform a designated cryptographic operation. This type of cryptographic operation is very important to support an ad-hoc type network, such as the one that is built using Bluetooth or ad-hoc wireless LAN, since the existence of a combiner is not required to decrypt an encrypted message. In the earlier paper, it was shown that a group-oriented encryption scheme, as proposed by Saeednia and Ghodosi, can be subjected to a conspiracy attack in which two participants collude to decrypt an encrypted message. Recently, it was shown that the modified scheme is subjected to a conspiracy attack of at least three group members with probability 0.608. In this paper, we show a stronger result that shows any conspiracy of at least three group members can collude and decrypt an encrypted message.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Self-Certified Group-Oriented Cryptosystem Without a Combiner

In a (t;n) group-oriented cryptosystem, collaboration of at least t participants is required to perform the group transformation. Two important issues in implementation of a such cryptosystems are: 1. the sender needs to collect authenticated public keys of the intended receivers; 2. the combiner needs a secure channel to collect (privately) the partial results from collaborating participants. ...

متن کامل

Improved self-certified group-oriented cryptosystem without a combiner

In 2001, Ghodosi and Saeednia proposed a self-certified group-oriented cryptosystem without a combiner to prevent the Susilo et al. s attack. However, in this paper we will show that their scheme is still insecure and probably suffers from the conspired attack. To remedy the weakness, an enhanced version is proposed while providing the new functionality to confirm the source of the encrypted me...

متن کامل

A Cryptanalysis on a Generalized Threshold Cryptosystem

In 1987, Desmedt first proposed a group oriented cryptosystem. During the past decade, group oriented cryptosystem has become one of the important cryptographical primitives. Laih and Harn proposed a generalized threshold cryptosystem with two models in 1991. In their system, each group is only assigned public key. A ciphertext can be decoded by utilizing all the secret keys owned by the users ...

متن کامل

Cryptanalysis of Improved Liaw's Broadcasting Cryptosystem

A secure broadcasting cryptosystem must provide a secure communication channel from a sender to a group of legal or authorized receivers. Many of the proposed systems [3-5] require a large number of broadcast messages and present a number of problems. Moreover, Liaw [2] proposed a secure broadcasting scheme with fewer broadcasting messages, which allows easy insertion of new users into the acti...

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Network Security

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2007