English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The Data Aggregation Problem occurs when a large collection of data takes ona higher security level than any of its individual component records.Traditional approaches of breaking up the data and restricting access on a"need to know" basis take away one of the great advantages of collecting thedata in the first place. This paper introduces a new cryptographic primitive,Double Blind Comparisons, which allows two co-operating users, who each have anencrypted secret, to determine the equality or inequality of those two secrets,even though neither user can discover any information about what the secret is.This paper also introduces a new problem in bilinear groups, conjectured to bea hard problem. Assuming this conjecture, it is shown that neither user candiscover any information about whether the secrets are equal, without the otheruser's co-operation. We then look at how Double Blind Comparisons can be usedto mitigate the Data Aggregation Problem. Finally, the paper concludes withsome suggested possibilities for future research and some other potential usesfor Double Blind Comparisons.

Double Blind Comparisons: A New Approach to the Database Aggregation Problem