Abstract.With the ever increasing growth of cloud computing and the resulting outsourcing of data, concerns of data integrity, security, and privacy are also on the rise. Among these, evidence of data integrity, i.e., being tamper-evident and current, seem to be of immediate concern. While several integrity techniques currently exist, most result in significant overhead at the database owner site. For clients with large databases, these are not viable solutions. In this paper, we propose a computationally efficient alternative-database integrity with Bloom filters. We focus both on the tamper-evidence and freshness properties of the database as well as completeness of query results. We propose two schemes for integrity enforcement-first using aggregates signatures and second using authenticated data structures. We provide detailed analysis and experimental results to prove their efficiency and correctness. The results are compared with the traditional security hash functions such as SHA-1 and are shown to be computationally efficient. We have also implemented the schemes on multiprocessor systems which show further reduction in the execution time. Our results clearly demonstrate the feasibility and efficacy of employing Bloom filters to enforce integrity for outsourced databases in cloud environments.