Secure Multiparty Computation for Privacy-Preserving Data Mining
暂无分享,去创建一个
[1] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[2] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[3] Benny Pinkas,et al. Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.
[4] Oded Goldreich,et al. Cryptography and cryptographic protocols , 2003, Distributed Computing.
[5] Yehuda Lindell,et al. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries , 2007, Journal of Cryptology.
[6] Moni Naor,et al. Number-theoretic constructions of efficient pseudo-random functions , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[7] Ladjel Bellatreche. A Genetic Algorithm for Selecting Horizontal Fragments , 2009, Encyclopedia of Data Warehousing and Mining.
[8] Yehuda Lindell,et al. Privacy Preserving Data Mining , 2000, Journal of Cryptology.
[9] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[10] Silvio Micali,et al. Probabilistic encryption & how to play mental poker keeping secret all partial information , 1982, STOC '82.
[11] Peter Winkler,et al. Comparing information without leaking it , 1996, CACM.
[12] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[13] Hong Shen,et al. Flexible Mining of Association Rules , 2009, Encyclopedia of Data Warehousing and Mining.
[14] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[15] Yehuda Lindell,et al. A Proof of Yao's Protocol for Secure Two-Party Computation , 2004, Electron. Colloquium Comput. Complex..
[16] Ivan Damgård,et al. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.
[17] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[18] Vitaly Shmatikov,et al. Efficient Two-Party Secure Computation on Committed Inputs , 2007, EUROCRYPT.
[19] Workplace Bulletin,et al. Human Resources and Social Development Canada , 2007 .
[20] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[21] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[22] Matthew K. Franklin,et al. Joint Encryption and Message-Efficient Secure Computation , 1993, CRYPTO.
[23] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[24] Rafail Ostrovsky,et al. How To Withstand Mobile Virus Attacks , 1991, PODC 1991.
[25] Yuval Ishai,et al. Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.
[26] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[27] Rafail Ostrovsky,et al. How to withstand mobile virus attacks (extended abstract) , 1991, PODC '91.
[28] Silvio Micali,et al. Non-Interactive Oblivious Transfer and Spplications , 1989, CRYPTO.
[29] Markus Stadler,et al. Publicly Verifiable Secret Sharing , 1996, EUROCRYPT.
[30] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[31] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[32] Oded Goldreich,et al. Foundations of Cryptography: Volume 1, Basic Tools , 2001 .
[33] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[34] Jesper Buus Nielsen,et al. Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free , 2007, IACR Cryptol. ePrint Arch..
[35] Donald Beaver,et al. Foundations of Secure Interactive Computing , 1991, CRYPTO.
[36] Yael Tauman Kalai,et al. Smooth Projective Hashing and Two-Message Oblivious Transfer , 2005, Journal of Cryptology.
[37] Dawn Xiaodong Song,et al. Privacy-Preserving Set Operations , 2005, CRYPTO.
[38] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[39] Ran Canetti,et al. Maintaining Security in the Presence of Transient Faults , 1994, CRYPTO.
[40] Benny Pinkas,et al. Secure Computation of the k th-Ranked Element , 2004, EUROCRYPT.
[41] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[42] Yehuda Lindell,et al. Introduction to Modern Cryptography , 2004 .
[43] R. Cramer,et al. Multiparty Computation from Threshold Homomorphic Encryption , 2000 .
[44] Moni Naor,et al. Oblivious Polynomial Evaluation , 2006, SIAM J. Comput..
[45] Philip Calvert,et al. Encyclopedia of Data Warehousing and Mining , 2006 .
[46] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[47] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!) , 2004 .
[48] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[49] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[50] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.