1 / 28

new tools and techniques for practical private set intersection

Explore new techniques for practical private set intersection with advanced protocols ensuring secure data exchange while maintaining privacy. Learn about innovative methods unlocking efficient communication and improved security measures.

cwhitley
Download Presentation

new tools and techniques for practical private set intersection

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. new tools and techniques for practical private set intersection Student: Ni Trieu Advisor: Mike Rosulek Joint work with: Vladimir Kolesnikov, RanjitKumaresan, NaorMatania, Benny Pinkas

  2. Private Set Intersection (PSI) June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  3. PSI APP:Contact discovery June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  4. A naïve & Insecure PSI protocol Alice Bob X Y Hash each element of Y Hash each element of X Bob sends H(Y) to Alice H(Y) H(X) Alice compares 2 sets of hash values, output the intersection X H(#) Pro: Fast, and low communication Con: Insecure, leak privacy of Bob's inputs June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  5. Our outline PSI and Its application Naïve and Insecure PSI protocol Previous 2-party PSI protocols Our 2-party PSI protocol New term: Oblivious Programmable PRF (O[P]PRF) OPPRF application to Multi-party PSI Further works *: This talk is on Semi-honest setting June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  6. secure PSI protocol # Public keys ~ Set size Plain Intersection 1. PSI based on Garble Circuit[Yao86, GMW87, HEK12]: • Circuit size: 2. PSI based on Diffie-Hellman[M86, HFH99,AES03] 3. PSI based on Oblivious Polynomial Evaluation[FNP04,KS05,CJS12,HV17] • Implemented based on additively homomorphic encryption • Support multi-party PSI 4. PSI based on Oblivious Transfer (OT) [PSZ14, PSSZ15,KKRT16,PSZ16] • Few public keys + more symmetric keys June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  7. Oblivious Transfer Extension[IKNP03] Oblivious Transfer Few Public keys + more symmetric keys • 1 – out –of 2 OT: • Sender has two strings • Receiver has a selection bit • After OT: Receiver gets ; Sender receives nothing • Doing 1-out-of-2 OT: • is large, e.g. • Need 128 Public Keys for base OT • Extend to OTs using symmetric keys June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  8. secure PSI protocol OT 8 4. PSI based on Oblivious Transfer[PSZ14, PSSZ15] • Special case: private set inclusion, where two parties learn whether • Alice input: Bob input: • Oblivious Transfer (OT) bit by bit ( are a random -bit string ) • Bob computes: • Sends these values to Alice • Alice computes and compares • If • If , and are diffirent in at least 1 bit => Alice does not know at least one so looks random June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  9. An observation [PSZ14, PSSZ15] OPRF Compares the two lists An observation: OPRF from [PSZ14, PSSZ15] Bob has a key , he computes for any and sends to Alice Alice compares and => Output the intersection June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  10. OUR 2-party PSI[KKRT16] OPRF • OPRF from [PSZ14, PSSZ15] • compute the OPRF bit by bit (byte by byte) of OTs for each comparison OTs in total • [KKRT16]: Proposed an efficient Batched Oblivious PRF protocol based on OT • Need OT for each comparison OTs in total • Independent of the input length • Our PSI protocol is 3x faster than previous • Main idea: Replace underlying error-correcting code by a random cryptographic hash • (we skip the detail of our protocol since it is complicated) June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  11. Comparison of Semi-Honest 2-PSI • Number of elements: • Length of elements : 128 bits Circuit-based OT+Hash'14 OT+Phasing'15 Ours Public-key-Based ï Na ve Circuit-Based: +: general -: high run-time Public-key-Based: +: best communication -: high run-time OT-Based: +: best run-time +: good communication June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  12. MuLTI-PARTY PSI Practical Multi-party Private Set Intersection from Symmetric-Key Techniques (Submitted) Joint work with: Vladimir Kolesnikov NaorMatania Benny Pinkas Mike Rosulek June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  13. MuLTI-PARTY PSI m m • Party ONLY learns • nothing on partial intersection • talk together, they cannot learn anything about dataset beyond the intersection item June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  14. OUR Oblivious programmable PRF(OPPRF) , , Programmable OPRF Oblivious Programmable PRF: Bob can program the output of PRF! Bob has some specific points: , Alice queries If , Alice gets If is not in Bob’ set, Alice gets a random output. Need: all are randomly distributed June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  15. OUR Oblivious programmable PRF construction 𝑥 OPRF • Idea: • Parties invoke a regular OPRF • Sender sends some “correction values” (hints) • Receiver applies hints to the plain OPRF output • Main challenge: hints should hide which set of points are programmed • We proposed 3 different constructions of OP[P]RF with differenttradeoffs in computation, communication, number of points, number of queries. June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  16. OUR Polynomial based-OPPRF OPPRF • Run OPRF[KKRT16] as receiver => Input , Output: ) • Output: • Run OPRF[KKRT16] as sender. => Output: key • Compute: • Chooses the polynomialof degree n-1 such that: • Sends coefficients of Simplest protocol: Polynomial based-OPPRF with best communication Correctness: If . Otherwirse, is random Security: are random => don’t leak anything on or Cost: the interpolation of the polynomial takes time . Communication takes In the paper we show another OPPRF protocol with linear time and linear communication

  17. Unconditional Zero sharing • Purpose: parties agree on a share of zero if they have common x Party chooses random seeds and sends it to For each , computes share using PRF If x is in Intersection, computes a right share of zero June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  18. Unconditional Zero sharing • Purpose: parties agree on a share of zero if they have common x • Sending keys in an one time • An unlimited number of zero-sharings • However, set of corrupted parties can image what the correct zero share of honest party would be • In the paper, we show another protocol with interactive way to address this problem. Party chooses random seeds and sends it to For each , computes share using PRF If x is in Intersection, computes a right share of zero Otherwise, computes an incorrect share of zero

  19. OPPRF application: MULTi-PARTY PSI OPPRF OPPRF • Who can check the XORing of share? • Choose be a Leader • Other party creates point • and invoke OPPRF • gets when querying on • outputs intersection if OPPRF June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  20. OPPRF application: MULTi-PARTY PSI OPPRF OPPRF • Who can check the XORing of share? • Choose be a Leader • Other party creates point • and invoke OPPRF • gets when querying on • outputs intersection if OPPRF • Security: if is NOT in intersection, OPPRF receiver gets random output • leak no information on June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  21. OUR Multi-PARTY psi PERFORMANCE • First multi-party PSI from symmetric keys with constant rounds. • Number of elements: • Length of elements : 128 bits

  22. OUR Multi-PARTY psi PERFORMANCE • ) June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  23. The End! Thank you June-2016 | New Tools and Techniques for Practical Private Set Intersection | Ni Trieu

  24. Reference KKRT16. Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, and Ni Trieu. Efficient batched oblivious PRF with applications to private set intersection. In ACM Computer and Communications Security (CCS’16), pages 818–829. ACM, 2016 PSZ14. Benny Pinkas, Thomas Schneider, and Michael Zohner. Faster private set intersection based on OT extension. In USENIX Security Symposium’14, pages 797–812. USENIX, 2014. PSSZ15. Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. Phasing: Private set intersection using permutation-based hashing. In USENIX Security Symposium’15, pages 515–530. USENIX, 2015. FNP04. Michael J. Freedman, KobbiNissim, and Benny Pinkas. Efficient private matching and set intersection. In Advances in Cryptology – EUROCRYPT’04, volume 3027 of LNCS, pages 1–19. Springer, 2004 CJS12. Jung HeeCheon, Stanislaw Jarecki, and Jae Hong Seo. Multi-party privacy-preserving set intersection with quasi-linear complexity. IEICE Transactions, 95-A(8):1366–1378, 2012. HV17. CarmitHazay and MuthuramakrishnanVenkitasubramaniam. Scalable multi-party private setintersection. Cryptology ePrint Archive, Report 2017/027, 2017. http://eprint.iacr.org/ 2017/027

  25. OUR programmable OPRF OPPRF 2. Bloom Filter based-OPPRF • Garbled BF[DCW13]: • Representing the set by a bitstring array. • Each item is mapped to k positions under k different hash function. E.g. • Set the bitsstring at all these positions to 1random subject to XORing equal to . Fill dummy to rest. • The colored arrows show the positions in the bitstring array that each set element is mapped to. • The element  is not in the set . XORing the string of their position is random.

  26. OUR programmable OPRF OPPRF • Run OPRF[KKRT16] as sender. => Output: key • Compute: • Generates the GarbledBloom Filter over by: • Sends • Run OPRF[KKRT16] as receiver => Input , Output: • Compute: • If • Otherwise, is random 2. Bloom Filter based-OPPRF Cost: Insertion algorithm runs in time Communication is still but the constant coefficient is high (items) Allows to do many queries on diffirent

  27. OUR programmable OPRF OPPRF • Run OPRF[KKRT16] as sender. => Output: key • Compute: • Generates the Table of size by : • Sample vector such that are all distinct • Insert into • Run OPRF[KKRT16] as receiver => Input , Output: 3. Table based-OPPRF is in random distribution, 128-bit string finding with high prob. efficient for small

  28. OUR programmable OPRF OPPRF • Run OPRF[KKRT16] as sender. => Output: key • Compute: • Generates the Table of size by : • Sample vector such that are all distinct • Insert into • Fill out other empty rows by dummy • Sends • Run OPRF[KKRT16] as receiver => Input , Output: • Compute: • Output: 3. Table based-OPPRF is in random distribution, 128-bit string finding with high prob. efficient for small Allows one query because of one time pad:

More Related