Encryption scheme with Ordered Bucketization

Authors(4) :-Raghunathan M, Ramakrishna V, Rathana kumar M, Murugesan M

Requested bucketization (OB), a primitive for permitting productive reach inquiries on encoded information. Initially, we address the open issue of portraying what encryption by means of an irregular request saving capacity spills about hidden information. Specifically, we demonstrate that, for a database of haphazardly circulated plaintexts and fitting decision of parameters, Random Order Preserving Function (ROPF) encryption releases neither the exact estimation of any plaintext nor the exact separation between any two of them. Then again, we likewise demonstrate that ROPF encryption does release both the estimation of any plaintext and additionally the separation between any two plaintexts to inside a scope of conceivable outcomes generally the square base of the space size. We then study an encryption plan with OB (EOB) and recommend another security model for EOB, IND-OCPA-P, which expect a foe has sensible force. The IND-OCPA-P model to dissect the security of the proposed EOB and the encryption plans supporting an effective reach question over encoded information. Since this model permits an enemy to question an encryption of a picked message, it is stronger than the security demonstrate on which the Order-saving Encryption Revisited was demonstrated secure.

Authors and Affiliations

Raghunathan M
Computer Science and Engineering, Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India
Ramakrishna V
Computer Science and Engineering, Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India
Rathana kumar M
Computer Science and Engineering, Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India
Murugesan M
Computer Science and Engineering, Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India

OCPA-P, ROPF, Requested bucketization , Order-saving Encryption, plaintext, semantic security, Order Preserving Encryption

 [1] Difference of Order Statistics in a Sample of Uniform Random Variables[Online].Available: http://math.stackexchange.com/questions/68749/difference-of-order-statistics-in-a-sample-of-uniform-random-variables, 2011.

[2] OPEN SSL: Cryptography and SSL/TLS Toolkit,”[Online].Available:http://www.openssl.org, 1999.

[3] R. Agrawal, J. Kiernan, R. Srikant, and Y.Xu,“Order preserving encryption for numeric data,” in Proc. ACM SIGMOD Int. Conf.Manage. Data, 2004, pp. 563-574.

[4] M. Bellare and P. Rogaway, “Course Notes on Introduction to Modern Cryptography,” [Online]. Available: http://cseweb.ucsd.edu/~mihir/cse207/index.html, 2005.

[5] A. Boldyreva, N. Chenette, Y. Lee, and A. O’Neill, “Order-pre-serving symmetric encryption,” in Proc. 31st Annu. Int. Conf. Adv.Cryptology, 2009, vol. 5479, pp. 224-241.

[6] A. Boldyreva, N. Chenette, and A. O’Neill, “Order-preserving encryption revisited: Improved security analysis and alternative solutions,” in Proc. 31st Annu. Conf. Adv. Cryptology, 2011,vol. 6841, pp. 578-595.

[7] D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Proc. 4th Conf. Theory Cryptography, 2007, pp. 535-554.

Publication Details

Published in : Volume 1 | Issue 2 | March-April 2015
Date of Publication : 2015-04-25
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 301-303
Manuscript Number : IJSRSET152287
Publisher : Technoscience Academy

Print ISSN : 2395-1990, Online ISSN : 2394-4099

Cite This Article :

Raghunathan M, Ramakrishna V, Rathana kumar M, Murugesan M, " Encryption scheme with Ordered Bucketization, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 1, Issue 2, pp.301-303, March-April-2015.
Journal URL : http://ijsrset.com/IJSRSET152287

Follow Us

Contact Us