Scaling Private Set Intersection to Billion-Element Sets
暂无分享,去创建一个
Mariana Raykova | Seny Kamara | Payman Mohassel | Seyed Saeed Sadeghian | Mariana Raykova | Payman Mohassel | S. Kamara | S. Sadeghian
[1] Victor Shoup. Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings , 2005, CRYPTO.
[2] Changyu Dong,et al. When private set intersection meets big data: an efficient and scalable protocol , 2013, CCS.
[3] Prateek Mittal,et al. BotGrep: Finding P2P Bots with Structured Graph Analysis , 2010, USENIX Security Symposium.
[4] Henri Gilbert,et al. Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30 - June 3, 2010. Proceedings , 2010, EUROCRYPT.
[5] Ivan Damgård,et al. Secure Multiparty Computation Goes Live , 2009, Financial Cryptography.
[6] Eu-Jin Goh,et al. Secure Indexes , 2003, IACR Cryptol. ePrint Arch..
[7] Vinod Vaikuntanathan,et al. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.
[8] Yehuda Lindell,et al. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation , 2001, Journal of Cryptology.
[9] Moti Yung,et al. Efficient robust private set intersection , 2012, Int. J. Appl. Cryptogr..
[10] Emiliano De Cristofaro,et al. Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model , 2010, ASIACRYPT.
[11] Jonathan Katz,et al. Partial Fairness in Secure Two-Party Computation , 2010, Journal of Cryptology.
[12] Markus Kasper,et al. The World is Not Enough: Another Look on Second-Order DPA , 2010, IACR Cryptol. ePrint Arch..
[13] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[14] Martín Abadi,et al. Code-Carrying Authorization , 2008, ESORICS.
[15] Yehuda Lindell,et al. Constructions of truly practical secure protocols using standardsmartcards , 2008, CCS.
[16] Benny Pinkas,et al. Secure Set Intersection with Untrusted Hardware Tokens , 2011, CT-RSA.
[17] Aggelos Kiayias,et al. Traceable Signatures , 2004, EUROCRYPT.
[18] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[19] Carmit Hazay,et al. Efficient Set Operations in the Presence of Malicious Adversaries , 2010, Journal of Cryptology.
[20] Rafail Ostrovsky,et al. Round Efficiency of Multi-party Computation with a Dishonest Majority , 2003, EUROCRYPT.
[21] Florian Kerschbaum,et al. Outsourced private set intersection using homomorphic encryption , 2012, ASIACCS '12.
[22] Chi Sung Laih,et al. Advances in Cryptology - ASIACRYPT 2003 , 2003 .
[23] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[24] Peter Winkler,et al. Comparing information without leaking it , 1996, CACM.
[25] Aggelos Kiayias,et al. Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.
[26] Yehuda Lindell,et al. SCAPI: The Secure Computation Application Programming Interface , 2012, IACR Cryptol. ePrint Arch..
[27] Ahmad-Reza Sadeghi,et al. TASTY: tool for automating secure two-party computations , 2010, CCS '10.
[28] Abhi Shelat,et al. Efficient Secure Computation with Garbled Circuits , 2011, ICISS.
[29] Manoj Prabhakaran,et al. Resource Fairness and Composability of Cryptographic Protocols , 2006, Journal of Cryptology.
[30] Jan Camenisch,et al. Fair Private Set Intersection with a Semi-trusted Arbiter , 2013, IACR Cryptol. ePrint Arch..
[31] Jacques Traoré,et al. A fair and efficient solution to the socialist millionaires' problem , 2001, Discret. Appl. Math..
[32] Emiliano De Cristofaro,et al. Experimenting with Fast Private Set Intersection , 2012, TRUST.
[33] Dawn Xiaodong Song,et al. Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.
[34] Ran Canetti,et al. Advances in Cryptology – CRYPTO 2013 , 2013, Lecture Notes in Computer Science.
[35] Charalampos Papamanthou,et al. Parallel and Dynamic Searchable Symmetric Encryption , 2013, Financial Cryptography.
[36] Dan Boneh,et al. Location Privacy via Private Proximity Testing , 2011, NDSS.
[37] Hugo Krawczyk,et al. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries , 2013, IACR Cryptol. ePrint Arch..
[38] Helger Lipmaa,et al. Verifiable Homomorphic Oblivious Transfer and Private Equality Test , 2003, ASIACRYPT.
[39] Lior Malka,et al. VMCrypt: modular software architecture for scalable secure computation , 2011, CCS '11.
[40] Yuval Ishai,et al. Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.
[41] Emiliano De Cristofaro,et al. Countering GATTACA: efficient and secure testing of fully-sequenced human genomes , 2011, CCS '11.
[42] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[43] Yuval Ishai,et al. Scalable Multiparty Computation with Nearly Optimal Work and Resilience , 2008, CRYPTO.
[44] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .
[45] Michael Mitzenmacher,et al. Privacy Preserving Keyword Searches on Remote Encrypted Data , 2005, ACNS.
[46] Yehuda Lindell,et al. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries , 2007, Journal of Cryptology.
[47] Benny Pinkas,et al. Fair Secure Two-Party Computation , 2003, EUROCRYPT.
[48] Charalampos Papamanthou,et al. Dynamic searchable symmetric encryption , 2012, IACR Cryptol. ePrint Arch..
[49] Aggelos Kiayias,et al. Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, San Francisco, CA, USA, February 14-18, 2011. Proceedings , 2011, CT-RSA.
[50] Melissa Chase,et al. Structured Encryption and Controlled Disclosure , 2010, IACR Cryptol. ePrint Arch..
[51] Mariana Raykova,et al. Outsourcing Multi-Party Computation , 2011, IACR Cryptol. ePrint Arch..
[52] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[53] Moti Yung,et al. Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications , 2011, ACNS.
[54] Benny Pinkas,et al. FairplayMP: a system for secure multi-party computation , 2008, CCS.
[55] Rafail Ostrovsky,et al. Multiparty Proximity Testing with Dishonest Majority from Equality Testing , 2012, ICALP.
[56] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[57] Xiaomin Liu,et al. Fast Secure Computation of Set Intersection , 2010, SCN.
[58] Yehuda Lindell,et al. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries , 2008, Journal of Cryptology.
[59] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[60] Ben Riva,et al. Salus: a system for server-aided secure function evaluation , 2012, CCS.
[61] Oded Goldreich,et al. Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[62] Yehuda Lindell,et al. More Efficient Constant-Round Multi-Party Computation from BMR and SHE , 2016, IACR Cryptol. ePrint Arch..
[63] Manoj Prabhakaran,et al. Resource Fairness and Composability of Cryptographic Protocols , 2006, TCC.
[64] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System , 2004, USENIX Security Symposium.
[65] Rafail Ostrovsky,et al. Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.
[66] Yuval Ishai,et al. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.
[67] Jonathan Katz,et al. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? , 2012, NDSS.
[68] Dan Bogdanov,et al. Sharemind: A Framework for Fast Privacy-Preserving Computations , 2008, ESORICS.
[69] Kenneth G. Paterson,et al. Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation , 2012, IACR Cryptol. ePrint Arch..
[70] Yehuda Lindell,et al. Complete Fairness in Secure Two-Party Computation , 2011, JACM.
[71] Jan Camenisch,et al. Private Intersection of Certified Sets , 2009, Financial Cryptography.
[72] Hongxia Jin,et al. Private proximity testing with an untrusted server , 2013, WiSec '13.
[73] Martijn Stam. Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions , 2008, CRYPTO.
[74] Benny Pinkas,et al. Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.
[75] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[76] Emiliano De Cristofaro,et al. Practical Private Set Intersection Protocols with Linear Complexity , 2010, Financial Cryptography.
[77] Dawn Xiaodong Song,et al. Privacy-Preserving Set Operations , 2005, CRYPTO.
[78] Ivan Damgård,et al. Asynchronous Multiparty Computation: Theory and Implementation , 2008, IACR Cryptol. ePrint Arch..