New PIR schemes store n+1 bits and answer queries in sublinear time
For two servers, query time is n^0.82, matching prior EUROCRYPT 2026 schemes with far less storage.
Stories per day · 30 days
1 stories, newest first · one card per story
1 stories, newest first · one card per story
For two servers, query time is n^0.82, matching prior EUROCRYPT 2026 schemes with far less storage.
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views