In 2011, researcher proposed an efficient commitment scheme, with a non-interactive opening algorithm, in the Universal Composability (UC) framework. The researcher recently acknowledged a bug in its security analysis for the adaptive case. The authors analyze the proof of the original paper and propose a simple patch of the scheme. More interestingly, they 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.