Efficient verifiable ring encryption for ad hoc groups

Joseph K. Liu, Patrick P. Tsang, Duncan S. Wong

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

3 Citations (Scopus)

Abstract

We propose an efficient Verifiable Ring Encryption (VRE) for ad hoc groups. VRE is a kind of verifiable encryption [16,1,4,2,8] in which it can be publicly verified that there exists at least one user, out of a designated group of n users, who can decrypt the encrypted message, while the semantic security of the message and the anonymity of the actual decryptor can be maintained. This concept was first proposed in [10] in the name of Custodian-Hiding Verifiable Encryption. However, their construction requires the inefficient cut-and-choose methodology which is impractical when implemented. We are the first to propose an efficient VRE scheme that does not require the cut-and-choose methodology. In addition, while [10] requires interaction with the encryptor when a verifier verifies a ciphertext, our scheme is non-interactive in the following sense: (1) an encryptor does not need to communicate with the users in order to generate a ciphertext together with its validity proof; and (2) anyone (who has the public keys of all users) can verify the ciphertext, without the help of the encryptor or any users. This non-interactiveness makes our scheme particularly suitable for ad hoc networks in which nodes come and go frequently as ciphertexts can be still generated and/or verified even if other parties are not online in the course. Our scheme is also proven secure in the random oracle model.

Original languageEnglish
Title of host publicationSecurity and Privacy in Ad-hoc and Sensor Networks - Second European Workshop, ESAS 2005, Revised Selected Papers
Pages1-13
Number of pages13
Publication statusPublished - 1 Dec 2005
Externally publishedYes
EventSecond European Workshop on Security and Privacy in Ad-hoc and Sensor Networks, ESAS 2005 - Visegrad, Hungary
Duration: 13 Jul 200514 Jul 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3813 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceSecond European Workshop on Security and Privacy in Ad-hoc and Sensor Networks, ESAS 2005
CountryHungary
CityVisegrad
Period13/07/0514/07/05

Cite this

Liu, J. K., Tsang, P. P., & Wong, D. S. (2005). Efficient verifiable ring encryption for ad hoc groups. In Security and Privacy in Ad-hoc and Sensor Networks - Second European Workshop, ESAS 2005, Revised Selected Papers (pp. 1-13). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3813 LNCS).
Liu, Joseph K. ; Tsang, Patrick P. ; Wong, Duncan S. / Efficient verifiable ring encryption for ad hoc groups. Security and Privacy in Ad-hoc and Sensor Networks - Second European Workshop, ESAS 2005, Revised Selected Papers. 2005. pp. 1-13 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a6b80cfaee99439c931ec7deb82494e3,
title = "Efficient verifiable ring encryption for ad hoc groups",
abstract = "We propose an efficient Verifiable Ring Encryption (VRE) for ad hoc groups. VRE is a kind of verifiable encryption [16,1,4,2,8] in which it can be publicly verified that there exists at least one user, out of a designated group of n users, who can decrypt the encrypted message, while the semantic security of the message and the anonymity of the actual decryptor can be maintained. This concept was first proposed in [10] in the name of Custodian-Hiding Verifiable Encryption. However, their construction requires the inefficient cut-and-choose methodology which is impractical when implemented. We are the first to propose an efficient VRE scheme that does not require the cut-and-choose methodology. In addition, while [10] requires interaction with the encryptor when a verifier verifies a ciphertext, our scheme is non-interactive in the following sense: (1) an encryptor does not need to communicate with the users in order to generate a ciphertext together with its validity proof; and (2) anyone (who has the public keys of all users) can verify the ciphertext, without the help of the encryptor or any users. This non-interactiveness makes our scheme particularly suitable for ad hoc networks in which nodes come and go frequently as ciphertexts can be still generated and/or verified even if other parties are not online in the course. Our scheme is also proven secure in the random oracle model.",
author = "Liu, {Joseph K.} and Tsang, {Patrick P.} and Wong, {Duncan S.}",
year = "2005",
month = "12",
day = "1",
language = "English",
isbn = "3540309128",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1--13",
booktitle = "Security and Privacy in Ad-hoc and Sensor Networks - Second European Workshop, ESAS 2005, Revised Selected Papers",

}

