Welcome to the resource topic for 2018/297
Title:
Fine-Grained Secure Computation
Authors: Matteo Campanelli, Rosario Gennaro
Abstract:This paper initiates a study of Fine Grained Secure Computation: i.e. the construction of secure computation primitives against “moderately complex” adversaries. We present definitions and constructions for compact Fully Homomorphic Encryption and Verifiable Computation secure against (non-uniform) \mathsf{NC}^1 adversaries. Our results do not require the existence of one-way functions and hold under a widely believed separation assumption, namely \mathsf{NC}^1 \subsetneq \oplus \mathsf{L} / \mathsf{poly}. We also present two application scenarios for our model: (i)hardware chips that prove their own correctness, and (ii) protocols against rational adversaries potentially relevant to the Verifier’s Dilemma in smart-contracts transactions such as Ethereum.
ePrint: https://eprint.iacr.org/2018/297
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 .