Cart (Loading....) | Create Account
Close category search window

Toward constant size CCA-secure multi-hop proxy re-encryption

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
$31 $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

3 Author(s)
Junru Hu ; Key Lab. of Inf. & Network Security Eng., Coll. of Chinese Armed Police Force, China ; Xu An Wang ; Minqing Zhang

Blaze et al. in 1998 introduced the concept of proxy re-encryption, which allows a proxy to transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. But until now, the problem of constructing a constant-size CCA-secure multi-hop proxy re-encryption scheme remain open. In this paper, we try to solve this open problem by presenting a somewhat constant-size CCA-secure multi-hop proxy re-encryption scheme.

Published in:

Signal Processing Systems (ICSPS), 2010 2nd International Conference on  (Volume:1 )

Date of Conference:

5-7 July 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.