5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic Circuits
暂无分享,去创建一个
Alex J. Malozemoff | Mariana Raykova | Brent Carmer | Mariana Raykova | A. Malozemoff | Brent Carmer
[1] Abhi Shelat,et al. Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings , 2016, TCC.
[2] Pravesh Kothari,et al. Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation) , 2018, Electron. Colloquium Comput. Complex..
[3] Ahmad-Reza Sadeghi,et al. TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits , 2015, 2015 IEEE Symposium on Security and Privacy.
[4] Johann Glaser,et al. Yosys-A Free Verilog Synthesis Suite , 2013 .
[5] Craig Gentry,et al. Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations , 2015, CRYPTO.
[6] Joe Zimmerman,et al. How to Obfuscate Programs Directly , 2015, EUROCRYPT.
[7] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[8] Vinod Vaikuntanathan,et al. Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[9] Amit Sahai,et al. Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps , 2017, EUROCRYPT.
[10] Patrick Traynor,et al. Frigate: A Validated, Extensible, and Efficient Compiler and Interpreter for Secure Computation , 2016, 2016 IEEE European Symposium on Security and Privacy (EuroS&P).
[11] Jean-Sébastien Coron,et al. Practical Multilinear Maps over the Integers , 2013, CRYPTO.
[12] Shai Halevi,et al. Implementing BP-Obfuscation Using Graph-Induced Encoding , 2017, CCS.
[13] Nir Bitansky,et al. Indistinguishability Obfuscation from Functional Encryption , 2018, J. ACM.
[14] Amit Sahai,et al. Multi-Input Functional Encryption , 2014, IACR Cryptol. ePrint Arch..
[15] J. R. Lewis,et al. Cryptol: high assurance, retargetable crypto development and validation , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..
[16] Jean-Sébastien Coron,et al. Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 , 2017, Public Key Cryptography.
[17] Craig Gentry,et al. Candidate Multilinear Maps from Ideal Lattices , 2013, EUROCRYPT.
[18] Alex J. Malozemoff,et al. Faster Secure Two-Party Computation in the Single-Execution Setting , 2017, EUROCRYPT.
[19] Huijia Lin,et al. Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes , 2016, EUROCRYPT.
[20] Mark Zhandry,et al. Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation , 2015, EUROCRYPT.
[21] Stefan Katzenbeisser,et al. Compiling Low Depth Circuits for Practical Secure Computation , 2016, ESORICS.
[22] Paul C. van Oorschot,et al. White-Box Cryptography and an AES Implementation , 2002, Selected Areas in Cryptography.
[23] Dan Boneh,et al. Applications of Multilinear Forms to Cryptography , 2002, IACR Cryptol. ePrint Arch..
[24] Benny Applebaum,et al. Bootstrapping Obfuscators via Fast Pseudorandom Functions , 2014, ASIACRYPT.
[25] Huijia Lin,et al. Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs , 2017, CRYPTO.
[26] Brian Huffman,et al. SAW: the software analysis workbench , 2013 .
[27] Brent Waters,et al. Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[28] Alex J. Malozemoff,et al. 5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs , 2016, CCS.
[29] Martin R. Albrecht,et al. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity , 2016, ASIACRYPT.
[30] Yael Tauman Kalai,et al. Protecting Obfuscation against Algebraic Attacks , 2014, EUROCRYPT.
[31] Brian Huffman,et al. SAW: the software analysis workbench , 2013, HILT.
[32] David Witmer,et al. Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[33] Amit Sahai,et al. On the (im)possibility of obfuscating programs , 2001, JACM.
[34] Angelo De Caro,et al. Better Security for Functional Encryption for Inner Product Evaluations , 2016, IACR Cryptol. ePrint Arch..
[35] Abhishek Jain,et al. Indistinguishability Obfuscation from Compact Functional Encryption , 2015, CRYPTO.
[36] Zvika Brakerski,et al. Obfuscating Circuits via Composite-Order Graded Encoding , 2015, TCC.
[37] Eric Miles,et al. Secure Obfuscation in a Weak Multilinear Map Model , 2016, TCC.
[38] Oded Goldreich,et al. Candidate One-Way Functions Based on Expander Graphs , 2011, Studies in Complexity and Cryptography.
[39] Helmut Veith,et al. Secure two-party computations in ANSI C , 2012, CCS.
[40] Rafael Pass,et al. Output-Compressing Randomized Encodings and Applications , 2016, TCC.
[41] Stefano Tessaro,et al. Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs , 2017, CRYPTO.
[42] Benny Applebaum,et al. Fast Pseudorandom Functions Based on Expander Graphs , 2016, TCC.
[43] Robert K. Brayton,et al. ABC: An Academic Industrial-Strength Verification Tool , 2010, CAV.
[44] Shachar Lovett,et al. Algebraic Attacks against Random Local Functions and Their Countermeasures , 2015, SIAM J. Comput..