Liu, JK, Tsang, PP & Wong, DS 2005, Efficient verifiable ring encryption for ad hoc groups. in Security and Privacy in Ad-hoc and Sensor Networks - Second European Workshop, ESAS 2005, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3813 LNCS, pp. 1-13, Second European Workshop on Security and Privacy in Ad-hoc and Sensor Networks, ESAS 2005, Visegrad, Hungary, 13/07/05.

Efficient verifiable ring encryption for ad hoc groups. / Liu, Joseph K.; Tsang, Patrick P.; Wong, Duncan S.

Security and Privacy in Ad-hoc and Sensor Networks - Second European Workshop, ESAS 2005, Revised Selected Papers. 2005. p. 1-13 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3813 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - Efficient verifiable ring encryption for ad hoc groups

AU - Liu, Joseph K.

AU - Tsang, Patrick P.

AU - Wong, Duncan S.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - We propose an efficient Verifiable Ring Encryption (VRE) for ad hoc groups. VRE is a kind of verifiable encryption [16,1,4,2,8] in which it can be publicly verified that there exists at least one user, out of a designated group of n users, who can decrypt the encrypted message, while the semantic security of the message and the anonymity of the actual decryptor can be maintained. This concept was first proposed in [10] in the name of Custodian-Hiding Verifiable Encryption. However, their construction requires the inefficient cut-and-choose methodology which is impractical when implemented. We are the first to propose an efficient VRE scheme that does not require the cut-and-choose methodology. In addition, while [10] requires interaction with the encryptor when a verifier verifies a ciphertext, our scheme is non-interactive in the following sense: (1) an encryptor does not need to communicate with the users in order to generate a ciphertext together with its validity proof; and (2) anyone (who has the public keys of all users) can verify the ciphertext, without the help of the encryptor or any users. This non-interactiveness makes our scheme particularly suitable for ad hoc networks in which nodes come and go frequently as ciphertexts can be still generated and/or verified even if other parties are not online in the course. Our scheme is also proven secure in the random oracle model.

AB - We propose an efficient Verifiable Ring Encryption (VRE) for ad hoc groups. VRE is a kind of verifiable encryption [16,1,4,2,8] in which it can be publicly verified that there exists at least one user, out of a designated group of n users, who can decrypt the encrypted message, while the semantic security of the message and the anonymity of the actual decryptor can be maintained. This concept was first proposed in [10] in the name of Custodian-Hiding Verifiable Encryption. However, their construction requires the inefficient cut-and-choose methodology which is impractical when implemented. We are the first to propose an efficient VRE scheme that does not require the cut-and-choose methodology. In addition, while [10] requires interaction with the encryptor when a verifier verifies a ciphertext, our scheme is non-interactive in the following sense: (1) an encryptor does not need to communicate with the users in order to generate a ciphertext together with its validity proof; and (2) anyone (who has the public keys of all users) can verify the ciphertext, without the help of the encryptor or any users. This non-interactiveness makes our scheme particularly suitable for ad hoc networks in which nodes come and go frequently as ciphertexts can be still generated and/or verified even if other parties are not online in the course. Our scheme is also proven secure in the random oracle model.

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

M3 - Conference Paper

SN - 3540309128

SN - 9783540309123

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 13

BT - Security and Privacy in Ad-hoc and Sensor Networks - Second European Workshop, ESAS 2005, Revised Selected Papers

ER -

Liu JK, Tsang PP, Wong DS. Efficient verifiable ring encryption for ad hoc groups. In Security and Privacy in Ad-hoc and Sensor Networks - Second European Workshop, ESAS 2005, Revised Selected Papers. 2005. p. 1-13. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).