Black-Box Constructions of Protocols for Secure Computation
暂无分享,去创建一个
Yehuda Lindell | Yuval Ishai | Eyal Kushilevitz | Erez Petrank | Iftach Haitner | Yehuda Lindell | E. Kushilevitz | Y. Ishai | Iftach Haitner | E. Petrank
[1] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[2] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[3] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.
[4] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[5] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[6] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[7] Yehuda Lindell,et al. Black-box constructions for secure computation , 2006, STOC '06.
[8] Moni Naor,et al. Communication preserving protocols for secure function evaluation , 2001, STOC '01.
[9] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[10] Tal Malkin,et al. Simple, Black-Box Constructions of Adaptively Secure Protocols , 2009, TCC.
[11] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[12] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[13] R. Cramer,et al. Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .
[14] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[15] Silvio Micali,et al. Computationally Sound Proofs , 2000, SIAM J. Comput..
[16] Yuval Ishai,et al. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.
[17] 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).
[18] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[19] 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).
[20] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[21] 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).
[22] Luca Trevisan,et al. Lower bounds on the efficiency of generic cryptographic constructions , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[23] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[24] Yehuda Lindell,et al. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries , 2007, TCC.
[25] Omer Reingold,et al. Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function , 2009, SIAM J. Comput..
[26] Iftach Haitner,et al. Semi-honest to Malicious Oblivious Transfer - The Black-Box Way , 2008, TCC.
[27] Yuval Ishai,et al. Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.
[28] Luca Trevisan,et al. Notions of Reducibility between Cryptographic Primitives , 2004, TCC.
[29] Joe Kilian,et al. Uses of randomness in algorithms and protocols , 1990 .
[30] Oded Goldreich. Foundations of Cryptography: Volume 1 , 2006 .
[31] Yehuda Lindell,et al. A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions , 2003, EUROCRYPT.
[32] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[33] Yael Tauman Kalai,et al. Smooth Projective Hashing and Two-Message Oblivious Transfer , 2005, Journal of Cryptology.
[34] A. Föhrenbach,et al. SIMPLE++ , 2000, OR Spectr..
[35] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[36] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[37] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[38] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[39] Oded Goldreich,et al. On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits , 2007, Journal of Cryptology.
[40] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[41] Ivan Damgård,et al. Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments , 1997, STOC '97.
[42] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[43] Stefan Wolf,et al. Oblivious Transfer Is Symmetric , 2006, EUROCRYPT.
[44] Sampath Kannan,et al. The relationship between public key encryption and oblivious transfer , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[45] Tal Malkin,et al. On the impossibility of basing trapdoor functions on trapdoor predicates , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.