Data encryption using Counting Bloom Filters for cloud security

Encryption of data is of utmost importance for secure transmission. Traditional keyword search techniques downloading all the data and decrypting locally is clearly impractical, due to the huge amount of bandwidth cost in cloud scale systems. This paper presents a methodology for encrypting the data for limited reserved strings that are stored in Counting Bloom Filters (CBF). CBF is a small array of element addresses that are connected to the array through a hashing mechanism. Counting bloom filter is used for increasing the speed of the set membership tests. If the string is a member of counting bloom filter it is encrypted using Data Encryption Standard, else the string is transmitted without encryption. This reduces the effective time for encryption and increases security.