Welcome to the resource topic for 2021/146
Title:
Securely Computing Piecewise Constant Codes
Authors: Benjamin E. Diamond
Abstract:Piecewise constant codes form an expressive and well-understood class of codes. In this work, we show that many piecewise constant codes admit exact coverings by polynomial-cardinality collections of hyperplanes. We prove that any boolean function whose “on-set” has been covered in just this manner can be evaluated by two parties with malicious security. This represents an interesting connection between covering codes, affine-linear algebra over prime fields, and secure computation. We observe that many natural boolean functions’ on-sets admit expressions as piecewise constant codes (and hence can be computed securely). Our protocol supports secure computation on committed inputs; we describe applications in blockchains and credentials. We finally present an efficient implementation of our protocol.
ePrint: https://eprint.iacr.org/2021/146
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .