TY - CHAP
T1 - Secure non-transferable proxy re-encryption for group membership and non-membership
AU - Cho, Ei Mon
AU - San, Lwin
AU - Koshiba, Takeshi
N1 - Funding Information:
This work is supported in part by JSPS Grant-in-Aids for Scientific Research (A) JP16H01705 and for Scientific Research (B) JP17H01695.
Publisher Copyright:
© Springer International Publishing AG 2018.
PY - 2018
Y1 - 2018
N2 - In proxy re-encrytpion (PRE) scheme, the message is sent by a delegator to a delegatee with a help of the trusted third party proxy without knowing the existing plaintext. PRE schemes are widely used in various applications. However, the standard PRE scheme has some proxy problems called private key generator (PKG) despotism problem. This means that PKG can make re-encryption key without permission from delegator. And also, if someone can attack PKG in a PRE scheme, they can decrypt both the original ciphertext and the re-encrypted ciphertext which means the key-escrow problem. A solution for these two problems is to use non-transferable PRE scheme. Non-transferable PRE scheme solved the above PKG despotism problem and key-escrow problem. We would like to introduce our PRE scheme with a new approach. In our scheme, there are three sub-processes, which are based on a non-transferable PRE scheme and group signature. Our scheme will provide the security for delegator i, delegatee j (who is in the same group with delegator i), and delegatee k (who is in a different group with delegator i).
AB - In proxy re-encrytpion (PRE) scheme, the message is sent by a delegator to a delegatee with a help of the trusted third party proxy without knowing the existing plaintext. PRE schemes are widely used in various applications. However, the standard PRE scheme has some proxy problems called private key generator (PKG) despotism problem. This means that PKG can make re-encryption key without permission from delegator. And also, if someone can attack PKG in a PRE scheme, they can decrypt both the original ciphertext and the re-encrypted ciphertext which means the key-escrow problem. A solution for these two problems is to use non-transferable PRE scheme. Non-transferable PRE scheme solved the above PKG despotism problem and key-escrow problem. We would like to introduce our PRE scheme with a new approach. In our scheme, there are three sub-processes, which are based on a non-transferable PRE scheme and group signature. Our scheme will provide the security for delegator i, delegatee j (who is in the same group with delegator i), and delegatee k (who is in a different group with delegator i).
UR - http://www.scopus.com/inward/record.url?scp=85090372569&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85090372569&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-65521-5_79
DO - 10.1007/978-3-319-65521-5_79
M3 - Chapter
AN - SCOPUS:85090372569
T3 - Lecture Notes on Data Engineering and Communications Technologies
SP - 876
EP - 887
BT - Lecture Notes on Data Engineering and Communications Technologies
PB - Springer Science and Business Media Deutschland GmbH
ER -