Valiant's Universal Circuit: Improvements, Implementation, and Applications
暂无分享,去创建一个
Payman Mohassel | Helger Lipmaa | Seyed Saeed Sadeghian | Payman Mohassel | H. Lipmaa | S. Sadeghian
[1] Abraham Waksman,et al. A Permutation Network , 1968, JACM.
[2] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[3] Vladimir Kolesnikov,et al. A Practical Universal Circuit Construction and Secure Evaluation of Private Functions , 2008, Financial Cryptography.
[4] Nigel P. Smart,et al. Actively Secure Private Function Evaluation , 2014, ASIACRYPT.
[5] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .
[6] Ran Raz. Elusive functions and lower bounds for arithmetic circuits , 2008, STOC '08.
[7] Joe Zimmerman,et al. How to Obfuscate Programs Directly , 2015, EUROCRYPT.
[8] Vladimir Kolesnikov,et al. FleXOR: Flexible garbling for XOR gates that beats free-XOR , 2014, IACR Cryptol. ePrint Arch..
[9] Leslie G. Valiant,et al. Universal circuits (Preliminary Report) , 1976, STOC '76.
[10] Payman Mohassel,et al. How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation , 2013, IACR Cryptol. ePrint Arch..
[11] Jonathan Katz,et al. Constant-Round Private Function Evaluation with Linear Complexity , 2011, ASIACRYPT.
[12] Benny Pinkas,et al. Non-Interactive Secure Computation Based on Cut-and-Choose , 2014, IACR Cryptol. ePrint Arch..
[13] Ben Riva,et al. Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation , 2013, IACR Cryptol. ePrint Arch..
[14] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[15] Brent Waters,et al. Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[16] Yehuda Lindell,et al. Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries , 2015, IACR Cryptol. ePrint Arch..
[17] Alex J. Malozemoff,et al. Amortizing Garbled Circuits , 2015, IACR Cryptol. ePrint Arch..
[18] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.