Toward CCA-secure Bidirectional Proxy Re-encryption without Pairing nor Random Oracle
Proxy re-encryption, introduced by Blaze et al. in 1998, allows a proxy to transform a ciphertext computed under Alices public key into one that can be opened under Bobs decrypfion key. An open problem of constructing (bidirectional or unidirectionaD IND-PRE-CCA2 secure proxy reencryption scheme in the standard model yet without pairings was left until now In this paper, based on Hanaokas efficient chosen ciphertext secure public key encryption under the computational Diffie-Hellman assumption, we try to solve this open problem by presenting two new bidirectional proxy re-encryption schemes, which are restricted IND-PRE-CCA2 secure without pairing nor random oracle.
Proxy re-encryption without pairing without random oracle
Longxia Zhang Xu An Wang Wei Wang
Department of Communication Engineering,Engineering College of Chinese Armed Pojice Force, P. R. Chi Key Laboratory of Information and Network Security,Engineering College of Chinese Armed Police Force
国际会议
2010 2nd International Conference on Signal Processing System(2010年信号处理系统国际会议 ICSPS 2010)
大连
英文
599-602
2010-07-05（万方平台首次上网日期，不代表论文的发表时间）