A Linear Lower Bound on the Communication Complexity of Single-Server PIR - PowerPoint PPT Presentation

1 / 16
} ?>
View by Category
About This Presentation
Title:

A Linear Lower Bound on the Communication Complexity of Single-Server PIR

Description:

A Linear Lower Bound on the Communication Complexity of Single-Server PIR Iftach Haitner Jonathan Hoch Gil Segev Weizmann Institute of Science Israel – PowerPoint PPT presentation

Number of Views:22
Avg rating:3.0/5.0
Slides: 17
Provided by: Mast2275
Learn more at: http://www.cs.tau.ac.il
Category:

less

Write a Comment
User Comments (0)
About PowerShow.com