PIR Schemes With Small Download Complexity and Low Storage Requirements

From MaRDI portal

Revision as of 17:27, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5211617

Jump to:navigation, search

DOI10.1109/TIT.2019.2942311zbMath1433.68116arXiv1609.07027OpenAlexW2973612336MaRDI QIDQ5211617

Tuvi Etzion, Simon R. Blackburn, Maura B. Paterson

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.07027

Mathematics Subject Classification ID

Database theory (68P15) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Private Information Retrieval from Coded Databases with Colluding Servers

This page was built for publication: PIR Schemes With Small Download Complexity and Low Storage Requirements

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5211617&oldid=19811158"