arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.02782cs.CR
收藏

具有期望常量轮的私有Web搜索

Private Web Search with an Expected Constant Round

Myungsun Kim

摘要:

网络搜索正在成为一项重要的活动,因为它通常是最有效和最方便的方式找到信息。然而,Web搜索可能对用户的隐私构成威胁,因为查询可能会泄露关于用户的敏感信息。私有网络搜索(PWS)解决方案允许用户在互联网上查找信息,同时保护他们的隐私。在这里,隐私意味着保持通信用户身份的机密性。根据其底层技术,现有的PWS解决方案可以分为三种类型:基于代理的解决方案,基于混淆的解决方案和基于加密的解决方案。其中,基于密码的PWS(CB-PWS)系统特别有趣,因为它们在密码学意义上提供了强大的隐私保证。在本文中,我们提出了一个轮效率的CB-PWS协议,保持计算效率相比,其他已知的CB-PWS系统。假设一个广播信道,我们的协议是一个\emph{four-round}加密方案,需要$O(n)$通信复杂性。然而,如果只有点对点的互动是可用的,与用户模拟的广播信道,我们的协议需要一个预期的$O(1)$轮复杂度和相同的计算和通信开销。进一步分析我们的协议的效率表明,我们的建议只需要$3n$模幂为$n$用户。为了评估我们的协议的安全性,我们证明了我们的建设是安全的半诚实的模型。然后,我们讨论如何增强其安全性,使其在恶意对手的存在下是安全的。我们提供了一个特定的协议来管理用户组,这也是现有系统的一个优势。

英文摘要:

Web searching is becoming an essential activity because it is often the most effective and convenient way of finding information. However, a Web search can be a threat to the privacy of the searcher because the queries may reveal sensitive information about the searcher. Private Web search (PWS) solutions allow users to find information on the Internet while preserving their privacy. Here, privacy means maintaining the confidentiality of the identity of the communicating users. According to their underlying technology, existing PWS solutions can be divided into three types: proxy-based solutions, obfuscation-based solutions, and cryptography-based solutions. Of these, cryptography-based PWS (CB-PWS) systems are particularly interesting because they provide strong privacy guarantees in the cryptographic sense. In this paper, we present a round-efficient CB-PWS protocol that preserves computational efficiency compared to other known CB-PWS systems. Assuming a broadcast channel, our protocol is a \emph{four-round} cryptographic scheme that requires $O(n)$ communication complexity. However, if only point-to-point interaction is available, with the users emulating the broadcast channel, our protocol requires an expected $O(1)$-round complexity and the same computation and communication overhead. Further analyzing the efficiency of our protocol shows that our proposal requires only $3n$ modular exponentiations for $n$ users. To evaluate the security of our protocol, we demonstrate that our construction is secure in terms of a semi-honest model. We then discuss how to enhance its security to render it secure in the presence of malicious adversaries. We provide a specific protocol for managing users' groups, which is also an advantage over existing systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