[Resource Topic] 2018/555: Limits on the Power of Garbling Techniques for Public-Key Encryption

Welcome to the resource topic for 2018/555

Limits on the Power of Garbling Techniques for Public-Key Encryption

Authors: Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ameer Mohammed


Understanding whether public-key encryption can be based on one-way functions is a fundamental open problem in cryptography. The seminal work of Impagliazzo and Rudich [STOC’89] shows that black-box constructions of public-key encryption from one-way functions are impossible. However, this impossibility result leaves open the possibility of using non-black-box techniques for achieving this goal. One of the most powerful classes of non-black-box techniques, which can be based on one-way functions (OWFs) alone, is Yao’s garbled circuit technique [FOCS’86]. As for the non-black-box power of this technique, the recent work of Dottling and Garg [CRYPTO’17] shows that the use of garbling allows us to circumvent known black-box barriers in the context of identity-based encryption. We prove that garbling of circuits that have OWF (or even random oracle) gates in them are insufficient for obtaining public-key encryption. Additionally, we show that this model also captures (non-interactive) zero-knowledge proofs for relations with OWF gates. This indicates that currently known OWF-based non-black-box techniques are perhaps insufficient for realizing public-key encryption.

ePrint: https://eprint.iacr.org/2018/555

Talk: https://www.youtube.com/watch?v=-G7rnGa_5xI

Slides: https://crypto.iacr.org/2018/slides/28791.pdf

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 .