Robust Pseudorandom Generators
暂无分享,去创建一个
Rafail Ostrovsky | Yuval Ishai | Eyal Kushilevitz | Amit Sahai | David Zuckerman | Manoj Prabhakaran | Xin Li | R. Ostrovsky | A. Sahai | E. Kushilevitz | Y. Ishai | M. Prabhakaran | Xin Li | David Zuckerman
[1] Enkatesan G Uruswami. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .
[2] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[3] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[4] Cryptography with constant input locality , 2007, CRYPTO 2007.
[5] Oded Goldreich,et al. The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) , 1985, FOCS.
[6] Donald Beaver,et al. Correlated pseudorandomness and the complexity of private computations , 1996, STOC '96.
[7] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[8] Avi Wigderson,et al. Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..
[9] Noga Alon,et al. Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.
[10] Rafail Ostrovsky,et al. Randomness versus Fault-Tolerance , 2000, Journal of Cryptology.
[11] Amit Sahai,et al. Leakage-Resilient Zero Knowledge , 2011, CRYPTO.
[12] Vinod Vaikuntanathan,et al. Simultaneous Hardcore Bits and Cryptography against Memory Attacks , 2009, TCC.
[13] Anna Gál,et al. Lower bounds on the amount of randomness in private computation , 2003, STOC '03.
[14] Michael Alekhnovich. More on Average Case vs Approximation Complexity , 2011, computational complexity.
[15] Yevgeniy Dodis,et al. Correcting errors without leaking partial information , 2005, STOC '05.
[16] T. Tao,et al. The primes contain arbitrarily long polynomial progressions , 2006, math/0610050.
[17] Nir Bitansky,et al. Leakage-Tolerant Interactive Protocols , 2011, TCC.
[18] Benny Applebaum,et al. A Dichotomy for Local Small-Bias Generators , 2012, TCC.
[19] Eyal Kushilevitz,et al. Randomness in Private Computations , 1997, SIAM J. Discret. Math..
[20] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[21] Eyal Kushilevitz,et al. A Randomnesss-Rounds Tradeoff in Private Computation , 1994, CRYPTO.
[22] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[23] Gilles Brassard,et al. Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..
[24] Youming Qiao,et al. On the security of Goldreich’s one-way function , 2011, computational complexity.
[25] Yuval Ishai,et al. Private Circuits: Securing Hardware against Probing Attacks , 2003, CRYPTO.
[26] Luca Trevisan,et al. On epsilon-Biased Generators in NC0 , 2003, Electron. Colloquium Comput. Complex..
[27] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[28] Michael Alekhnovich,et al. Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas , 2004, SODA '04.
[29] Yuval Ishai,et al. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..
[30] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[31] Guy N. Rothblum,et al. How to Compute in the Presence of Leakage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[32] Ronald L. Rivest,et al. All-or-Nothing Encryption and the Package Transform , 1997, FSE.
[33] Miklós Ajtai,et al. Secure computation with information leaking to an adversary , 2011, STOC '11.
[34] Kousha Etessami,et al. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.
[35] Matthew K. Franklin,et al. Efficiency Tradeoffs for Malicious Two-Party Computation , 2006, Public Key Cryptography.
[36] Eyal Kushilevitz,et al. Exposure-Resilient Functions and All-or-Nothing Transforms , 2000, EUROCRYPT.
[37] References , 1971 .
[38] Omer Reingold,et al. Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .
[39] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[40] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[41] Andreas Jakoby,et al. Private Computation: k-Connected versus 1-Connected Networks , 2005, Journal of Cryptology.
[42] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.
[43] Moni Naor,et al. Public-Key Cryptosystems Resilient to Key Leakage , 2009, SIAM J. Comput..
[44] Benny Applebaum,et al. Pseudorandom generators with long stretch and low locality from random local one-way functions , 2012, STOC '12.
[45] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[46] Rafail Ostrovsky,et al. Characterizing linear size circuits in terms of privacy , 1996, STOC '96.
[47] Madhur Tulsiani,et al. Dense Subsets of Pseudorandom Sets , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[48] Shai Halevi,et al. After-the-Fact Leakage in Public-Key Encryption , 2011, IACR Cryptol. ePrint Arch..
[49] Stefan Dziembowski,et al. Leakage-Resilient Cryptography , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[50] Rafail Ostrovsky,et al. Efficient Non-interactive Secure Computation , 2011, EUROCRYPT.
[51] Yuval Ishai,et al. On Pseudorandom Generators with Linear Stretch in NC0 , 2006, computational complexity.