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