Privacy-Preserving Applications on Smartphones
暂无分享,去创建一个
[1] Jonathan Katz,et al. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? , 2012, NDSS.
[2] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[3] Yehuda Lindell,et al. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries , 2008, Journal of Cryptology.
[4] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[5] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[6] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[7] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[8] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System , 2004, USENIX Security Symposium.
[9] Wenliang Du,et al. A practical approach to solve Secure Multi-party Computation problems , 2002, NSPW '02.
[10] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[11] Donald Beaver,et al. Commodity-based cryptography (extended abstract) , 1997, STOC '97.
[12] Emiliano De Cristofaro,et al. Private discovery of common social contacts , 2011, International Journal of Information Security.
[13] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[14] Pradeep K. Khosla,et al. SWATT: softWare-based attestation for embedded devices , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.
[15] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[16] Benny Pinkas,et al. Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.
[17] Emiliano De Cristofaro,et al. Private Discovery of Common Social Contacts , 2011, ACNS.
[18] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.