Title
Constructing better KEMs with partial message recovery
Abstract
In this paper, we consider the problem of building effcient key encapsulation mechanism (KEM) with partial message recovery, in brief, PKEM, which aims at providing better bandwidth for standard KEM. We demonstrate several practical issues that were not considered by the previous research, e.g., the additional security loss due to loose reduction of OAEP, and the ciphertext overhead caused by the corresponding data encapsulation mechanism (DEM). We give solutions to these problems, furthermore, we consider the multichallenge model for PKEMs, where an adversary can obtain up to multiple challenge ciphertexts. Apparently, this is a more severe and more realistic model for PKEM. We then show two generic constructions of PKEMs and prove their security in the multi-challenge model. Our constructions are natural and simple. Finally, we give some instantiations of our generic constructions, and compare their effciency. Our results demonstrate that there are strong ties between PKEM and public key encryption.
Year
DOI
Venue
2009
10.1007/978-3-642-16342-5_22
Inscrypt
Keywords
Field
DocType
effcient key encapsulation mechanism,realistic model,generic construction,better kems,additional security loss,standard kem,partial message recovery,multichallenge model,better bandwidth,encapsulation mechanism,public key encryption,multi-challenge model
Optimal asymmetric encryption padding,Computer science,Key encapsulation,Random oracle,Theoretical computer science,Bandwidth (signal processing),Ciphertext,Adversary,Public-key cryptography,Encapsulation (computer programming),Distributed computing
Conference
Volume
ISSN
ISBN
6151
0302-9743
3-642-16341-6
Citations 
PageRank 
References 
1
0.38
14
Authors
2
Name
Order
Citations
PageRank
Rui Zhang126018.05
Hideki Imai261543.56