US Patent Application 17752326. PRIVATE SET INTERSECTION FROM BRANCHING PROGRAMS simplified abstract
Contents
PRIVATE SET INTERSECTION FROM BRANCHING PROGRAMS
Organization Name
Inventor(s)
Anselme Tueno of Ettlingen (DE)
Jonas Janneck of Mannheim (DE)
PRIVATE SET INTERSECTION FROM BRANCHING PROGRAMS - A simplified explanation of the abstract
This abstract first appeared for US patent application 17752326 titled 'PRIVATE SET INTERSECTION FROM BRANCHING PROGRAMS
Simplified Explanation
The patent application introduces a protocol for private set intersection in two-party computation.
- The protocol allows two parties with private data sets to securely compute the intersection of their sets.
- The result is the only information revealed, ensuring privacy.
- The protocol relies on a branching program evaluated using fully homomorphic encryption (FHE) scheme.
- The FHE scheme allows for non-interactive protocol with extendable functionalities.
- The result of the intersection can be used for further secure computations.
- The communication overhead for practical applications is independent of the server's set size, allowing for easy scalability.
Original Abstract Submitted
In an example embodiment, a protocol for private set intersection is introduced that provides for two-party computation. Each party has a private data set and both parties want to securely compute the intersection of their sets, such that only the result is revealed and nothing else. Construction rules are provided that rely on the evaluation of a branching program (BP) using a fully homomorphic encryption (FHE) scheme. Using the properties of an FHR scheme, a non-interactive protocol is built with extendable functionalities. Thus, not only can the intersection be securely computed but the result can be used for further secure computations. Furthermore, the communication overhead for practical applications is independent of the server's set size, allowing for easy scalability.