Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval 论文

2003引用 228
DOI
Cryptography and Data SecurityComplexity and Algorithms in GraphsPrivacy-Preserving Technologies in Data
Cryptography and Data SecurityPrivacy-Preserving Technologies in DataComplexity and Algorithms in Graphs
相关技术:Complexity and Algorithms in Graphs
关系图谱

Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval · 相关文章

暂无数据