Welcome to the resource topic for 2019/279
Title:
A Note on Key Agreement and Non-Interactive Commitments
Authors: Alex Lombardi, Luke Schaeffer
Abstract:We observe that any key agreement protocol satisfying perfect completeness, regardless of its round complexity, can be used to construct a non-interactive commitment scheme. This observation simplifies the cryptographic assumptions required for some protocols that utilize non-interactive commitments and removes the need for ad-hoc constructions of non-interactive commitments from specific assumptions such as Learning with Errors.
ePrint: https://eprint.iacr.org/2019/279
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 .