Abstract. Homomorphic universally composable (UC) commitments allow for the sender to reveal the result of additions and multiplications of values contained ...

Nov 22, 2019 · In this work, we construct essentially optimal additively homomorphic UC commitments from any (not necessarily UC or homomorphic) extractable ...

Abstract. Homomorphic universally composable (UC) commitments allow for the sender to reveal the result of additions and multiplica-.

In the CRS-model, UC commitments imply secure key exchange, and so were believed for a long time to be much less efficient than weaker commitments.

In this work, we construct essentially optimal additively homomorphic UC commitments from any (not necessarily UC or homomorphic) extractable commitment, while ...

Dive into the research topics of 'Efficient UC Commitment Extension with Homomorphism for Free (and Applications)'. Together they form a unique fingerprint.

Conference paper. Efficient UC commitment extension with homomorphism for free (and applications). Homomorphic universally composable (UC) commitments ...

(2019) Efficient UC Commitment Extension with Homomorphism for Free (and Applications). ... (2016) Rate-1, Linear Time and Additively Homomorphic UC Commitments.

Motivated by applications to secure multiparty computation, we study the complexity of realizing universally composable (UC) commitments.