Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Honest-Verifier Private Disjointness Testing Without Random Oracles
verfasst von : Susan Hohenberger, Stephen A. Weis
Erschienen in: Privacy Enhancing Technologies
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We present an efficient construction of a
private disjointness testing
protocol that is secure against malicious provers and honest-but-curious (semi-honest) verifiers, without the use of random oracles. In a completely semi-honest setting, this construction implements a
private intersection cardinality
protocol. We formally define both private intersection cardinality and private disjointness testing protocols. We prove that our construction is secure under the
subgroup decision
and
subgroup computation
assumptions. A major advantage of our construction is that it does not require bilinear groups, random oracles, or non-interactive zero knowledge proofs. Applications of private intersection cardinality and disjointness testing protocols include privacy-preserving data mining and anonymous login systems.