Cryptology ePrint Archive: Report 2017/407

SplitCommit: Implementing and Analyzing Homomorphic UC Commitments

Peter Rindal and Roberto Trifiletti

Abstract: In this paper we present SplitCommit, a portable and efficient C++ implementation of the recent additively homomorphic commmitment scheme of Frederiksen et al. [FJNT16]. We describe numerous optimizations that go into engineering such an implementation, including highly optimized general purpose bit-matrix transposition and efficient ECC encoding given the associated generator matrix. We also survey and analyze in detail the applicability of [FJNT16] and include a detailed comparison to the canonical (non-homomorphic) commitment scheme based on a Random Oracle. We include performance benchmarks of the implementation in various network setting, for instance on a 10 Gbps LAN we achieve amortized commitment and decommitment running times of $0.65\mu s$ and $0.27\mu s$, respectively. Finally we also include an extensive tutorial on how to use the library.

Category / Keywords: implementation / Homomorphic Commitment

Date: received 10 May 2017, last revised 11 May 2017

Contact author: rindalp at oregonstate edu

Available format(s): PDF | BibTeX Citation

Version: 20170513:152956 (All versions of this report)

Short URL: ia.cr/2017/407

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]