Efficient key encapsulation to multiple parties

NP Smart

Efficient key encapsulation to multiple parties

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

27 Citations (Scopus)

Abstract

We present the notion of an mKEM, which is a Key Encapsulation Mechanism (KEM) which takes multiple public keys as input. This has applications where one wishes to encrypt a single large document to a set of multiple recipients, as when one sends an encrypted email to more than one person. We present a security definition and show that the naive approach to implementing an mKEM is secure under this definition. We then go on to present a more efficient construction of an mKEM, which is secure in the random oracle model.

Translated title of the contribution	Efficient key encapsulation to multiple parties
Original language	English
Title of host publication	Security and Cryptography for Networks - SCN 2006
Publisher	Springer Berlin Heidelberg
Pages	208 - 219
Number of pages	11
Volume	3352
ISBN (Print)	3540243011
Publication status	Published - Jan 2005

Bibliographical note

Conference Proceedings/Title of Journal: Security in Communication Networks (SCN 2004)

Access to Document

http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=2000194

Fingerprint Dive into the research topics of 'Efficient key encapsulation to multiple parties'. Together they form a unique fingerprint.

Cite this

@inproceedings{b53e8612fcf04e2681be202250a2df81,

title = "Efficient key encapsulation to multiple parties",

abstract = " We present the notion of an mKEM, which is a Key Encapsulation Mechanism (KEM) which takes multiple public keys as input. This has applications where one wishes to encrypt a single large document to a set of multiple recipients, as when one sends an encrypted email to more than one person. We present a security definition and show that the naive approach to implementing an mKEM is secure under this definition. We then go on to present a more efficient construction of an mKEM, which is secure in the random oracle model. ",

author = "NP Smart",

note = "Conference Proceedings/Title of Journal: Security in Communication Networks (SCN 2004)",

year = "2005",

month = jan,

language = "English",

isbn = "3540243011",

volume = "3352",

pages = "208 -- 219",

booktitle = "Security and Cryptography for Networks - SCN 2006",

publisher = "Springer Berlin Heidelberg",

address = "Germany",

}

TY - GEN

T1 - Efficient key encapsulation to multiple parties

AU - Smart, NP

N1 - Conference Proceedings/Title of Journal: Security in Communication Networks (SCN 2004)

PY - 2005/1

Y1 - 2005/1

N2 - We present the notion of an mKEM, which is a Key Encapsulation Mechanism (KEM) which takes multiple public keys as input. This has applications where one wishes to encrypt a single large document to a set of multiple recipients, as when one sends an encrypted email to more than one person. We present a security definition and show that the naive approach to implementing an mKEM is secure under this definition. We then go on to present a more efficient construction of an mKEM, which is secure in the random oracle model.

AB - We present the notion of an mKEM, which is a Key Encapsulation Mechanism (KEM) which takes multiple public keys as input. This has applications where one wishes to encrypt a single large document to a set of multiple recipients, as when one sends an encrypted email to more than one person. We present a security definition and show that the naive approach to implementing an mKEM is secure under this definition. We then go on to present a more efficient construction of an mKEM, which is secure in the random oracle model.

M3 - Conference Contribution (Conference Proceeding)

SN - 3540243011

VL - 3352

SP - 208

EP - 219

BT - Security and Cryptography for Networks - SCN 2006

PB - Springer Berlin Heidelberg

ER -