arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1408.3843cs.CR
收藏

零知识列表上的可验证成员和顺序

Verifiable Member and Order Queries on a List in Zero-Knowledge

Esha Ghosh, Olga Ohrimenko, Roberto Tamassia

摘要:

在传统的认证数据结构模型中,我们引入了零知识列表上订单查询的形式化模型。我们称这种模型为隐私保护认证列表(PPAL)。在这个模型中,查询是在存储在(不受信任的)云中的列表上执行的,其中必须维护数据的完整性和隐私。为了实现高效的认证数据结构,我们首先采用一致性数据查询模型。为此,我们引入了一个正式的模型,称为零知识列表(ZKL)计划,它概括了一致的成员资格查询零知识一致的成员资格和顺序查询在一个完全有序的零知识集。提出了一种基于零知识集和同态整数承诺方案的ZKL构造方法。然后,我们讨论了为什么这种构造在云应用中不如期望的那样有效,并提出了一种基于双线性映射和双线性映射的PPAL的有效构造,该构造是可证明安全和零知识的。

英文摘要:

We introduce a formal model for order queries on lists in zero knowledge in the traditional authenticated data structure model. We call this model Privacy-Preserving Authenticated List (PPAL). In this model, the queries are performed on the list stored in the (untrusted) cloud where data integrity and privacy have to be maintained. To realize an efficient authenticated data structure, we first adapt consistent data query model. To this end we introduce a formal model called Zero-Knowledge List (ZKL) scheme which generalizes consistent membership queries in zero-knowledge to consistent membership and order queries on a totally ordered set in zero knowledge. We present a construction of ZKL based on zero-knowledge set and homomorphic integer commitment scheme. Then we discuss why this construction is not as efficient as desired in cloud applications and present an efficient construction of PPAL based on bilinear accumulators and bilinear maps which is provably secure and zero-knowledge.

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

↑