安全和可扩展的匹配：使用组程序克服通用电路瓶颈
Secure and scalable match: overcoming the universal circuit bottleneck using group programs
摘要：
基于机密内容的发布/订阅（C-CBPS）是一种交互（pub/sub）模型，允许各方交换数据，同时仍然保护他们的安全和隐私利益。在本文中，我们提出了最先进的C-CBPS显示所有谓词电路在NC 1（深度，有界扇入）可以安全地计算的经纪人，同时保证完美的信息理论安全。以前的工作只能处理严格较浅的电路（例如深度为O（\sqrt{\lg n}）的电路[SYY 99，V76]。我们提出了三个协议- UGP-Match，FSGP-Match和OFSGP-Match -所有这三个都是基于（2-可分解的随机编码）组程序和处理电路在NC 1。UGP-Match在概念上很简单，并且有一个清晰的正确性证明，但它效率低下，不切实际。FSGP-Match使用“固定结构”技巧来实现效率和可伸缩性。最后，OFSGP-Match使用手动优化的组程序来提高效率。我们完成了我们的调查与原型实现的实验评估。
英文摘要：
Confidential Content-Based Publish/Subscribe (C-CBPS) is an interaction (pub/sub) model that allows parties to exchange data while still protecting their security and privacy interests. In this paper we advance the state of the art in C-CBPS by showing how all predicate circuits in NC1 (logarithmic-depth, bounded fan-in) can be securely computed by a broker while guaranteeing perfect information-theoretic security. Previous work could handle only strictly shallower circuits (e.g. those with depth O(\sqrt{\lg n}) [SYY99, V76]. We present three protocols -- UGP-Match, FSGP-Match and OFSGP-Match -- all three are based on (2-decomposable randomized encodings of) group programs and handle circuits in NC1. UGP-Match is conceptually simple and has a clean proof of correctness but it is inefficient and impractical. FSGP-Match uses a "fixed structure" trick to achieve efficiency and scalability. And, finally, OFSGP-Match uses hand-optimized group programs to wring greater efficiencies. We complete our investigation with an experimental evaluation of a prototype implementation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
