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