Paper 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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Non-interactive commitmentskey agreement
Contact author(s)
alexjl @ mit edu
History
2019-03-12: received
Short URL
https://ia.cr/2019/279
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/279,
      author = {Alex Lombardi and Luke Schaeffer},
      title = {A Note on Key Agreement and Non-Interactive Commitments},
      howpublished = {Cryptology ePrint Archive, Paper 2019/279},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/279}},
      url = {https://eprint.iacr.org/2019/279}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.