Bounds on the Efficiency of "Black-Box" Commitment Schemes
暂无分享,去创建一个
[1] 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).
[2] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[3] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[4] Silvio Micali,et al. On the Cryptographic Applications of Random Functions , 1984, CRYPTO.
[5] Daniel R. Simon,et al. Limits on the efficiency of one-way permutation-based hash functions , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[6] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[7] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[8] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[9] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[10] Luca Trevisan,et al. Notions of Reducibility between Cryptographic Primitives , 2004, TCC.
[11] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[12] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[13] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[14] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[15] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[16] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[17] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[18] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.