✳flâneur — a map of the web's best reading

Functional Commitments for All Functions, with Transparent Setup and from SIS

eprint.iacr.org · 357 words · saved by 1 readers

A *functional commitment* scheme enables a user to concisely commit to a function from a specified family, then later concisely and verifiably reveal values of the function at desired inputs. Useful special cases, which have seen applications across cryptography, include vector commitments and polynomial commitments. To date, functional commitments have been constructed (under falsifiable assumptions) only for functions that are essentially *linear*, with one recent exception that works for arbitrarily complex functions. However, that scheme operates in a strong and non-standard model, requiring an online, trusted authority to generate special keys for any opened function inputs. In this work, we give the first functional commitment scheme for nonlinear functions---indeed, for *all functions* of any bounded complexity---under a standard setup and a falsifiable assumption. Specifically, the setup is ``transparent,'' requiring only public randomness (and not any trusted entity), and th

Functional Commitments for All Functions, with Transparent Setup and from SIS Paper 2022/1368 Functional Commitments for All Functions, with Transparent Setup and from SIS Leo de Castro , Massachusetts Institute of Technology Chris Peikert , University of Michigan–Ann Arbor Abstract A *functional commitment* scheme enables a user to concisely commit to a function from a specified family, then later concisely and verifiably reveal values of the function at desired inputs. Useful special cases, which have seen applications across cryptography, include vector commitments and polynomial commitment

Explore this link on the map →

related reading