On the security of a bidirectional proxy re-encryption scheme from PKC 2010

Authors:
Jian Weng;Yunlei Zhao;Goichiro Hanaoka
Affiliations:
Department of Computer Science, Jinan Univ., Guangzhou, China and State Key Lab. of Networking and Switching Techn., Beijing Univ. of Posts and Telecomm., Beijing, China and State Key Lab. of Inf. ...;Software School, Fudan University, Shanghai, China;National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
Venue:
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Year:
2011

Citing 13
Cited 2

The random oracle methodology, revisited (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The random oracle methodology, revisited

Journal of the ACM (JACM)
Improved proxy re-encryption schemes with applications to secure distributed storage

ACM Transactions on Information and System Security (TISSEC)
Chosen-ciphertext secure proxy re-encryption

Proceedings of the 14th ACM conference on Computer and communications security
Lossy trapdoor functions and their applications

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings

CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
CCA-Secure Proxy Re-encryption without Pairings

Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Unidirectional chosen-ciphertext secure proxy re-encryption

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings

Information Sciences: an International Journal
Shrinking the keys of discrete-log-type lossy trapdoor functions

ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
CCA proxy re-encryption without bilinear maps in the standard model

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
More constructions of lossy and correlation-secure trapdoor functions

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Efficient unidirectional proxy re-encryption

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa

Generic construction of chosen ciphertext secure proxy re-encryption

CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Identity-based data storage in cloud computing

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In ACM CCS 2007, Canetti and Hohenberger left an interesting open problem of how to construct a chosen-ciphertext secure proxy re-encryption (PRE) scheme without bilinear maps. This is a rather interesting problem and has attracted great interest in recent years. In PKC 2010, Matsuda, Nishimaki and Tanaka introduced a novel primitive named re-applicable lossy trapdoor function, and then used it to construct a PRE scheme without bilinear maps. Their scheme is claimed to be chosen-ciphertext secure in the standard model. In this paper, we make a careful observation on their PRE scheme, and indicate that their scheme does not satisfy chosen-ciphertext security. The purpose of this paper is to clarify the fact that, it is still an open problem to come up with a chosen-ciphertext secure PRE scheme without bilinear maps in the standard model.