Memory security and reliability are two of the major design concerns in cloud computing systems. State-of-the-art memory security-reliability co-designs (e.g. Synergy) have achieved a good balance on performance, confidentiality, integrity, and reliability. However, these works merely rely on encryption to ensure data confidentiality, which has been proven unable to prevent information leakage from memory access patterns. Ring ORAM is an attractive confidential protection protocol to hide memory access patterns to the untrusted storage system. Unfortunately, it does not compatible with the security-reliability co-designs. A forced combination would result in more severe performance loss. In this paper, we propose IRO, an Integrity and Reliability enhanced Ring ORAM design. To reduce the overhead of integrity verification, we propose a low overhead integrity tree RIT and use a Minimum Update Subtree Tree (MUST) to reduce metadata update overhead. To improve memory reliability, we present Secure Replication to provide channel-level error resilience for the ORAM tree and use the mirrored channel technique to guarantee the reliability of the MUST. Last, we use the error correction pointer (ECP) to repair permanent memory cell fault to further improve device reliability and lifetime. A compact metadata design is used to reduce the storage and consulting overhead of the ECP. IRO provides strong security and reliability guarantees, while the resulting storage and performance overhead is very small. Our evaluation shows that IRO only increases 7.54% execution time on average over the Baseline under two channels four AES-GCM units setting. With enough AES-GCM units to perform concurrent MAC computing, IRO can reduce 2.14% execution time of the Baseline.
翻译:内存安全和可靠性是云计算系统的主要设计关切中的两个主要问题。 最先进的内存安全- 可靠性共同设计(如协同)在性能、 保密性、 完整性和可靠性方面实现了良好的平衡; 然而,这些工程仅仅依靠加密来确保数据保密性,而数据保密性被证明无法防止信息从内存存存取模式中泄漏。 环 ORAM是一个具有吸引力的保密保护协议,以隐藏对不受信任的存储系统的内存访问模式。 不幸的是, 它与安全可靠性共同设计不兼容。 强制组合会导致更严重的性能损失。 在本文件中,我们提议IRO,一个完整性和可靠性增强的Ring ORAM设计。 为了减少完整性核查的间接费用,我们建议使用一个较低的高端完整性树 RIT 并使用一个最低更新 Subtree树(MS) 来减少元数据更新管理管理。 为了提高记忆可靠性,我们介绍S Secretail Resicial Retaility istration for the cal- le liver listal listal reduction A.