Welcome to the resource topic for 2019/1488
Title:
Fine-Grained Cryptography Revisited
Authors: Shohei Egashira, Yuyu Wang, Keisuke Tanaka
Abstract:Fine-grained cryptographic primitives are secure against adversaries with bounded resources and can be computed by honest users with less resources than the adversaries. In this paper, we revisit the results by Degwekar, Vaikuntanathan, and Vasudevan in Crypto 2016 on fine-grained cryptography and show constructions of three key fundamental fine-grained cryptographic primitives: one-way permutations, hash proof systems (which in turn implies a public-key encryption scheme against chosen chiphertext attacks), and trapdoor one-way functions. All of our constructions are computable in \mathsf{NC}^1 and secure against (non-uniform) \mathsf{NC}^1 circuits under the widely believed worst-case assumption \mathsf{NC}^1 \subsetneq \oplus \mathsf{L/poly}.
ePrint: https://eprint.iacr.org/2019/1488
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 .