research-article

Elliptic Curve Based Proxy Re-Encryption

Authors:

K. ChandrasekaranAuthors Info & Claims

ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies

Article No.: 121, Pages 1 - 6

https://doi.org/10.1145/2905055.2905337

Published: 04 March 2016 Publication History

Abstract

Proxy re-encryption is a scheme where a semi-trusted proxy alters the confidential message of one party into a confidential message of another party without knowing the original plaintext. To do the same, various approaches are suggested in the public key set up cryptography. In this paper, we propose two new methods named CTR1-PRE and CTR2-PRE for proxy re-encryption on public key setting which are based on elliptic curve. Since elliptic curve cryptosystem is becoming a new famous methodology due to its lot of nice features, it is required to construct a proxy re-encryption scheme which works on elliptic curve as well. So, in this work we have shown two such proxy re-encryption methods and we have also shown that one of our approach holds all the essential properties of proxy re-encryption method such as unidirectional, non-interactive, proxy invisibility, original access to ciphertext, key optimal for storage, collusion safe from intruders, etc.

References

[1]

M. Mambo and E. Okamoto. 1997. Proxy Cryptosystems: Delegation of the Power to Decrypt Ciphertexts. In TFECCS,

[2]

Matt Blaze, G. Bleumer, and M. Strauss. 1998. Divertible protocols and atomic proxy cryptography. In Proceedings of Eurocrypt '98, volume 1403, 127--144.

[3]

Y. Dodis and A. Ivan. 2003. Proxy Cryptography Revisited. In NDSS.

[4]

Giuseppe Ateniese, Kevin Fu, Matthew Green, and Susan Hohenberger. 2006. Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage. ACM Transactions, Information System Security, 9(1): 1--30.

Digital Library

[5]

Matthew Green and Giuseppe Ateniese. 2007. Identity-Based Proxy Re-encryption. In ACNS, volume 4521 of Lecture Notes in Computer Science, 288--306. Springer.

Digital Library

[6]

Cheng-Kang Chu and Wen-Guey Tzeng. 2007. Identity-Based Proxy Re-encryption Without Random Oracles. In ISC, volume 4779 of Lecture Notes in Computer Science, 189--202, Springer.

Digital Library

[7]

M. Kallahalla, E. Riedel, R. Swaminathan, Q.Wang, and K. Fu. Plutus. 2003. Scalable secure file sharing on untrusted storage. In Proceedings of the Second USENIX Conference on File and Storage Technologies, March.

Digital Library

[8]

Markus Jakobsson. 1999. On quorum controlled asymmetric proxy re-encryption. In Proceedings of Public Key Cryptography, 112--121.

Digital Library

[9]

Lidong Zhou, Michael A. Marsh, Fred B. Schneider, and Anna Redz. 2004. Distributed blinding for Elgamal re-encryption. Technical Report 2004-1924, Cornell Computer Science Department.

[10]

John Bethancourt, "Intro to Bilinear Maps". http://www.cs.cmu.edu/~bethenco/bilinear_maps.pdf

[11]

Yevgeniy Dodis and Anca Ivan. 2003. Proxy cryptography revisited. In Proceedings of the Tenth Network and Distributed System Security Symposium, (Feb. 2003).

[12]

Dan Boneh and Xavier Boyen. 2004. Efficient selective-id secure Identity-Based Encryption without random oracles. In Proceedings of Eurocrypt '04, volume 3027 of Lecture Note in Computer Science, 223--238, Springer.

[13]

Dan Boneh and Matthew K. Franklin. 2001. Identity-based encryption from the Weil Pairing. In Advances in Cryptology (CRYPTO 2001), volume 2139 of Lecture Notes in Computer Science, 213--229, Springer.

Digital Library

[14]

Dan Boneh, Ben Lynn, and Hovav Shacham. 2001. Short signatures from the Weil Pairing, ASIACRYPT '01: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, volume 2248 of Lecture Notes in Computer Science, 514--532, London, UK, Springer-Verlag.

Digital Library

[15]

Ran Canetti, Shai Halevi, and Jonathan Katz. 2004. Chosen-ciphertext security from Identity Based Encryption. In Proceedings of Eurocrypt '04, volume 3027 of Lecture Notes in Computer Science, 207--222, Springer-Verlag.

[16]

Brent Waters. 2005. Efficient Identity-Based Encryption without random oracles. In Proceedings of Eurocrypt '05, volume 3494 of Lecture Notes in Computer Science, 114--127, Springer.

Digital Library

[17]

Peng Yang, Takashi Kitagawa, Goichiro Hanaoka, Rui Zhang, Kanta Matsuura, and Hideki Imai. 2006. Applying Fujisaki-Okamoto to Identity-Based Encryption. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 16th International Symposium (AAECC-16), volume 3857 of Lecture Notes in Computer Science, 183--192, Springer.

