Paper Info
Title
CCA proxy re-encryption without bilinear maps in the standard model
Abstract
Proxy re-encryption (PRE) is a cryptographic application proposed by Blaze, Bleumer, and Strauss. It is an encryption system with a special property in which the semi-honest third party, the proxy, can re-encrypt ciphertexts for Alice into other ciphertexts for Bob without using Alice’s secret key. We can classify PRE into bidirectional and unidirectional schemes. Canetti and Hohenberger formalized the semantic security under chosen ciphertext attack for PRE, the PRE-CCA security. Several schemes satisfy the PRE-CCA security as a bidirectional or unidirectional scheme. However, some PRE schemes need a bilinear map in the standard model, and the other PRE schemes are PRE-CCA secure in the random oracle model before our work. In this paper, we construct a bidirectional PRE-CCA proxy re-encryption without bilinear maps in the standard model. We study lossy trapdoor functions (LTDFs) based on the decisional Diffie-Hellman (DDH) assumption proposed by Peikert and Waters. We define a new variant of LTDFs, re-applicable LTDFs, which are specialized LTDFs for PRE, and use them for our scheme.
Year
DOI
Venue
2010
10.1007/978-3-642-13013-7_16
Public Key Cryptography
Keywords
Field
DocType
bilinear map,bidirectional pre-cca proxy re-encryption,re-applicable ltdfs,proxy re-encryption,random oracle model,pre-cca security,unidirectional scheme,specialized ltdfs,standard model,pre scheme,satisfiability,chosen ciphertext attack,semantic security
Bilinear map,Semantic security,Cryptography,Computer science,Random oracle,Theoretical computer science,Trapdoor function,Chosen-ciphertext attack,Bilinear interpolation,Proxy re-encryption
Conference
Volume
ISSN
ISBN
6056
0302-9743
3-642-13012-7
Citations 
PageRank 
References 
32
1.04
24
Authors
3
Name
Order
Citations
PageRank
Toshihide Matsuda1321.38
Ryo Nishimaki213114.91
Keisuke Tanaka327819.04