3 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.CR2011★ 3 cited
Double Blind Comparisons: A New Approach to the Database Aggregation Problem
William R. Lorimer
The Data Aggregation Problem occurs when a large collection of data takes on a higher security level than any of its individual component records. Traditional approaches of breakin…
cs.CR2011★ 2 cited
Double Blind Comparisons using Groups with Infeasible Inversion
William R. Lorimer
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 pla…