More interestingly, we then modify it and present a more efficient commitment scheme secure in the UC framework, with the same level of security as Lindell's protocol: adaptive corruptions, with erasures. The security is proven in the standard model (with a Common Reference String) under the classical Decisional Diffie-Hellman assumption. Our proposal is the most efficient UC-secure commitment proposed to date (in terms of computational workload and communication complexity).
Category / Keywords: cryptographic protocols / UC Commitment Date: received 28 Feb 2013 Contact author: olivier blazy at rub de Available format(s): PDF | BibTeX Citation Version: 20190217:224314 (All versions of this report) Short URL: ia.cr/2013/123