An computation-efficient generalized group-oriented cryptosystem

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

A Group-Oriented Cryptosystem (GOC) allows a sender to encrypt a message sent to a group of users so only the specified sets of users in that group can cooperatively decrypt the message. Recently, Li et al. pointed out unauthorized sets in the receiving group can recover the encrypted messages in Yang et al.'s GOC; and they further repaired this security flaw. However, the improved GOC contains inexact security analysis. Further, conversion of the scheme into a threshold cryptosystem results in inefficiency. This study enhances Li et al.'s GOC, both in that it achieves the requirements of GOC but also that it can be efficiently converted into a threshold cryptosystem. Under the decisional Diffie-Hellman problem assumption, the proposed scheme is demonstrated to be provably secure against chosen plaintext attacks.

Original languageEnglish
Pages (from-to)307-319
Number of pages13
JournalInformatica
Volume21
Issue number3
Publication statusPublished - 2010

Fingerprint

Cryptosystem
Cryptography
Security Analysis
Diffie-Hellman
Attack
Defects
Requirements

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Cite this

@article{8f4b9fa027d84c749f66a3e2cfd6aa02,
title = "An computation-efficient generalized group-oriented cryptosystem",
abstract = "A Group-Oriented Cryptosystem (GOC) allows a sender to encrypt a message sent to a group of users so only the specified sets of users in that group can cooperatively decrypt the message. Recently, Li et al. pointed out unauthorized sets in the receiving group can recover the encrypted messages in Yang et al.'s GOC; and they further repaired this security flaw. However, the improved GOC contains inexact security analysis. Further, conversion of the scheme into a threshold cryptosystem results in inefficiency. This study enhances Li et al.'s GOC, both in that it achieves the requirements of GOC but also that it can be efficiently converted into a threshold cryptosystem. Under the decisional Diffie-Hellman problem assumption, the proposed scheme is demonstrated to be provably secure against chosen plaintext attacks.",
author = "Chang, {Ting Yi}",
year = "2010",
language = "English",
volume = "21",
pages = "307--319",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "3",

}

An computation-efficient generalized group-oriented cryptosystem. / Chang, Ting Yi.

In: Informatica, Vol. 21, No. 3, 2010, p. 307-319.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An computation-efficient generalized group-oriented cryptosystem

AU - Chang, Ting Yi

PY - 2010

Y1 - 2010

N2 - A Group-Oriented Cryptosystem (GOC) allows a sender to encrypt a message sent to a group of users so only the specified sets of users in that group can cooperatively decrypt the message. Recently, Li et al. pointed out unauthorized sets in the receiving group can recover the encrypted messages in Yang et al.'s GOC; and they further repaired this security flaw. However, the improved GOC contains inexact security analysis. Further, conversion of the scheme into a threshold cryptosystem results in inefficiency. This study enhances Li et al.'s GOC, both in that it achieves the requirements of GOC but also that it can be efficiently converted into a threshold cryptosystem. Under the decisional Diffie-Hellman problem assumption, the proposed scheme is demonstrated to be provably secure against chosen plaintext attacks.

AB - A Group-Oriented Cryptosystem (GOC) allows a sender to encrypt a message sent to a group of users so only the specified sets of users in that group can cooperatively decrypt the message. Recently, Li et al. pointed out unauthorized sets in the receiving group can recover the encrypted messages in Yang et al.'s GOC; and they further repaired this security flaw. However, the improved GOC contains inexact security analysis. Further, conversion of the scheme into a threshold cryptosystem results in inefficiency. This study enhances Li et al.'s GOC, both in that it achieves the requirements of GOC but also that it can be efficiently converted into a threshold cryptosystem. Under the decisional Diffie-Hellman problem assumption, the proposed scheme is demonstrated to be provably secure against chosen plaintext attacks.

UR - http://www.scopus.com/inward/record.url?scp=78650293296&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650293296&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:78650293296

VL - 21

SP - 307

EP - 319

JO - Informatica

JF - Informatica

SN - 0868-4952

IS - 3

ER -