YoVDO

Almost There: Capacity of PIR from Coded and Colluding Servers

Offered By: Centre International de Rencontres Mathématiques via YouTube

Tags

Coding Theory Courses Cryptography Courses Information Theory Courses Algebraic Geometry Courses Reed-Solomon Codes Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a conference talk on the capacity of Private Information Retrieval (PIR) from coded and colluding servers, presented by Camilla Hollanti at the Centre International de Rencontres Mathématiques in Marseille, France. Delve into this 54-minute recording from the thematic meeting on "Algebraic and Combinatorial Methods for Coding and Cryptography" held on February 21, 2023. Gain insights into the latest developments in PIR capacity research, focusing on scenarios involving coded data and potential server collusion. Access this talk and other presentations by renowned mathematicians through CIRM's Audiovisual Mathematics Library, which offers features such as chapter markers, keywords, enriched content with abstracts and bibliographies, and a multi-criteria search function for easy navigation and exploration of mathematical topics.

Syllabus

Camilla Hollanti : Almost there: capacity of PIR from coded and colluding servers


Taught by

Centre International de Rencontres Mathématiques

Related Courses

Secure Computation: Part II
NPTEL via Swayam
CRaft - An Erasure-coding-supported Version of Raft for Reducing Storage Cost
USENIX via YouTube
Proximity Gaps for Reed-Solomon Codes
IEEE via YouTube
Codes from Polynomials Over Finite Fields
Joint Mathematics Meetings via YouTube
Coding Theoretic Framework for Private Information Retrieval - SIAM SAGA Seminar
Society for Industrial and Applied Mathematics via YouTube