# One-Way Functions and (Im)perfect Obfuscation

## Abstract.

### Keywords

### MSC codes

## Get full access to this article

View all available purchase options and get full access to this article.

## References

*Advances in Cryptology - EUROCRYPT*, Lect. Notes Comput. Sci. 11476, Springer, Cham, 2019, pp. 191–225.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 9215, Springer, Berlin, Heidelberg, 2015, pp. 308–326.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 11694, Springer, Cham, 2019, pp. 284–332.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 9815, Springer, Berlin, Heidelberg, 2016, pp. 491–520.

*IACR Cryptol. ePrint Arch.*, 2018 (2018), 615, https://eprint.iacr.org/2018/615.

*Advances in Cryptology - EUROCRYPT*, Lect. Notes Comput. Sci. 10210, Springer, Cham, 2017, pp. 152–181.

*SIAM J. Comput.*, 45 (2016), pp. 2117–2176, https://doi.org/10.1137/15M1034064.

*J. Cryptol.*, 31 (2018), pp. 698–736.

*Advances in Cryptology - EUROCRYPT*, Lect. Notes Comput. Sci. 9666, Springer, Berlin, Heidelberg, 2016, pp. 764–791.

*Advances in Cryptology - EUROCRYPT*, Lect. Notes Comput. Sci. 10821, Springer, Cham, 2018, pp. 649–679.

*Advances in Cryptology - EUROCRYPT*, Lect. Notes Comput. Sci. 8441, Springer, Berlin, Heidelberg, 2014, pp. 221–238.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 2139, Springer, Berlin, Heidelberg, 2001, pp. 1–18.

*J. ACM*, 59 (2012), 6 (preliminary version of [13]).

*Advances in Cryptology - EUROCRYPT*, Lect. Notes Comput. Sci. 11476, Springer, Cham, 2019, pp. 226–250.

*SIAM J. Comput.*, 50 (2021), pp. 98–144, https://doi.org/10.1137/17M1136559.

*J. Cryptol.*, 33 (2020), pp. 357–405.

*J. ACM*, 65 (2018), 39.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 8616, Springer, Berlin, Heidelberg, 2014, pp. 480–499.

*TCC*, Lect. Notes Comput. Sci. 8349, Springer, 2014, pp. 52–73.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 9815, Springer, Berlin, Heidelberg, 2016, pp. 551–578.

*Advances in Cryptology - EUROCRYPT 2020*, Lect. Notes Comput. Sci. 12105, Springer, Cham, 2020, pp. 79–109.

*J. Cryptol.*, 31 (2018), pp. 434–520.

*TCC*, Lect. Notes Comput. Sci. 8349, Springer, Berlin, Heidelberg, 2014, pp. 1–25.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 9215, Springer, Berlin, Heidelberg, 2015, pp. 247–266.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 9815, Springer, Berlin, Heidelberg, 2016, pp. 607–628.

*Public-Key Cryptography - PKC*, Lect. Notes Comput. Sci. 10174, Springer, Berlin, Heidelberg, 2017, pp. 41–58.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 8042, Springer, Berlin, Heidelberg, 2013, pp. 476–493.

*IACR Cryptol. ePrint Arch.*, 2014 (2014), 975.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 9215, Springer, Berlin, Heidelberg, 2015, pp. 267–286.

*Advances in Cryptology - ASIACRYPT*, Lect. Notes Comput. Sci. 11922, Springer, Cham, 2019, pp. 356–385.

*TCC*, Lect. Notes Comput. Sci. 8349, Springer, 2014, pp. 74–94.

*SIAM J. Comput.*, 45 (2016), pp. 882–929, https://doi.org/10.1137/14095772X.

*Advances in Cryptology - EUROCRYPT 2017*, Lect. Notes Comput. Sci. 10212, Springer, Cham, 2017, pp. 156–181.

*IACR Cryptol. ePrint Arch.*, 2020 (2020), 764.

*IACR Cryptol. ePrint Arch.*, 2020 (2020), 1010.

*IACR Cryptol. ePrint Arch.*, 2018 (2018), 756.

*Inform. Process. Lett.*, 34 (1990), pp. 277–281.

*The Foundations of Cryptography - Volume 1, Basic Techniques*, Cambridge University Press, Cambridge, 2001.

*Computational Complexity - A Conceptual Perspective*, Cambridge University Press, Cambridge, 2008.

