most citedTreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2022★ 1 cited

TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead

Son Hoang Dau, Quang Cao, Rinaldo Gagiano +9

A Batch Private Information Retrieval (batch-PIR) scheme allows a client to retrieve multiple data items from a database without revealing them to the storage server(s). Most exist…