Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

The authors present a constant-round unconditional black-box compiler that transforms any ideal (i.e., statistically-hiding and statistically-binding) straight-line extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yielding to UC-security. They exemplify the usefulness of their compiler by providing two (constant-round) instantiations of ideal straight-line extractable commitment based on (malicious) PUFs and stateless tamper-proof hardware tokens, therefore achieving the first unconditionally UC-secure commitment with malicious PUFs and stateless tokens, respectively. Their constructions are secure for adversaries creating arbitrarily malicious stateful PUFs/tokens.

Provided by: Aarhus University Topic: Security Date Added: May 2013 Format: PDF

Find By Topic