A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 22:19, 5 March 2024

scientific article; zbMATH DE number 5242868
Language Label Description Also known as
English
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
scientific article; zbMATH DE number 5242868

    Statements

    A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (English)
    0 references
    0 references
    0 references
    0 references
    5 March 2008
    0 references
    0 references