Cryptology ePrint Archive: Report 2019/279

A Note on Key Agreement and Non-Interactive Commitments

Alex Lombardi and 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.

Category / Keywords: foundations / Non-interactive commitments, key agreement

Date: received 12 Mar 2019, last revised 12 Mar 2019

Contact author: alexjl at mit edu

Available format(s): PDF | BibTeX Citation

Version: 20190312:120501 (All versions of this report)

Short URL: ia.cr/2019/279


[ Cryptology ePrint archive ]