Cryptography in NC0
暂无分享,去创建一个
[1] Yuval Ishai,et al. Randomizing polynomials: A new representation with applications to round-efficient secure computation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[2] Petr Savický. On the Bent Boolean Functions That are Symmetric , 1994, Eur. J. Comb..
[3] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[4] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[5] Emanuele Viola. On Parallel Pseudorandom Generators , 2004, Electron. Colloquium Comput. Complex..
[6] Andrew V. Goldberg,et al. Lower bounds for pseudorandom number generators , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] Elchanan Mossel,et al. On /spl epsiv/-biased generators in NC/sup 0/ , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[8] Oded Goldreich,et al. Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.
[9] Johan Håstad. One-Way Permutations in NC0 , 1987, Inf. Process. Lett..
[10] Emanuele Viola,et al. The complexity of constructing pseudorandom generators from hard functions , 2005, computational complexity.
[11] M. Rabin. DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .
[12] Omer Reingold,et al. On the Power of the Randomized Iterate , 2006, SIAM J. Comput..
[13] Oded Goldreich,et al. Collision-Free Hashing from Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[14] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.
[15] Noam Nisan,et al. Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.
[16] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[17] Manuel Blum,et al. An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information , 1985, CRYPTO.
[18] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[19] Luca Trevisan,et al. On e-Biased Generators in NC0 , 2003, FOCS.
[20] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[21] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[22] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[23] Cynthia Dwork,et al. A public-key cryptosystem with worst-case/average-case equivalence , 1997, STOC '97.
[24] Peter Bro Miltersen,et al. On Pseudorandom Generators in NC , 2001, MFCS.
[25] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1993, JACM.
[26] Michael Kharitonov,et al. Cryptographic hardness of distribution-specific learning , 1993, STOC.
[27] Joan Feigenbaum,et al. Locally Random Reductions in Interactive Complexity Theory , 1990, Advances In Computational Complexity Theory.
[28] Miklós Ajtai,et al. Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[29] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[30] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..
[31] Oded Goldreich,et al. Candidate One-Way Functions Based on Expander Graphs , 2000, Studies in Complexity and Cryptography.
[32] Peter Bro Miltersen,et al. On pseudorandom generators in NC 0 ⋆ , 2001 .
[33] Ivan Damgård,et al. Collision Free Hash Functions and Public Key Signature Schemes , 1987, EUROCRYPT.
[34] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[35] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[36] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[37] Yuval Ishai,et al. COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[38] Noam Nisan,et al. Pseudorandom generators for space-bounded computations , 1990, STOC '90.
[39] Moni Naor,et al. Efficient cryptographic schemes provably as secure as subset sum , 1989, 30th Annual Symposium on Foundations of Computer Science.
[40] 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).
[41] Manuel Blum,et al. Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.
[42] Yuval Ishai,et al. Efficient Multi-party Computation over Rings , 2003, EUROCRYPT.
[43] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[44] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[45] Emanuele Viola,et al. On constructing parallel pseudorandom generators from one-way functions , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[46] Amir Shpilka,et al. On ε-Biased Generators in NC , 2003 .
[47] Silvio Micali,et al. Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing , 1996, CRYPTO.
[48] Avi Wigderson. NL/poly /spl sube/ /spl oplus/L/poly , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[49] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[50] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[51] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[52] Moti Yung,et al. Space lower-bounds for pseudorandom-generators , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[53] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[54] Eric Allender,et al. Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem , 1998, J. Comput. Syst. Sci..
[55] Stefan Lucks,et al. On the Minimal Hardware Complexity of Pseudorandom Function Generators , 2001, STACS.
[56] Leonid Reyzin,et al. Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? , 2004, CRYPTO.
[57] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[58] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[59] Moni Naor,et al. Number-theoretic constructions of efficient pseudo-random functions , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[60] Ivan Damgård,et al. On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures , 1993, CRYPTO.
[61] Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.
[62] David A. Mix Barrington,et al. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.
[63] Elchanan Mossel,et al. On ε‐biased generators in NC0 , 2006, Random Struct. Algorithms.
[64] Richard J. Lipton,et al. Cryptographic Primitives Based on Hard Learning Problems , 1993, CRYPTO.
[65] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[66] Hugo Krawczyk,et al. On the Existence of Pseudorandom Generators , 1993, SIAM J. Comput..
[67] Yuval Ishai,et al. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials , 2002, ICALP.