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

DKVE:端到端加密消息的去中心化密钥验证

DKVE: Decentralized Key Validation for End-to-End Encrypted Messaging

Seoul National University(首尔大学)

Subin Song, Taekyoung Kwon

AI总结:

提出DKVE协议,利用用户社交图进行隐私保护的交叉验证,结合OPRF和OKVS保护隐私,采用SPRT聚合响应检测中间人攻击,在强到中等关系网络中检测率超97%。

摘要:

端到端加密消息系统依赖于真实的公钥分发来防止中间人(MitM)攻击。当前的解决方案存在明显的权衡:带外(OOB)验证提供了强大的安全性,但缺乏对大型联系人列表的可扩展性,而密钥透明(KT)系统以高存储成本和操作复杂性实现了自动验证。我们提出了DKVE,一种通过用户社交图中隐私保护的交叉验证来验证公钥的协议。当从密钥服务器获取联系人的公钥时,客户端查询共同联系人以验证他们持有相同的密钥,结合了不经意伪随机函数(OPRF)和不经意键值存储(OKVS)来保护查询和联系人列表的隐私。DKVE采用序贯概率比检验(SPRT)来聚合响应,并以用户可配置的错误界限检测服务器不当行为。我们通过在真实社交网络数据集上的模拟评估了DKVE,结果表明DKVE在强到中等关系网络中检测MitM攻击的成功率超过97%。剩余的3%情况需要通过KT和OOB验证等替代方法进行验证。我们的概念验证实现证实了在商品硬件上后台操作的可行性,就延迟和带宽而言。由于DKVE可以将KT查询的频率降低两个数量级,它使得基本的架构转变成为可能:KT目录可以从快速但空间效率低的Merkle树迁移到空间高效的数据结构,如RSA累加器。虽然DKVE不能完全替代现有方法——存在引导问题并在弱关系网络上性能下降——但它提供了一种实用的补充密钥验证机制,使安全消息传递在十亿用户系统中更易部署。

英文摘要:

End-to-end encrypted messaging systems depend on authentic public key distribution to prevent man-in-the-middle (MitM) attacks. Current solutions present a stark trade-off: out-of-band (OOB) verification provides strong security but lacks scalability for large contact lists, while key transparency (KT) systems enable automated verification at high storage costs and operational complexity. We propose DKVE, a protocol that validates public keys through privacy-preserving cross-validation within users' social graphs. When obtaining a contact's public key from a key server, clients query mutual contacts to verify they hold the same key, combining Oblivious Pseudorandom Functions (OPRF) and Oblivious Key-Value Stores (OKVS) to preserve privacy of both queries and contact lists. DKVE employs a Sequential Probability Ratio Test (SPRT) to aggregate responses and detect server misbehavior with user-configurable error bounds. We evaluate DKVE through simulations on real social network datasets, demonstrating DKVE can detect MitM attacks with exceeding 97% for strong-to-moderate-tie networks. The remaining 3% of cases require validation through alternative methods such as KT and OOB verification. Our proof-of-concept implementation confirms feasibility for background operation on commodity hardware, in terms of the latency and bandwidth. As DKVE can reduce the frequency of KT queries by two orders of magnitude, it enables fundamental architectural shifts: KT directories can migrate from fast but space-inefficient Merkle trees to space-efficient data structures like RSA accumulators. While DKVE cannot replace existing methods entirely -- suffering from bootstrapping problems and degraded performance on weak-tie networks -- it provides a practical complementary key validation mechanism, making secure messaging more deployable for billion-user systems.

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

↑