Concurrent non-malleable statistically hiding commitment

We present a modular construction of non-malleable statistically hiding commitment schemes that retains its properties when concurrently executed a polynomial number of times. Our protocol is based on a statistically hiding commitment scheme and a concurrent non-malleable zero-knowledge protocol for all of NPNP. Our result is achieved in the plain model without relying on any set-up assumptions. The proof of security only uses black-box techniques.

► Modular construction of concurrent non-malleable statistically hiding commitment is presented.
► We achieve this result in the plain model without relying on any set-up assumptions.
► We prove its security using only black-box techniques.