Custodian-hiding verifiable encryption

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

Custodian-hiding verifiable encryption

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

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other › peer-review

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 language	English
Title of host publication	5th International Workshop on Information Security Applications, WISA 2004
Publisher	Springer
Pages	51-64
Number of pages	14
Publication status	Published - 2005
Externally published	Yes
Event	International Workshop on Information Security Applications 2004 - Jeju Island, Korea, South Duration: 23 Aug 2004 → 25 Aug 2004 Conference number: 5th https://link.springer.com/book/10.1007/b103174 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	3325
ISSN (Print)	0302-9743

Workshop

Workshop	International Workshop on Information Security Applications 2004
Abbreviated title	WISA 2004
Country/Territory	Korea, South
City	Jeju Island
Period	23/08/04 → 25/08/04
Internet address	https://link.springer.com/book/10.1007/b103174 (Proceedings)

Keywords

Anonymity
Publicly Verifiable
Verifiable Encryption

Cite this

@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",

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

url = "https://link.springer.com/book/10.1007/b103174",

}

TY - GEN

T1 - Custodian-hiding verifiable encryption

AU - Liu, Joseph K.

AU - Wei, Victor K.

AU - Wong, Duncan S.

N1 - Conference code: 5th

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

AN - SCOPUS:23944508524

T3 - Lecture Notes in Computer Science

SP - 51

EP - 64

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

PB - Springer

T2 - International Workshop on Information Security Applications 2004

Y2 - 23 August 2004 through 25 August 2004

ER -

Custodian-hiding verifiable encryption

Abstract

Publication series

Workshop

Keywords

Other files and links

Cite this