*J. Cryptol.*, 27 (2014), pp. 480–505.

*SIAM J. Comput.*, 28 (1999), pp. 1364–1396, https://doi.org/10.1137/S0097539793244708.

*Advances in Cryptology - EUROCRYPT*, Lect. Notes Comput. Sci. 10822, Springer, Cham, 2018, pp. 66–87.

*Pseudo-random Generators for Cryptography and for Randomized Algorithms*, Ph.D. thesis, University of California, Berkeley, Berkeley, CA, 1992, http://cseweb.ucsd.edu/users/russell/format.ps.

*IACR Cryptol. ePrint Arch.*, 2020 (2020), 1003.

*Advances in Cryptology - EUROCRYPT*, Lect. Notes Comput. Sci. 10821, Springer, Cham, 2018, pp. 603–648.

*J. Cryptol.*, 30 (2017), pp. 444–469.

*J. Cryptol.*, 33 (2020), pp. 406–458.

*Advances in Cryptology - EUROCRYPT*, Lect. Notes Comput. Sci. 9665, Springer, Berlin, Heidelberg, pp. 28–57.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 10401, Springer, Cham, 2017, pp. 599–629 .

*IACR Cryptol. ePrint Arch.*, 2018 (2018), 646.

*Public-Key Cryptography - PKC*, Lect. Notes Comput. Sci. 9615, Springer, Berlin, Heidelberg, 2016, pp. 447–462.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput, Sci, 10401, Springer, Cham, 2017, pp. 630–660.

*Advances in Cryptology - CRYPTO*, Lect. Notes Comput. Sci. 9815, Springer, Berlin, Heidelberg, 2016, pp. 629–658.

*IACR Cryptology ePrint Archive*, 2013 (2013), 643.

*Advances in Cryptology - EUROCRYPT 2007*, Lect. Notes Comput. Sci. 4515, Springer, Berlin, Heidelberg, 2007, pp. 187–209.

*Theory of Cryptography, TCC*, Lect. Notes Comput. Sci. 9015, Springer, Berlin, Heidelberg, 2015, pp. 638–667.

*CRYPTO*, Lect. Notes Comput. Sci. 8616, Springer, 2014, pp. 500–517.

*SIAM J. Comput.*, 14 (1985), pp. 849–861, https://doi.org/10.1137/0214060.

*IACR Cryptol. ePrint Arch.*, 2020 (2020), 1042.

## Information & Authors

### Information

#### Published In

#### Copyright

#### History

**Submitted**: 16 November 2015

**Accepted**: 2 August 2022

**Published online**: 20 December 2022

#### Keywords

#### MSC codes

### Authors

#### Funding Information

**Funding:**The first author is the incumbent of the Harry & Abe Sherman Senior Lectureship at the School of Computer Science and Engineering at the Hebrew University, supported in part by an Alon Young Faculty Fellowship, by a grant from the Israel Science Foundation (ISF grant 1774/20), and by a grant from the U.S.-Israel Binational Science Foundation and the U.S. National Science Foundation (BSF-NSF grant 2020643). Most of this work was done while the first author was at the Weizmann Institute. The second author is supported by ISF grant 1790/13 and by the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement 293843. The third author is supported in part by a grant from the I-CORE Program of the Planning and Budgeting Committee, the Israel Science Foundation, BSF, IMOS, and the Citi Foundation. The third author is the incumbent of the Judith Kleeman Professorial Chair. The fourth author is supported in part by an Alfred P. Sloan Fellowship, Microsoft New Faculty Fellowship, NSF Award CNS- 1217821, NSF CAREER Award CCF-0746990, NSF Award CCF-1214844, AFOSR YIP Award FA9550-10-1-0093, and DARPA and AFRL under contract FA8750-11-2-0211. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the U.S. Government. The fifth author was originally supported by ISF grant 1255/12 and by the ERC under the EU’s Seventh Framework Programme (FP/2007-2013) ERC grant agreement 307952. Currently, the fifth author is supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement 101019547), by ISF grant 1399/17, and by project PROMETHEUS (grant 780701). The sixth author is supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office, and by the Alter Family Foundation. Most of this work was done while the sixth author was at the Weizmann Institute.

## Metrics & Citations

### Metrics

### Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

#### Cited By

There are no citations for this item

## View Options

### Get Access

**Access via your Institution**- Questions about how to access this content? Contact SIAM at
**[email protected]**.