使用具有不可行反演的组的双盲比较
Double Blind Comparisons using Groups with Infeasible Inversion
摘要：
双盲比较是一种新的密码学原语，它允许拥有密文的用户确定相应的明文是否与不同用户持有的不同密文的明文相同，但前提是两个用户合作。两个用户都不知道对应于任一密文的明文的任何信息，并且作为比较的结果，除了两个明文是否相同之外，两个用户都不知道关于明文的任何信息。没有另一个用户的合作，任何一个用户都不能确定明文是否相等。双盲比较在匿名证书和数据库聚合问题中有潜在的应用。本文展示了如何使用强关联单向函数（SAOWF）实现双盲比较。安全性的证明，使一个额外的假设，SAOWF是实现在一个集团与不可行的反演（GII），其存在的假设是由Hohenberger和Molnar。
英文摘要：
Double Blind Comparison is a new cryptographic primitive that allows a user who is in possession of a ciphertext to determine if the corresponding plaintext is identical to the plaintext for a different ciphertext held by a different user, but only if both users co-operate. Neither user knows anything about the plaintexts corresponding to either ciphertext, and neither user learns anything about the plaintexts as a result of the comparison, other than whether the two plaintexts are identical. Neither user can determine whether the plaintexts are equal without the other user's co-operation. Double Blind Comparisons have potential application in Anonymous Credentials and the Database Aggregation Problem. This paper shows how Double Blind Comparisons can be implemented using a Strong Associative One-Way Function (SAOWF). Proof of security is given, making an additional assumption that the SAOWF is implemented on a Group with Infeasible Inversion (GII), whose existence was postulated by Hohenberger and Molnar.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
