1 / 14

On the Computational Practicality of Private Information Retrieval

On the Computational Practicality of Private Information Retrieval. Bogdan Carbunar Pervasive Platforms and Architectures Motorola Labs -By Nafia Malik . Radu Sion Network Security and Applied Cryptography Lab Computer Sciences, Stony Brook University. Motivation and Goal.

dessa
Download Presentation

On the Computational Practicality of Private Information Retrieval

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. On the Computational Practicality of Private Information Retrieval BogdanCarbunarPervasive Platforms and Architectures Motorola Labs -By NafiaMalik. RaduSion • Network Security and Applied Cryptography Lab Computer Sciences, Stony Brook University

  2. Motivation and Goal • PIR(Private Information Retrieval): primitive for accessing outsource data over a network, while preventing the storer to learn anything about client access pattern. • cPIR involves multiplication. • Multiplications is complex and requires higher computational running time. • Risks: increased running time->High prob(forward leakage.) • Scope: Single server cPIR.

  3. Building Blocks • Hardware • Pentium 4 • Parallelism • MIPS • Fast Modular Arithmetic Algorithm • Quadratic Residuosity PIR • The cPIR algorithm • The boundary condition • Key size

  4. Fast Modular Arithmetic Algorithm • Key size: • Highly efficient modular multiplication

  5. Quadratic ResiduosityPIR(Algo.)

  6. Quadratic ResiduosityPIR(boundary condition)

  7. Timeline • Past • 1995 to 2005 • Present • 2006 • Future • 2006 to 2035

  8. Past

  9. Past (Contd.)

  10. Present

  11. Future • Moore’s Law: number of transistors on integrated circuit doubles every 18 month(Intel=> doubling processor MIPS every 2 year) • Nielsen’s Law: Highend network bandwidth grows at least by 50% per year.

  12. Future(Contd.)

  13. Limitations of the Arguments • Symmetric PIR • l = log n key pairs, • n to transfer from PIR to SPIR • Client can retrieve one key out of every pair and unmask 1 out of n items. • Computation-Amortized PIR • Multi client computation • 2 way anonymization

  14. Conclusions & Recommendations • Contributions: • Explore single server PIR for client privacy. • Empirical results for Past Present future. • Unrealistic example for PIR usefulness. • Recommendations : • Redesign protocol • Reshuffling instead of multiplications for efficiency.

More Related