Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions

We construct locally decodable codes (LDCs) to correct insertion-deletion errors in the setting where the sender and receiver share a secret key or where the channel is resource-bounded. Our constructions rely on a so-called “Hamming-to-InsDel” compiler (Ostrovsky and Paskin-Cherniavsky, ITS ‘15 & Block et al., FSTTCS '20), which compiles any locally decodable Hamming code into a locally decodable code resilient to insertion-deletion (InsDel) errors. While the compilers were designed for the classical coding setting, we show that the compilers still work in a secret key or resource-bounded setting. Applying our results to the private key Hamming LDC of Ostrovsky, Pandey, and Sahai (ICALP '07), we obtain a private key InsDel LDC with constant rate and polylogarithmic locality. Applying our results to the construction of Blocki, Kulkarni, and Zhou (ITC '20), we obtain similar results for resource-bounded channels; i.e., a channel where computation is constrained by resources such as space or time.

[1]  Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, J. Comput. Syst. Sci..

[2]  Bernhard Haeupler.  Optimal Document Exchange and New Codes for Insertions and Deletions , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[3]  Venkatesan Guruswami,et al.  Efficient Low-Redundancy Codes for Correcting Multiple Deletions , 2015, IEEE Transactions on Information Theory.

[4]  David Zuckerman,et al.  Asymptotically good codes correcting insertions, deletions, and transpositions , 1997, SODA '97.

[5]  Jehoshua Bruck,et al.  Optimal k-Deletion Correcting Codes , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[6]  Shubhangi Saraf,et al.  Locally Decodable Codes , 2016, Encyclopedia of Algorithms.

[7]  Vahid Tarokh,et al.  A survey of error-correcting codes for channels with symbol synchronization errors , 2010, IEEE Communications Surveys & Tutorials.

[8]  Jehoshua Bruck,et al.  Optimal Systematic t-Deletion Correcting Codes , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[9]  Bernhard Haeupler,et al.  Synchronization strings: codes for insertions and deletions approaching the Singleton bound , 2017, STOC.

[10]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[11]  Xin Li,et al.  Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets , 2019, SODA.

[12]  Samson Zhou,et al.  On Locally Decodable Codes in Resource Bounded Channels , 2020, ITC.

[13]  Jeremiah Blocki,et al.  Locally Decodable/Correctable Codes for Insertions and Deletions , 2020, FSTTCS.

[14]  Samson Zhou,et al.  Relaxed Locally Correctable Codes in Computationally Bounded Channels , 2018, IEEE Transactions on Information Theory.

[15]  Michael Mitzenmacher,et al.  A Survey of Results for Deletion Channels and Related Synchronization Channels , 2008, SWAT.

[16]  Xin Li,et al.  Efficient Document Exchange and Error Correcting Codes with Asymmetric Information , 2020, SODA.

[17]  Optimally resilient codes for list-decoding from insertions and deletions , 2019, Electron. Colloquium Comput. Complex..

[18]  Madhu Sudan,et al.  Synchronization Strings: List Decoding for Insertions and Deletions , 2018, ICALP.

[19]  Ronald L. Rivest,et al.  Time-lock Puzzles and Timed-release Crypto , 1996 .

[20]  Venkatesan Guruswami,et al.  Deletion Codes in the High-Noise and High-Rate Regimes , 2014, IEEE Transactions on Information Theory.

[21]  Rafail Ostrovsky,et al.  Private Locally Decodable Codes , 2007, ICALP.

[22]  Sergey Yekhanin,et al.  Towards 3-query locally decodable codes of subexponential length , 2008, JACM.

[23]  Shu Liu,et al.  On List Decoding of Insertion and Deletion Errors , 2019, ArXiv.

[24]  Moni Naor,et al.  Timed Commitments , 2000, CRYPTO.

[25]  Bernhard Haeupler,et al.  Synchronization strings: explicit constructions, local decoding, and applications , 2017, STOC.

[26]  Venkatesan Guruswami,et al.  Coding against deletions in oblivious and online models , 2018, SODA.

[27]  Manoj Prabhakaran,et al.  Resource Fairness and Composability of Cryptographic Protocols , 2006, Journal of Cryptology.

[28]  Nir Bitansky,et al.  Time-Lock Puzzles from Randomized Encodings , 2016, IACR Cryptol. ePrint Arch..

[29]  Zhengzhong Jin,et al.  Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes , 2018, ICALP.

[30]  Adam D. Smith,et al.  Optimal Rate Code Constructions for Computationally Simple Channels , 2010, J. ACM.

[31]  Or Meir,et al.  High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity , 2015, STOC.

[32]  Zhengzhong Jin,et al.  Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[33]  Silvio Micali,et al.  Optimal Error Correction Against Computationally Bounded Noise , 2005, TCC.

[34]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[35]  Zeev Dvir,et al.  Matching Vector Codes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[36]  Klim Efremenko,et al.  3-Query Locally Decodable Codes of Subexponential Length , 2008 .

[37]  Venkatesan Guruswami,et al.  Efficient Linear and Affine Codes for Correcting Insertions/Deletions , 2020, ArXiv.

[38]  Jirí Matousek,et al.  Expected Length of the Longest Common Subsequence for Large Alphabets , 2003, LATIN.

[39]  Shubhangi Saraf,et al.  Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes , 2016, SIGA.

[40]  Jehoshua Bruck,et al.  Optimal Codes for the q-ary Deletion Channel , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[41]  Richard J. Lipton,et al.  A New Approach To Information Theory , 1994, STACS.

[42]  Bernhard Haeupler,et al.  Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing , 2018, STOC.

[43]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[44]  Yu Zheng,et al.  Locally Decodable Codes with Randomized Encoding , 2020, IACR Cryptol. ePrint Arch..

[45]  Ronen Shaltiel,et al.  Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels , 2016, APPROX-RANDOM.

[46]  Anat Paskin-Cherniavsky,et al.  Locally Decodable Codes for Edit Distance , 2015, ICITS.

[47]  Venkatesan Guruswami,et al.  Polynomial Time Decodable Codes for the Binary Deletion Channel , 2019, IEEE Transactions on Information Theory.