By Topic

Restricted CCA-secure bidirectional proxy re-encryption scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Duntao Guo ; Key Laboratory of Information and Network Security, Engineering College of Chinese Armed Police Force, China ; Xu An Wang ; Minqing Zhang ; Xiaoyuan Yang

Proxy re-encryption allows a proxy to transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. In CANS'08, Deng et al. proposed the first bidirectional IND-PRE-CCA2 secure proxy re-encryption without parings. Later, in PKC'09, Shao et al. proposed the first unidirectional IND-PRE-CCA2 secure proxy re-encryption without parings. But both of these schemes prove their security in the random oracle. They left an open problem of constructing (bidirectional or unidirectional) IND-PRE-CCA2 secure proxy re-encryption scheme in the standard model yet without pairings. In this paper, we try to solve this open problem by proposing two new restricted IND-PRE-CCA2 secure bidirectional proxy re-encryption schemes without pairing nor random oracle.

Published in:

Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on  (Volume:5 )

Date of Conference:

9-11 July 2010