Custodian-hiding verifiable encryption

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

doi:10.1007/978-3-540-31815-6_5

Custodian-hiding verifiable encryption

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

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

5 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. © Springer-Verlag Berlin Heidelberg 2004.

Original language	English
Title of host publication	Information Security Applications
Subtitle of host publication	5th International Workshop, WISA 2004, Jeju Island, Korea, August 23-25, 2004, Revised Selected Papers
Editors	Chae Hoon Lim, Moti Yung
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	51-64
ISBN (Electronic)	978-3-540-31815-6
ISBN (Print)	978-3-540-24015-0
DOIs	https://doi.org/10.1007/978-3-540-31815-6_5
Publication status	Published - 2005
Event	5th International Workshop on Information Security Applications (WISA 2004) - Jeju Island, Korea, Republic of Duration: 23 Aug 2004 → 25 Aug 2004

Publication series

Name	Lecture Notes in Computer Science
Volume	3325
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Workshop on Information Security Applications (WISA 2004)
Country/Territory	Korea, Republic of
City	Jeju Island
Period	23/08/04 → 25/08/04

Research Keywords

Anonymity
Publicly Verifiable
Verifiable Encryption

Access Output

10.1007/978-3-540-31815-6_5

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Liu, J. K., Wei, V. K., & Wong, D. S. (2005). Custodian-hiding verifiable encryption. In C. H. Lim, & M. Yung (Eds.), Information Security Applications: 5th International Workshop, WISA 2004, Jeju Island, Korea, August 23-25, 2004, Revised Selected Papers (pp. 51-64). (Lecture Notes in Computer Science; Vol. 3325). Springer . https://doi.org/10.1007/978-3-540-31815-6_5

@inproceedings{c49075109ac14cee956c8842d04d5926,

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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2004.",

keywords = "Anonymity, Publicly Verifiable, Verifiable Encryption",

author = "Liu, {Joseph K.} and Wei, {Victor K.} and Wong, {Duncan S.}",

year = "2005",

doi = "10.1007/978-3-540-31815-6_5",

language = "English",

isbn = "978-3-540-24015-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer ",

pages = "51--64",

editor = "Lim, {Chae Hoon} and Moti Yung",

booktitle = "Information Security Applications",

note = "5th International Workshop on Information Security Applications (WISA 2004) ; Conference date: 23-08-2004 Through 25-08-2004",

}

Liu, JK, Wei, VK & Wong, DS 2005, Custodian-hiding verifiable encryption. in CH Lim & M Yung (eds), Information Security Applications: 5th International Workshop, WISA 2004, Jeju Island, Korea, August 23-25, 2004, Revised Selected Papers. Lecture Notes in Computer Science, vol. 3325, Springer , Berlin, Heidelberg, pp. 51-64, 5th International Workshop on Information Security Applications (WISA 2004), Jeju Island, Korea, Republic of, 23/08/04. https://doi.org/10.1007/978-3-540-31815-6_5

Custodian-hiding verifiable encryption. / Liu, Joseph K.; Wei, Victor K.; Wong, Duncan S.
Information Security Applications: 5th International Workshop, WISA 2004, Jeju Island, Korea, August 23-25, 2004, Revised Selected Papers. ed. / Chae Hoon Lim; Moti Yung. Berlin, Heidelberg: Springer , 2005. p. 51-64 (Lecture Notes in Computer Science; Vol. 3325).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-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. © Springer-Verlag Berlin Heidelberg 2004.

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. © Springer-Verlag Berlin Heidelberg 2004.

KW - Anonymity

KW - Publicly Verifiable

KW - Verifiable Encryption

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-23944508524&origin=recordpage

U2 - 10.1007/978-3-540-31815-6_5

DO - 10.1007/978-3-540-31815-6_5

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 978-3-540-24015-0

T3 - Lecture Notes in Computer Science

SP - 51

EP - 64

BT - Information Security Applications

A2 - Lim, Chae Hoon

A2 - Yung, Moti

PB - Springer

CY - Berlin, Heidelberg

T2 - 5th International Workshop on Information Security Applications (WISA 2004)

Y2 - 23 August 2004 through 25 August 2004

ER -

Custodian-hiding verifiable encryption

Abstract

Publication series

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this