Oblivous RAM (ORAM) is a cryptography designed for protecting data acccess patterns when encrypted data are accessed. Most previous schemes suffer from such a time-channel ORAM leakage, which is the time privacy of data reading or data writing, such as PATH-ORAM. Time channel leakage maybe result in disastrous losses if the leakage has been abused. To address the issue, we propose DS-ORAM, a tree-based ORAM scheme without time channel leakage. We use double stashes to process fetched data in the client-side. This strategy helps us to avoid time-channel leakage and access pattern leakage. Security analysis shows that DS-ORAM achieves proven security. Extensive experimental results demonstrate that DS-ORAM outperforms PATH-ORAM in terms of access efficiency when the stash is large.