ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0810.4576
  4. Cited By
New Constructions for Query-Efficient Locally Decodable Codes of
  Subexponential Length
v1v2 (latest)

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

25 October 2008
T. Itoh
Yasuhiro Suzuki
    LRM
ArXiv (abs)PDFHTML

Papers citing "New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length"

5 / 5 papers shown
A Unified Framework for Constructing Information-Theoretic Private Information Retrieval
A Unified Framework for Constructing Information-Theoretic Private Information Retrieval
Liang Feng Zhang
31
0
0
29 Nov 2025
More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIR
More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIRIEEE Symposium on Security and Privacy (IEEE S&P), 2022
Tiantian Gong
Ryan Henry
Alexandros Psomas
Aniket Kate
377
6
0
19 Jan 2022
On the Modulus in Matching Vector Codes
On the Modulus in Matching Vector CodesComputer/law journal (JCL), 2021
Lin Zhu
W. Li
Lingling Zhang
114
2
0
21 Jul 2021
2-Server PIR with sub-polynomial communication
2-Server PIR with sub-polynomial communicationSymposium on the Theory of Computing (STOC), 2014
Zeev Dvir
Sivakanth Gopi
226
95
0
24 Jul 2014
On Bringer-Chabanne EPIR Protocol for Polynomial Evaluation
On Bringer-Chabanne EPIR Protocol for Polynomial EvaluationJournal of Mathematical Cryptology (JMC), 2012
Yeow Meng Chee
Huaxiong Wang
L. Zhang
164
1
0
26 Aug 2012
1
Page 1 of 1