Efficient Secure Two-Party Protocols
暂无分享,去创建一个
[1] Moni Naor,et al. Communication preserving protocols for secure function evaluation , 2001, STOC '01.
[2] Michael Rodeh,et al. Finding the Median Distributively , 1982, J. Comput. Syst. Sci..
[3] Brent Waters,et al. A Framework for Efficient and Composable Oblivious Transfer , 2008, CRYPTO.
[4] Rafail Ostrovsky,et al. How To Withstand Mobile Virus Attacks , 1991, PODC 1991.
[5] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[6] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[7] C. P. Schnorr,et al. Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.
[8] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[9] Marc Witteman,et al. Advances in Smartcard Security , 2002 .
[10] Moni Naor,et al. Privacy preserving auctions and mechanism design , 1999, EC '99.
[11] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[12] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[13] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[14] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[15] Claudio Orlandi,et al. LEGO for Two-Party Secure Computation , 2009, TCC.
[16] Moni Naor,et al. Number-theoretic constructions of efficient pseudo-random functions , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.