Encryption scheme with Ordered Bucketization
M Raghunathan, Ramakrishna Ramakrishna, M, Rathana kumar, M Murugsan · Zenodo (CERN European Organization for Nuclear Research) · 2015
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.