On the Exact Cryptographic Hardness of Finding a Nash Equilibrium
暂无分享,去创建一个
Sanjam Garg | Akshayaram Srinivasan | Omkant Pandey | Sanjam Garg | Omkant Pandey | Akshayaram Srinivasan
[1] Rafael Pass,et al. Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings , 2014, CRYPTO.
[2] Craig Gentry,et al. Candidate Multilinear Maps from Ideal Lattices , 2013, EUROCRYPT.
[3] Paul W. Goldberg,et al. The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..
[4] Zvika Brakerski,et al. Obfuscating Circuits via Composite-Order Graded Encoding , 2015, TCC.
[5] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[6] Aggelos Kiayias,et al. Delegatable pseudorandom functions and applications , 2013, IACR Cryptol. ePrint Arch..
[7] Joe Zimmerman,et al. How to Obfuscate Programs Directly , 2015, EUROCRYPT.
[8] Yael Tauman Kalai,et al. Protecting Obfuscation against Algebraic Attacks , 2014, EUROCRYPT.
[9] Guy N. Rothblum,et al. Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding , 2014, TCC.
[10] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[11] Amit Sahai,et al. Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption , 2015, IACR Cryptol. ePrint Arch..
[12] Emil Jerábek. Integer factoring and modular square roots , 2016, J. Comput. Syst. Sci..
[13] Brent Waters,et al. A Punctured Programming Approach to Adaptively Secure Functional Encryption , 2015, CRYPTO.
[14] Yael Tauman Kalai,et al. Reusable garbled circuits and succinct functional encryption , 2013, STOC '13.
[15] Nir Bitansky,et al. Indistinguishability Obfuscation from Functional Encryption , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[16] Brent Waters,et al. How to use indistinguishability obfuscation: deniable encryption, and more , 2014, IACR Cryptol. ePrint Arch..
[17] Nir Bitansky,et al. On the Cryptographic Hardness of Finding a Nash Equilibrium , 2015, FOCS.
[18] Allison Bishop,et al. Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[19] Amit Sahai,et al. On the (im)possibility of obfuscating programs , 2001, JACM.
[20] Shafi Goldwasser,et al. Functional Signatures and Pseudorandom Functions , 2014, Public Key Cryptography.
[21] Brent Waters,et al. Constrained Pseudorandom Functions and Their Applications , 2013, ASIACRYPT.
[22] Abhishek Jain,et al. Indistinguishability Obfuscation from Compact Functional Encryption , 2015, CRYPTO.
[23] Adam O'Neill,et al. Definitional Issues in Functional Encryption , 2010, IACR Cryptol. ePrint Arch..
[24] Vinod Vaikuntanathan,et al. Functional Encryption with Bounded Collusions via Multi-party Computation , 2012, CRYPTO.
[25] Christos H. Papadimitriou,et al. On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..
[26] Yael Tauman Kalai,et al. The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator , 2014, CRYPTO.
[27] Yael Tauman Kalai,et al. On the impossibility of obfuscation with auxiliary input , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[28] J. Nash,et al. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[29] Timothy G. Abbott,et al. On Algorithms for Nash Equilibria , 2004 .
[30] Xiaotie Deng,et al. Settling the complexity of computing two-player Nash equilibria , 2007, JACM.
[31] Christos H. Papadimitriou,et al. On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..
[32] Brent Waters,et al. Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[33] Brent Waters,et al. Functional Encryption: Definitions and Challenges , 2011, TCC.