4.5 Article

2-Server PIR with Subpolynomial Communication

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Theory & Methods

Query-Efficient Locally Decodable Codes of Subexponential Length

Yeow Meng Chee et al.

COMPUTATIONAL COMPLEXITY (2013)

Article Mathematics

Public key exchange using matrices over group rings

Delaram Kahrobaei et al.

GROUPS COMPLEXITY CRYPTOLOGY (2013)

Article Computer Science, Theory & Methods

3-QUERY LOCALLY DECODABLE CODES OF SUBEXPONENTIAL LENGTH

Klim Efremenko

SIAM JOURNAL ON COMPUTING (2012)

Article Computer Science, Theory & Methods

MATCHING VECTOR CODES

Zeev Dvir et al.

SIAM JOURNAL ON COMPUTING (2011)

Article Computer Science, Information Systems

Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length

Toshiya Itoh et al.

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2010)

Article Computer Science, Hardware & Architecture

Towards 3-query locally decodable codes of subexponential length

Sergey Yekhanin

JOURNAL OF THE ACM (2008)