Abstract
A Proxy Re-encryption (PRE) is a cryptographic scheme for delegation of decryption rights. In a PRE scheme, a semi-honest proxy agent of Bob re-encrypts the ciphertext, on the message intended for Alice, on behalf of Bob, without learning anything about the message. The PRE schemes are useful in the scenarios where data are desired to be shared with the authorized users over the cloud. For such important applications, in this paper, we present an efficient and secure proxy re-encryption scheme. To avoid the overhead due to certification and to get rid of the key escrow issue of identity-based setting, we construct our scheme on the certificateless setting. The scheme has been proved secure in random oracle model under the standard assumption, the hardness of the computational Diffie-Hellman problem (CDHP). Moreover, as we device a pairing-free construction, our scheme is significantly more efficient than the best available scheme.
Original language | English |
---|---|
Title of host publication | Advances in Information and Computer Security |
Subtitle of host publication | 12th International Workshop on Security, IWSEC 2017 Hiroshima, Japan, August 30 – September 1, 2017 Proceedings |
Editors | Satoshi Obana, Koji Chida |
Place of Publication | Cham Switzerland |
Publisher | Springer |
Pages | 85-101 |
Number of pages | 17 |
ISBN (Electronic) | 9783319642000 |
ISBN (Print) | 9783319641997 |
DOIs | |
Publication status | Published - 2017 |
Externally published | Yes |
Event | International Workshop on Security 2017 - Hiroshima, Japan Duration: 30 Aug 2017 → 1 Sep 2017 Conference number: 12th https://www.iwsec.org/2017/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 10418 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | International Workshop on Security 2017 |
---|---|
Abbreviated title | IWSEC 2017 |
Country | Japan |
City | Hiroshima |
Period | 30/08/17 → 1/09/17 |
Internet address |
Keywords
- Certificateless proxy re-encryption
- Computational Diffie-Hellman (CDH) problem
- Random oracle model
- Secure data sharing
Cite this
}
Secure certificateless Proxy Re-encryption without pairing. / Kuchta, Veronika; Sharma, Gaurav; Sahu, Rajeev Anand; Bhatia, Tarunpreet; Markowitch, Olivier.
Advances in Information and Computer Security: 12th International Workshop on Security, IWSEC 2017 Hiroshima, Japan, August 30 – September 1, 2017 Proceedings. ed. / Satoshi Obana; Koji Chida. Cham Switzerland : Springer, 2017. p. 85-101 (Lecture Notes in Computer Science; Vol. 10418 ).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research
TY - GEN
T1 - Secure certificateless Proxy Re-encryption without pairing
AU - Kuchta, Veronika
AU - Sharma, Gaurav
AU - Sahu, Rajeev Anand
AU - Bhatia, Tarunpreet
AU - Markowitch, Olivier
PY - 2017
Y1 - 2017
N2 - A Proxy Re-encryption (PRE) is a cryptographic scheme for delegation of decryption rights. In a PRE scheme, a semi-honest proxy agent of Bob re-encrypts the ciphertext, on the message intended for Alice, on behalf of Bob, without learning anything about the message. The PRE schemes are useful in the scenarios where data are desired to be shared with the authorized users over the cloud. For such important applications, in this paper, we present an efficient and secure proxy re-encryption scheme. To avoid the overhead due to certification and to get rid of the key escrow issue of identity-based setting, we construct our scheme on the certificateless setting. The scheme has been proved secure in random oracle model under the standard assumption, the hardness of the computational Diffie-Hellman problem (CDHP). Moreover, as we device a pairing-free construction, our scheme is significantly more efficient than the best available scheme.
AB - A Proxy Re-encryption (PRE) is a cryptographic scheme for delegation of decryption rights. In a PRE scheme, a semi-honest proxy agent of Bob re-encrypts the ciphertext, on the message intended for Alice, on behalf of Bob, without learning anything about the message. The PRE schemes are useful in the scenarios where data are desired to be shared with the authorized users over the cloud. For such important applications, in this paper, we present an efficient and secure proxy re-encryption scheme. To avoid the overhead due to certification and to get rid of the key escrow issue of identity-based setting, we construct our scheme on the certificateless setting. The scheme has been proved secure in random oracle model under the standard assumption, the hardness of the computational Diffie-Hellman problem (CDHP). Moreover, as we device a pairing-free construction, our scheme is significantly more efficient than the best available scheme.
KW - Certificateless proxy re-encryption
KW - Computational Diffie-Hellman (CDH) problem
KW - Random oracle model
KW - Secure data sharing
UR - http://www.scopus.com/inward/record.url?scp=85028453064&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-64200-0_6
DO - 10.1007/978-3-319-64200-0_6
M3 - Conference Paper
SN - 9783319641997
T3 - Lecture Notes in Computer Science
SP - 85
EP - 101
BT - Advances in Information and Computer Security
A2 - Obana, Satoshi
A2 - Chida, Koji
PB - Springer
CY - Cham Switzerland
ER -