Custodian-hiding verifiable encryption

Joseph K. Liu, Victor K. Wei, Duncan S. Wong

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

3 Citations (Scopus)

Abstract

In a verifiable encryption, an asymmetrically encrypted ciphertext can be publicly verified to be decipherable by a designated receiver while maintaining the semantic security of the message. In this paper, we introduce Custodian-Hiding Verifiable Encryption, where it can be publicly verified that there exists at least one custodian (user), out of a designated group of n custodians (users), who can decrypt the message, while the semantic security of the message and the anonymity of the actual decryptor are maintained. Our scheme is proven secure in the random oracle model. We also introduce two extensions to decryption by a subset of more than one user.

Original languageEnglish
Title of host publication5th International Workshop on Information Security Applications, WISA 2004
PublisherSpringer
Pages51-64
Number of pages14
Publication statusPublished - 2005
Externally publishedYes
Event5th International Workshop on Information Security Applications, WISA 2004 - Jeju Island, Korea, Republic of (South)
Duration: 23 Aug 200425 Aug 2004

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume3325
ISSN (Print)0302-9743

Conference

Conference5th International Workshop on Information Security Applications, WISA 2004
CountryKorea, Republic of (South)
CityJeju Island
Period23/08/0425/08/04

Keywords

  • Anonymity
  • Publicly Verifiable
  • Verifiable Encryption

Cite this

Liu, J. K., Wei, V. K., & Wong, D. S. (2005). Custodian-hiding verifiable encryption. In 5th International Workshop on Information Security Applications, WISA 2004 (pp. 51-64). (Lecture Notes in Computer Science; Vol. 3325). Springer.
Liu, Joseph K. ; Wei, Victor K. ; Wong, Duncan S. / Custodian-hiding verifiable encryption. 5th International Workshop on Information Security Applications, WISA 2004. Springer, 2005. pp. 51-64 (Lecture Notes in Computer Science).
@inproceedings{ce3a0196ab124e3f882881261cdb9845,
title = "Custodian-hiding verifiable encryption",
abstract = "In a verifiable encryption, an asymmetrically encrypted ciphertext can be publicly verified to be decipherable by a designated receiver while maintaining the semantic security of the message. In this paper, we introduce Custodian-Hiding Verifiable Encryption, where it can be publicly verified that there exists at least one custodian (user), out of a designated group of n custodians (users), who can decrypt the message, while the semantic security of the message and the anonymity of the actual decryptor are maintained. Our scheme is proven secure in the random oracle model. We also introduce two extensions to decryption by a subset of more than one user.",
keywords = "Anonymity, Publicly Verifiable, Verifiable Encryption",
author = "Liu, {Joseph K.} and Wei, {Victor K.} and Wong, {Duncan S.}",
year = "2005",
language = "English",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "51--64",
booktitle = "5th International Workshop on Information Security Applications, WISA 2004",

}

Liu, JK, Wei, VK & Wong, DS 2005, Custodian-hiding verifiable encryption. in 5th International Workshop on Information Security Applications, WISA 2004. Lecture Notes in Computer Science, vol. 3325, Springer, pp. 51-64, 5th International Workshop on Information Security Applications, WISA 2004, Jeju Island, Korea, Republic of (South), 23/08/04.

Custodian-hiding verifiable encryption. / Liu, Joseph K.; Wei, Victor K.; Wong, Duncan S.

5th International Workshop on Information Security Applications, WISA 2004. Springer, 2005. p. 51-64 (Lecture Notes in Computer Science; Vol. 3325).

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

TY - GEN

T1 - Custodian-hiding verifiable encryption

AU - Liu, Joseph K.

AU - Wei, Victor K.

AU - Wong, Duncan S.

PY - 2005

Y1 - 2005

N2 - In a verifiable encryption, an asymmetrically encrypted ciphertext can be publicly verified to be decipherable by a designated receiver while maintaining the semantic security of the message. In this paper, we introduce Custodian-Hiding Verifiable Encryption, where it can be publicly verified that there exists at least one custodian (user), out of a designated group of n custodians (users), who can decrypt the message, while the semantic security of the message and the anonymity of the actual decryptor are maintained. Our scheme is proven secure in the random oracle model. We also introduce two extensions to decryption by a subset of more than one user.

AB - In a verifiable encryption, an asymmetrically encrypted ciphertext can be publicly verified to be decipherable by a designated receiver while maintaining the semantic security of the message. In this paper, we introduce Custodian-Hiding Verifiable Encryption, where it can be publicly verified that there exists at least one custodian (user), out of a designated group of n custodians (users), who can decrypt the message, while the semantic security of the message and the anonymity of the actual decryptor are maintained. Our scheme is proven secure in the random oracle model. We also introduce two extensions to decryption by a subset of more than one user.

KW - Anonymity

KW - Publicly Verifiable

KW - Verifiable Encryption

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

M3 - Conference Paper

T3 - Lecture Notes in Computer Science

SP - 51

EP - 64

BT - 5th International Workshop on Information Security Applications, WISA 2004

PB - Springer

ER -

Liu JK, Wei VK, Wong DS. Custodian-hiding verifiable encryption. In 5th International Workshop on Information Security Applications, WISA 2004. Springer. 2005. p. 51-64. (Lecture Notes in Computer Science).