[Resource Topic] 2022/1127: GUC-Secure Commitments via Random Oracles: New Impossibility and Feasibility

Welcome to the resource topic for 2022/1127

GUC-Secure Commitments via Random Oracles: New Impossibility and Feasibility

Authors: Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, Kui Ren


In the UC framework, a protocol must be subroutine respecting; therefore, shared trusted setup might cause security issues. To address this drawback, Generalized UC (GUC) framework is introduced by Canetti et al. (TCC 2007).
In this work, we investigate the impossibility and feasibility of GUC-secure commitments with global random oracles (GRO) as trusted setup. In particular, we show it is impossible to have a 2-round (1 round for the committing phase and 1 round for the opening phase) GUC-secure commitment in the global observable RO model by Canetti et al. (CCS 2014). We then give a new round-optimal GUC-secure commitment that uses only MiniCrypt assumptions (i.e. the existence of one-way functions) in the global observable RO model. In addition, we also examine the complete picture on round complexity of the GUC-secure commitments in various global RO models.

ePrint: https://eprint.iacr.org/2022/1127

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .