Paper Info
Title
Public-Key Encryptions With Invariant Security Reductions In The Multi-User Setting
Abstract
In [I], Bellare, Boldyreva, and Micali addressed the security of public-key encryptions (PKEs) in a multi-user setting (called the BBM model in this paper). They showed that although the indistinguishability in the BBM model is induced from that in the conventional model, its reduction is far from tight in general, and this brings a serious key length problem. In this paper, we discuss PKE schemes in which the IND-CCA security in the BBM model can be obtained tightly from the IND-CCA security. We call such PKE schemes IND-CCA secure in the BBM model with invariant security reductions (briefly, SR-invariant IND-CCABB" secure). These schemes never suffer from the underlying key length problem in the BBM model. We present three instances of an SR-invariant IND-CCA' secure PKE scheme: the first is based on the Fujisaki-Okamoto PKE scheme [7], the second is based on the Bellare-Rogaway PKE scheme [3], and the last is based on the Cramer-Shoup PKE scheme [5].
Year
DOI
Venue
2011
10.1587/transfun.E94.A.735
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
public-key encryption, security reduction, multi-user setting
Computer security,Theoretical computer science,Invariant (mathematics),Public-key cryptography,Mathematics,Key size,Multi-user
Journal
Volume
Issue
ISSN
E94A
2
0916-8508
Citations 
PageRank 
References 
0
0.34
7
Authors
2
Name
Order
Citations
PageRank
Mototsugu Nishioka1212.80
Naohisa Komatsu26812.42