TEEMATE: Fast and Efficient Confidential Container using Shared Enclave
Chulmin Lee, Jaewon Hur, Sangho Lee, Byoungyoung Lee

TL;DR
TeeMate introduces a shared enclave approach for confidential containers, significantly reducing startup latency and memory footprint by enabling resource sharing across processes, thus enhancing efficiency and practicality.
Contribution
The paper presents a novel shared enclave design that allows multiple processes to share enclave memory and threads, overcoming performance limitations of traditional confidential containers.
Findings
Achieves at least 4.5x lower latency
Reduces memory usage by 2.8x
Demonstrates practical benefits in serverless and database applications
Abstract
Confidential container is becoming increasingly popular as it meets both needs for efficient resource management by cloud providers, and data protection by cloud users. Specifically, confidential containers integrate the container and the enclave, aiming to inherit the design-wise advantages of both (i.e., resource management and data protection). However, current confidential containers suffer from large performance overheads caused by i) a larger startup latency due to the enclave creation, and ii) a larger memory footprint due to the non-shareable characteristics of enclave memory. This paper explores a design conundrum of confidential container, examining why the confidential containers impose such large performance overheads. Surprisingly, we found there is a universal misconception that an enclave can only be used by a single (containerized) process that created it. However, an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Distributed and Parallel Computing Systems · Peer-to-Peer Network Technologies
