We propose a novel architectural techniques in this paper in order to decrease the overhead of memory integrity verification using cached hash trees. We suggest using a separate L2 hash cache to store internal nodes of a hash tree since those nodes show different locality of access than regular application data. Our simulations results indicate that our simple but novel scheme can reduce the overhead by 8.6% for a heavily loaded APACHE server.