Welcome to the resource topic for 2022/290
Title:
Universally Composable Sigma-protocols in the Global Random-Oracle Model
Authors: Anna Lysyanskaya and Leah Namisa Rosenbloom
Abstract:Numerous cryptographic applications require efficient non-interactive zero-knowledge proofs of knowledge (NIZKPoK) as a building block. Typically they rely on the Fiat-Shamir heuristic to do so, as security in the random-oracle model is considered good enough in practice. However, there is a troubling disconnect between the stand-alone security of such a protocol and its security as part of a larger, more complex system where several protocols may be running at the same time. Provable security in the general universal composition (GUC) model of Canetti et al. is the best guarantee that nothing will go wrong when a system is part of a larger whole, even when all parties share a common random oracle. In this paper, we prove the minimal necessary properties of generally universally composable (GUC-secure) NIZKPoK in any global random-oracle model, and show how to achieve efficient and GUC-secure NIZKPoK in both the restricted programmable and restricted observable (non-programmable) global random-oracle models.
ePrint: https://eprint.iacr.org/2022/290
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 .