{"id":624786,"date":"2019-12-01T23:49:53","date_gmt":"2019-12-02T07:49:53","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-research-item&p=624786"},"modified":"2019-12-02T00:08:17","modified_gmt":"2019-12-02T08:08:17","slug":"explicit-rate-1-non-malleable-codes-for-local-tampering","status":"publish","type":"msr-research-item","link":"https:\/\/www.microsoft.com\/en-us\/research\/publication\/explicit-rate-1-non-malleable-codes-for-local-tampering\/","title":{"rendered":"Explicit Rate-1 Non-malleable Codes for Local Tampering"},"content":{"rendered":"
This paper constructs high-rate non-malleable codes in the information-theoretic plain model against tampering functions with bounded locality. We consider\u00a0