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 language | English |
|---|---|
| Title of host publication | Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers |
| Publisher | Springer |
| Pages | 389-409 |
| Number of pages | 21 |
| ISBN (Print) | 3540333541, 9783540333548 |
| Publication status | Published - 1 Jan 2006 |
| Externally published | Yes |
| Event | International Conference on Information Security and Cryptology 2005 - Seoul, Korea, Republic of (South) Duration: 1 Dec 2005 → 2 Dec 2005 Conference number: 8th |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 3935 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | International Conference on Information Security and Cryptology 2005 |
|---|---|
| Abbreviated title | ICISC 2005 |
| Country | Korea, Republic of (South) |
| City | Seoul |
| Period | 1/12/05 → 2/12/05 |
Cite this
}
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 proceeding › Conference Paper › Research › peer-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 -