Digital Library

[18]

Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, and Moti Yung. 2003. Intrusion resilient public-key encryption. In Proceedings of CT-RSA '03, volume 2612 of LNCS, 19--32.

Digital Library

[19]

Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, and Moti Yung. 2004. A generic construction for intrusion-resilient public-key encryption. In Proceedings of CT-RSA '04, volume 2964 of LNCS, 81--98.

[20]

Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, and Moti Yung. 2002. Key-insulated public key cryptosystems. In Proceedings of Eurocrypt '02, volume 2332 of LNCS, 65--82.

Digital Library

Cited By

Zhan WChen CWeng WTsaur WLim ZDeng Y(2022)Incentive EMR Sharing System Based on Consortium Blockchain and IPFSHealthcare10.3390/healthcare1010184010:10(1840)Online publication date: 22-Sep-2022
https://doi.org/10.3390/healthcare10101840
Chen WZhu SLi JWu JChen CDeng Y(2021)Authorized Shared Electronic Medical Record System with Proxy Re-Encryption and Blockchain TechnologySensors10.3390/s2122776521:22(7765)Online publication date: 22-Nov-2021
https://doi.org/10.3390/s21227765
Leng ZTan ZWang K(2021)Application of Hyperledger in the Hospital Information Systems: A SurveyIEEE Access10.1109/ACCESS.2021.31126089(128965-128987)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3112608
Show More Cited By

Elliptic Curve Based Proxy Re-Encryption

Recommendations

Certificateless Proxy Re-Encryption Without Pairing: Revisited
SCC '15: Proceedings of the 3rd International Workshop on Security in Cloud Computing

Proxy Re-Encryption was introduced by Blaze, Bleumer and Strauss to efficiently solve the problem of delegation of decryption rights. In proxy re-encryption, a semi-honest proxy transforms a ciphertext intended for Alice to a ciphertext of the same ...
Proxy Re-encryption from CLE to CBE
CIS '10: Proceedings of the 2010 International Conference on Computational Intelligence and Security

In 1998, Blaze, Bleumer, and Strauss propose a kind of cryptographic primitive called proxy re-encryption. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice’s public key into one that can be opene under Bob’s decryption key. ...
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings
CANS '08: Proceedings of the 7th International Conference on Cryptology and Network Security

In a proxy re-encryption system, a semi-trusted proxy can convert a ciphertext originally intended for Alice into a ciphertext intended for Bob, without learning the underlying plaintext. Proxy re-encryption has found many practical applications, such ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies

March 2016

843 pages

ISBN:9781450339629

DOI:10.1145/2905055

Copyright © 2016 ACM.

© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 March 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ICTCS '16

ICTCS '16: Second International Conference on Information and Communication Technology for Competitive Strategies

March 4 - 5, 2016

Udaipur, India

Acceptance Rates

Overall Acceptance Rate 97 of 270 submissions, 36%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
244
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)2

Reflects downloads up to 01 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhan WChen CWeng WTsaur WLim ZDeng Y(2022)Incentive EMR Sharing System Based on Consortium Blockchain and IPFSHealthcare10.3390/healthcare1010184010:10(1840)Online publication date: 22-Sep-2022
https://doi.org/10.3390/healthcare10101840
Chen WZhu SLi JWu JChen CDeng Y(2021)Authorized Shared Electronic Medical Record System with Proxy Re-Encryption and Blockchain TechnologySensors10.3390/s2122776521:22(7765)Online publication date: 22-Nov-2021
https://doi.org/10.3390/s21227765
Leng ZTan ZWang K(2021)Application of Hyperledger in the Hospital Information Systems: A SurveyIEEE Access10.1109/ACCESS.2021.31126089(128965-128987)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3112608
Elhadad A(2019)Data sharing using proxy re-encryption based on DNA computingSoft Computing10.1007/s00500-019-04041-zOnline publication date: 9-May-2019
https://doi.org/10.1007/s00500-019-04041-z
Sathi VSrinivasan MThiruvasagam PChebiyyam SBoukerche AKanhere SBellavista P(2018)A Novel Protocol for Securing Network Slice Component Association and Slice Isolation in 5G NetworksProceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems10.1145/3242102.3242135(249-253)Online publication date: 25-Oct-2018
https://dl.acm.org/doi/10.1145/3242102.3242135
Thangam VChandrasekaran K(2016)Elliptic Curve Based Secure Outsourced Computation in Multi-party Cloud EnvironmentSecurity in Computing and Communications10.1007/978-981-10-2738-3_17(199-212)Online publication date: 17-Sep-2016
https://doi.org/10.1007/978-981-10-2738-3_17

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten