数据库驱动的无线认知网络中基于加密概率数据结构的位置隐私保护
Location Privacy Preservation in Database-Driven Wireless Cognitive Networks Through Encrypted Probabilistic Data Structures
摘要:
在本文中,我们提出了新的位置隐私保护计划的数据库驱动的认知无线电网络,保护二级用户(SU)的位置隐私,同时允许他们学习频谱的可用性在他们附近。我们的计划利用概率集成员数据结构,利用光谱数据库(DB)和SU的查询的结构化性质。这使我们能够创建一个紧凑的DB表示,可以由SU查询,而不必与DB共享他们的位置,从而保证他们的位置隐私。我们提出的计划提供不同的成本性能的特点。我们的第一个方案依赖于一个简单而强大的两方协议,实现了无条件的安全性与合理的通信开销,通过DB发送一个压缩版本的内容,SU只需要查询这个数据结构学习频谱可用性。我们的第二个方案实现了显着降低通信和计算开销的SU,但需要一个额外的架构实体,接收压缩版本的数据库和获取频谱可用性信息代替SU,以减轻后者的开销。我们表明,我们的计划是安全的,并证明他们提供了显着的优势,现有的替代品的各种性能和/或安全指标。
英文摘要:
In this paper, we propose new location privacy preserving schemes for database-driven cognitive radio networks that protect secondary users' (SUs) location privacy while allowing them to learn spectrum availability in their vicinity. Our schemes harness probabilistic set membership data structures to exploit the structured nature of spectrum databases (DBs) and SUs' queries. This enables us to create a compact representation of DB that could be queried by SUs without having to share their location with DB, thus guaranteeing their location privacy. Our proposed schemes offer different cost-performance characteristics. Our first scheme relies on a simple yet powerful two-party protocol that achieves unconditional security with a plausible communication overhead by making DB send a compacted version of its content to SU which needs only to query this data structure to learn spectrum availability. Our second scheme achieves significantly lower communication and computation overhead for SUs, but requires an additional architectural entity which receives the compacted version of the database and fetches the spectrum availability information in lieu of SUs to alleviate the overhead on the latter. We show that our schemes are secure, and also demonstrate that they offer significant advantages over existing alternatives for various performance and/or security metrics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。