Round-optimal black-box statistically binding selective-opening secure commitments

Abstract

Assuming t-round statistically hiding commitments in the stand-alone model, we build a (t + 2)-round statistically binding commitment secure against selective opening attacks under parallel composition. In particular, assuming collision-resistant hash functions, we build such commitments in 4 rounds. © 2012 Springer-Verlag.