Visible to the public ObliComm: Towards Building an Efficient Oblivious Communication System

TitleObliComm: Towards Building an Efficient Oblivious Communication System
Publication TypeJournal Article
Year of Publication2019
AuthorsWu, Pengfei, Deng, Robert, Shen, Qingni, Liu, Ximeng, Li, Qi, Wu, Zhonghai
JournalIEEE Transactions on Dependable and Secure Computing
Keywordsanonymous communication, Communication systems, composability, horizontal scaling, metadata, modular framework, Network topology, pubcrawl, queuing theory, Receivers, Scalability, security, Servers
AbstractAnonymous Communication (AC) hides traffic patterns and protects message metadata from being leaked during message transmission. Many practical AC systems have been proposed aiming to reduce communication latency and support a large number of users. However, how to design AC systems which possess strong security property and at the same time achieve optimal performance (i.e., the lowest latency or highest horizontal scalability) has been a challenging problem. In this paper, we propose an ObliComm framework, which consists of six modular AC subroutines. We also present a strong security definition for AC, named oblivious communication, encompassing confidentiality, unobservability, and a new requirement sending-and-receiving operation hiding. The AC subroutines in ObliComm allow for modular construction of oblivious communication systems in different network topologies. All constructed systems satisfy oblivious communication definition and can be provably secure in the universal composability (UC) framework. Additionally, we model the relationship between the network topology and communication measurements by queuing theory, which enables the system's efficiency can be optimized and estimated by quantitative analysis and calculation. Through theoretical analyses and empirical experiments, we demonstrate the efficiency of our scheme and soundness of the queuing model.
Citation Keywu_oblicomm_2019