Double Blind Comparisons using Groups with Infeasible Inversion

Details Double Blind Comparisons using Groups with Infeasible Inversion Double Blind Comparisons using Groups with Infeasible Inversion

2011-05-16

arxiv.org/abs/1105.3237v1

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Double Blind Comparisons using Groups with Infeasible Inversion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Double Blind Comparisons using Groups with Infeasible Inversion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Double Blind Comparisons using Groups with Infeasible Inversion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727554