Universal custodian-hiding verifiable encryption for discrete logarithms

Joseph K. Liu, Patrick P. Tsang, Duncan S. Wong, Robert W. Zhu

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

7 Citations (Scopus)

Abstract

We introduce the notion of Universal Custodian-Hiding Verifiable Encryption (UCH-VE) and propose a scheme of this type for discrete logarithms. A UCH-VE scheme allows an encryptor to designate t out of a group of n users and prepare a publicly verifiable ciphertext in such a way that any k of these t designated users can recover the message. The values of k and t are set arbitrarily by the encryptor. The anonymity of these t designated users will also be preserved. The UCH-VE scheme captures the notions of various types of verifiable encryption schemes that include conventional one-decryptor type, conventional threshold type, designated-1-out-of-n custodian-hiding type and designated group custodian-hiding type. On efficiency, the new scheme avoids using inefficient cut-and-choose proofs and compares favourably with the state-of-the-art verifiable encryption schemes for discrete logarithms.

Original languageEnglish
Title of host publicationInformation Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers
PublisherSpringer
Pages389-409
Number of pages21
ISBN (Print)3540333541, 9783540333548
Publication statusPublished - 1 Jan 2006
Externally publishedYes
EventInternational Conference on Information Security and Cryptology 2005 - Seoul, Korea, Republic of (South)
Duration: 1 Dec 20052 Dec 2005
Conference number: 8th

Publication series

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

Conference

ConferenceInternational Conference on Information Security and Cryptology 2005
Abbreviated titleICISC 2005
CountryKorea, Republic of (South)
CitySeoul
Period1/12/052/12/05

Cite this

Liu, J. K., Tsang, P. P., Wong, D. S., & Zhu, R. W. (2006). Universal custodian-hiding verifiable encryption for discrete logarithms. In Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers (pp. 389-409). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3935 LNCS). Springer.
Liu, Joseph K. ; Tsang, Patrick P. ; Wong, Duncan S. ; Zhu, Robert W. / Universal custodian-hiding verifiable encryption for discrete logarithms. Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers. Springer, 2006. pp. 389-409 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{98ac3d1cc2f94a9491aadaeb28062e71,
title = "Universal custodian-hiding verifiable encryption for discrete logarithms",
abstract = "We introduce the notion of Universal Custodian-Hiding Verifiable Encryption (UCH-VE) and propose a scheme of this type for discrete logarithms. A UCH-VE scheme allows an encryptor to designate t out of a group of n users and prepare a publicly verifiable ciphertext in such a way that any k of these t designated users can recover the message. The values of k and t are set arbitrarily by the encryptor. The anonymity of these t designated users will also be preserved. The UCH-VE scheme captures the notions of various types of verifiable encryption schemes that include conventional one-decryptor type, conventional threshold type, designated-1-out-of-n custodian-hiding type and designated group custodian-hiding type. On efficiency, the new scheme avoids using inefficient cut-and-choose proofs and compares favourably with the state-of-the-art verifiable encryption schemes for discrete logarithms.",
author = "Liu, {Joseph K.} and Tsang, {Patrick P.} and Wong, {Duncan S.} and Zhu, {Robert W.}",
year = "2006",
month = "1",
day = "1",
language = "English",
isbn = "3540333541",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "389--409",
booktitle = "Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers",

}

Liu, JK, Tsang, PP, Wong, DS & Zhu, RW 2006, Universal custodian-hiding verifiable encryption for discrete logarithms. in Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3935 LNCS, Springer, pp. 389-409, International Conference on Information Security and Cryptology 2005, Seoul, Korea, Republic of (South), 1/12/05.

Universal custodian-hiding verifiable encryption for discrete logarithms. / Liu, Joseph K.; Tsang, Patrick P.; Wong, Duncan S.; Zhu, Robert W.

Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers. Springer, 2006. p. 389-409 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3935 LNCS).

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

TY - GEN

T1 - Universal custodian-hiding verifiable encryption for discrete logarithms

AU - Liu, Joseph K.

AU - Tsang, Patrick P.

AU - Wong, Duncan S.

AU - Zhu, Robert W.

PY - 2006/1/1

Y1 - 2006/1/1

N2 - We introduce the notion of Universal Custodian-Hiding Verifiable Encryption (UCH-VE) and propose a scheme of this type for discrete logarithms. A UCH-VE scheme allows an encryptor to designate t out of a group of n users and prepare a publicly verifiable ciphertext in such a way that any k of these t designated users can recover the message. The values of k and t are set arbitrarily by the encryptor. The anonymity of these t designated users will also be preserved. The UCH-VE scheme captures the notions of various types of verifiable encryption schemes that include conventional one-decryptor type, conventional threshold type, designated-1-out-of-n custodian-hiding type and designated group custodian-hiding type. On efficiency, the new scheme avoids using inefficient cut-and-choose proofs and compares favourably with the state-of-the-art verifiable encryption schemes for discrete logarithms.

AB - We introduce the notion of Universal Custodian-Hiding Verifiable Encryption (UCH-VE) and propose a scheme of this type for discrete logarithms. A UCH-VE scheme allows an encryptor to designate t out of a group of n users and prepare a publicly verifiable ciphertext in such a way that any k of these t designated users can recover the message. The values of k and t are set arbitrarily by the encryptor. The anonymity of these t designated users will also be preserved. The UCH-VE scheme captures the notions of various types of verifiable encryption schemes that include conventional one-decryptor type, conventional threshold type, designated-1-out-of-n custodian-hiding type and designated group custodian-hiding type. On efficiency, the new scheme avoids using inefficient cut-and-choose proofs and compares favourably with the state-of-the-art verifiable encryption schemes for discrete logarithms.

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

M3 - Conference Paper

SN - 3540333541

SN - 9783540333548

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

SP - 389

EP - 409

BT - Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers

PB - Springer

ER -

Liu JK, Tsang PP, Wong DS, Zhu RW. Universal custodian-hiding verifiable encryption for discrete logarithms. In Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers. Springer. 2006. p. 389-409. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).