Degradation and Amplification of Computational Hardness
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[2] Russell Impagliazzo,et al. Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[3] Thomas Holenstein,et al. One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption , 2005, CRYPTO.
[4] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[5] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6] Jürg Wullschleger. Oblivious-transfer amplification , 2007, Ausgezeichnete Informatikdissertationen.
[7] Leonid A. Levin,et al. One-way functions and pseudorandom generators , 1985, STOC '85.
[8] Noam Nisan,et al. On Yao's XOR-Lemma , 1995, Electron. Colloquium Comput. Complex..
[9] Ivan Damgård,et al. On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions , 1998, EUROCRYPT.
[10] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[11] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[12] Thomas Holenstein,et al. Key agreement from weak bit agreement , 2005, STOC '05.
[13] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[14] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[15] Ran Canetti,et al. Hardness Amplification of Weakly Verifiable Puzzles , 2005, TCC.