Cryptology ePrint Archive: Report 2021/1177

Algebraic Restriction Codes and their Applications

Divesh Aggarwal and Nico Döttling and Jesko Dujmovic and Mohammad Hajiabadi and Giulio Malavolta and Maciej Obremski

Abstract: Consider the following problem: You have a device that is supposed to compute a linear combination of its inputs, which are taken from some finite field. However, the device may be faulty and compute arbitrary functions of its inputs. Is it possible to encode the inputs in such a way that only linear functions can be evaluated over the encodings? I.e., learning an arbitrary function of the encodings will not reveal more information about the inputs than a linear combination.

In this work, we introduce the notion of algebraic restriction codes (AR codes), which constrain adversaries who might compute any function to computing a linear function. Our main result is an information-theoretic construction AR codes that restrict any class of function with a bounded number of output bits to linear functions. Our construction relies on a seed which is not provided to the adversary.

While interesting and natural on its own, we show an application of this notion in cryptography. In particular, we show that AR codes lead to the first construction of rate-1 oblivious transfer with statistical sender security from the Decisional Diffie-Hellman assumption, and the first-ever construction that makes black-box use of cryptography. Previously, such protocols were known only from the LWE assumption, using non-black-box cryptographic techniques. We expect our new notion of AR codes to find further applications, e.g., in the context of non-malleability, in the future.

Category / Keywords: public-key cryptography / information theory, public-key cryptography

Date: received 14 Sep 2021

Contact author: nico doettling at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20210914:180206 (All versions of this report)

Short URL: ia.cr/2021/1177


[ Cryptology ePrint archive ]