An ID-based group-oriented decryption scheme secure against adaptive chosen-ciphertext attacks

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

ID-based decryption allows a sender to encrypt a message to an identity without access to a public key certificate. This paper proposes an ID-based group-oriented decryption scheme, secure against adaptive chosen-ciphertext attacks, which allows the sender to determine an access structure and generate a valid ciphertext on the chosen message. The correctness of decryption shares can be checked to detect when dishonest users in the access structure provide fake decryption shares. As a result, the message can be cooperatively recovered by users in the determined access structure. The formal proof of security of our scheme is based on the bilinear Diffie-Hellman problem in the random oracle model. Our proposed scheme is more efficient and provides higher security confidence than those in Li et al.'s certificate-based group-oriented decryption scheme.

Original languageEnglish
Pages (from-to)1829-1836
Number of pages8
JournalComputer Communications
Volume32
Issue number17
DOIs
Publication statusPublished - 2009 Nov 15

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{6ab8c0b33c2c45e88feb2016c2e09207,
title = "An ID-based group-oriented decryption scheme secure against adaptive chosen-ciphertext attacks",
abstract = "ID-based decryption allows a sender to encrypt a message to an identity without access to a public key certificate. This paper proposes an ID-based group-oriented decryption scheme, secure against adaptive chosen-ciphertext attacks, which allows the sender to determine an access structure and generate a valid ciphertext on the chosen message. The correctness of decryption shares can be checked to detect when dishonest users in the access structure provide fake decryption shares. As a result, the message can be cooperatively recovered by users in the determined access structure. The formal proof of security of our scheme is based on the bilinear Diffie-Hellman problem in the random oracle model. Our proposed scheme is more efficient and provides higher security confidence than those in Li et al.'s certificate-based group-oriented decryption scheme.",
author = "Chang, {Ting Yi}",
year = "2009",
month = "11",
day = "15",
doi = "10.1016/j.comcom.2009.07.005",
language = "English",
volume = "32",
pages = "1829--1836",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "17",

}

An ID-based group-oriented decryption scheme secure against adaptive chosen-ciphertext attacks. / Chang, Ting Yi.

In: Computer Communications, Vol. 32, No. 17, 15.11.2009, p. 1829-1836.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An ID-based group-oriented decryption scheme secure against adaptive chosen-ciphertext attacks

AU - Chang, Ting Yi

PY - 2009/11/15

Y1 - 2009/11/15

N2 - ID-based decryption allows a sender to encrypt a message to an identity without access to a public key certificate. This paper proposes an ID-based group-oriented decryption scheme, secure against adaptive chosen-ciphertext attacks, which allows the sender to determine an access structure and generate a valid ciphertext on the chosen message. The correctness of decryption shares can be checked to detect when dishonest users in the access structure provide fake decryption shares. As a result, the message can be cooperatively recovered by users in the determined access structure. The formal proof of security of our scheme is based on the bilinear Diffie-Hellman problem in the random oracle model. Our proposed scheme is more efficient and provides higher security confidence than those in Li et al.'s certificate-based group-oriented decryption scheme.

AB - ID-based decryption allows a sender to encrypt a message to an identity without access to a public key certificate. This paper proposes an ID-based group-oriented decryption scheme, secure against adaptive chosen-ciphertext attacks, which allows the sender to determine an access structure and generate a valid ciphertext on the chosen message. The correctness of decryption shares can be checked to detect when dishonest users in the access structure provide fake decryption shares. As a result, the message can be cooperatively recovered by users in the determined access structure. The formal proof of security of our scheme is based on the bilinear Diffie-Hellman problem in the random oracle model. Our proposed scheme is more efficient and provides higher security confidence than those in Li et al.'s certificate-based group-oriented decryption scheme.

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

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

U2 - 10.1016/j.comcom.2009.07.005

DO - 10.1016/j.comcom.2009.07.005

M3 - Article

AN - SCOPUS:69249215230

VL - 32

SP - 1829

EP - 1836

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 17

ER -