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.
Tag
#private-information-retrieval
1 stories this week · 2 this month · 3 in 6 months · mostly security
Stories per day · 30 days
3 stories, newest first · one card per story
Stories tagged #private-information-retrieval
Quantum PIR scheme for forest graphs achieves rate 3/N
The scheme uses GHZ state and achieves rate 3/N for forest graphs, more efficient than prior work, with capacity 4/6 for G=3K_2.
Private Information Retrieval With Arbitrary Privacy Requirements: Introduction and Capacity Results
Researchers formulate private information retrieval under arbitrary graph-based privacy requirements, deriving capacity bounds and introducing pyramid storage graphs.