Black-box constructions for secure computation
暂无分享,去创建一个
Yehuda Lindell | Yuval Ishai | Eyal Kushilevitz | Erez Petrank | Yehuda Lindell | E. Kushilevitz | Y. Ishai | E. Petrank
[1] Moni Naor,et al. Communication preserving protocols for secure function evaluation , 2001, STOC '01.
[2] Amit Sahai,et al. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[3] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[4] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[5] Yuval Ishai,et al. Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.
[6] Luca Trevisan,et al. Notions of Reducibility between Cryptographic Primitives , 2004, TCC.
[7] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[8] Stefan Wolf,et al. Oblivious Transfer Is Symmetric , 2006, EUROCRYPT.
[9] Sampath Kannan,et al. The relationship between public key encryption and oblivious transfer , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[10] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[11] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[12] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[13] Silvio Micali,et al. Computationally Sound Proofs , 2000, SIAM J. Comput..
[14] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[15] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[16] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[17] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[18] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[19] Yehuda Lindell,et al. A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions , 2006, Journal of Cryptology.
[20] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[21] Yuval Ishai,et al. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.
[22] Joe Kilian,et al. Uses of randomness in algorithms and protocols , 1990 .
[23] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[24] Joe Kilian,et al. Improved Efficient Arguments (Preliminary Version) , 1995, CRYPTO.
[25] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[26] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[27] Luca Trevisan,et al. Lower bounds on the efficiency of generic cryptographic constructions , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[28] Tal Malkin,et al. On the impossibility of basing trapdoor functions on trapdoor predicates , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[29] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[30] 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).
[31] Improved Efficient Arguments , 2002 .