GDL

Efficient Conditional Proxy Re-Encryption With Chosen Cipher Text Security

ISSN : 0974 - 9330
Journal from gdlhub / 2017-08-14 11:52:34
Oleh : S. Sree Vivek1, S. Sharmila Deva Selvi1, V. Radhakishan2, C. Pandu Rangan1, International Journal of Network Security & Its Applications
Dibuat : 2012-07-04, dengan 1 file

Keyword : Random Oracle Model, Proxy Re-Cryptography, Conditional Proxy Re-encryption, Chosen Ciphertext Security.
Subjek : Efficient Conditional Proxy Re-Encryption With Chosen Cipher Text Security
Url : http://airccse.org/journal/nsa/0312nsa14.pdf
Sumber pengambilan dokumen : Internet

In a proxy re-encryption (PRE) scheme, Alice gives a special information to a proxy that allows it to


transform messages encrypted under Alice's public key into a encryption under Bob's public key such that


the message is not revealed to the proxy. In [14], Jian Weng and others introduced the notion of


conditional proxy re-encryption (C-PRE) with bilinear pairings. Later, a break for the same was


published in [17] and a new C-PRE scheme with bilinear pairings was introduced. In C-PRE, the proxy


also needs to have the right condition key to transform the ciphertext (associated with a condition set by


Alice) under Alice's public key into ciphertext under Bob's public key, so that Bob can decrypt it. In this


paper, we propose an efficient C-PRE scheme which uses substantially less number of bilinear pairings


when compared to the existing one [17]. We then prove its chosen-ciphertext security under modified


Computational Diffie-Hellman (mCDH) and modified Computational Bilinear Diffie-Hellman (mCBDH)


assumptions in the random oracle model.

Deskripsi Alternatif :

In a proxy re-encryption (PRE) scheme, Alice gives a special information to a proxy that allows it to


transform messages encrypted under Alice's public key into a encryption under Bob's public key such that


the message is not revealed to the proxy. In [14], Jian Weng and others introduced the notion of


conditional proxy re-encryption (C-PRE) with bilinear pairings. Later, a break for the same was


published in [17] and a new C-PRE scheme with bilinear pairings was introduced. In C-PRE, the proxy


also needs to have the right condition key to transform the ciphertext (associated with a condition set by


Alice) under Alice's public key into ciphertext under Bob's public key, so that Bob can decrypt it. In this


paper, we propose an efficient C-PRE scheme which uses substantially less number of bilinear pairings


when compared to the existing one [17]. We then prove its chosen-ciphertext security under modified


Computational Diffie-Hellman (mCDH) and modified Computational Bilinear Diffie-Hellman (mCBDH)


assumptions in the random oracle model.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	International Journal of Network Security & Its Applications
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com