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, South Duration: 1 Dec 2005 → 2 Dec 2005 Conference number: 8th https://link.springer.com/book/10.1007%2F11734727 (Proceedings) |
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/Territory | Korea, South |
City | Seoul |
Period | 1/12/05 → 2/12/05 |
Internet address |
|