Fetching the paper…
Reading the bibliography…
Classification of personal text messages has many useful applications in surveillance, e-commerce, and mental health care, to name a few.
Universal classes of hash functions
J. Lawrence Carter and Mark N. Wegman · 1979
Earlier work this paper cites.
Commodity-based cryptography (extended abstract)
Donald Beaver · 1997
Earlier work this paper cites.
A Bayesian approach to filtering junk e-mail
Mehran Sahami, Susan Dumais, David Heckerman, and Eric Horvitz · 1998
Earlier work this paper cites.
Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer
Ronald L. Rivest · 1999
Earlier work this paper cites.
Universally composable security: A new paradigm for cryptographic protocols
Ran Canetti · 2001
Earlier work this paper cites.
Universally composable commitments
Ran Canetti and Marc Fischlin · 2001
Earlier work this paper cites.
Universally composable two-party and multi-party secure computation
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai · 2002
Earlier work this paper cites.
Tools for privacy preserving distributed data mining
Chris Clifton, Murat Kantarcioglu, Jaideep Vaidya, Xiaodong Lin, and Michael Y. Zhu · 2002
Earlier work this paper cites.
Universally composable protocols with relaxed set-up assumptions
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, and Rafael Pass · 2004
Earlier work this paper cites.
Universally composable commitments using random oracles
Dennis Hofheinz and Jörn Müller-Quade · 2004
Earlier work this paper cites.
Universally composable zero-knowledge arguments and commitments from signature cards
Dennis Hofheinz, Jörn Müller-Quade, and Dominique Unruh · 2005
Earlier work this paper cites.
Practical and secure solutions for integer comparison
Juan A. Garay, Berry Schoenmakers, and José Villegas · 2007
Earlier work this paper cites.
Universally composable multi-party computation using tamper-proof hardware
Jonathan Katz · 2007
Earlier work this paper cites.
Efficient privacy preserving distributed clustering based on secret sharing
Selim V Kaya, Thomas B Pedersen, Erkay Savaş, and Yücel Saygıỳn · 2007
Earlier work this paper cites.
On the possibility of universally composable commitments based on noisy channels
Rafael Dowsley, Jörn Müller-Quade, and Anderson C. A. Nascimento · 2008
Earlier work this paper cites.
Differential privacy: A survey of results
Cynthia Dwork · 2008
Earlier work this paper cites.
A framework for efficient and composable oblivious transfer
Chris Peikert, Vinod Vaikuntanathan, and Brent Waters · 2008
Earlier work this paper cites.
On the secure hash algorithm family
Wouter Penard and Tim van Werkhoven · 2008
Earlier work this paper cites.
A two-party protocol with trusted initializer for computing the inner product
Rafael Dowsley, Jeroen Van De Graaf, Davidson Marques, and Anderson CA Nascimento · 2010
Earlier work this paper cites.
Contributions to the study of SMS spam filtering: new collection and results
Tiago A. Almeida, José María G. Hidalgo, and Akebo Yamakami · 2011
Cited alongside, same era.
Unconditional and composable security using a single stateful tamper-proof hardware token
Nico Döttling, Daniel Kraschewski, and Jörn Müller-Quade · 2011
Cited alongside, same era.
Universally composable and statistically secure verifiable secret sharing scheme based on pre-distributed data
Rafael Dowsley, Jörn Müller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai, and Anderson C. A. Nascimento · 2011
Cited alongside, same era.
On the composability of statistically secure bit commitments
Rafael Dowsley, Jeroen van de Graaf, Jörn Müller-Quade, and Anderson C. A. Nascimento · 2013
Cited alongside, same era.
On the power of correlated randomness in secure computation
Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, and Anat Paskin-Cherniavsky · 2013
Cited alongside, same era.
A taxonomy of secure two-party comparison protocols and efficient constructions
Nuttapong Attrapadung, Goichiro Hanaoka, Shinsaku Kiyomoto, Tomoaki Mimoto, and Jacob CN Schuldt · 2017
Later among the works it cites.
A framework for efficient adaptively secure composable oblivious transfer in the ROM
Paulo S. L. M. Barreto, Bernardo David, Rafael Dowsley, Kirill Morozov, and Anderson C. A. Nascimento · 2017
Later among the works it cites.
Privacy-preserving text mining as a service
Gianpiero Costantino, Antonio La Marra, Fabio Martinelli, Andrea Saracino, and Mina Sheikhalishahi · 2017
Later among the works it cites.
Secureml: A system for scalable privacy-preserving machine learning
Payman Mohassel and Yupeng Zhang · 2017
Later among the works it cites.
Forecasting the onset and course of mental illness with Twitter data
Andrew G. Reece, Andrew J. Reagan, Katharina L.M. Lix, Peter Sheridan Dodds, Christopher M. Danforth, and Ellen J. Langer · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Practical secure decision tree learning in a teletreatment application
Sebastiaan de Hoogh, Berry Schoenmakers, Ping Chen, and Harm op den Akker · 2014
Cited alongside, same era.
Machine learning classification over encrypted data
Raphael Bost, Raluca Ada Popa, Stephen Tu, and Shafi Goldwasser · 2015
Cited alongside, same era.
Secure Multiparty Computation and Secret Sharing
Ronald Cramer, Ivan Damgård, and Jesper Buus Nielsen · 2015
Cited alongside, same era.
Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols
Bernardo David, Rafael Dowsley, Raj Katti, and Anderson CA Nascimento · 2015
Cited alongside, same era.
Fast, privacy preserving linear regression over distributed datasets based on pre-distributed data
Martine De Cock, Rafael Dowsley, Anderson C. A. Nascimento, and Stacey C. Newman · 2015
Cited alongside, same era.
Aby-a framework for efficient mixed-protocol secure two-party computation
Daniel Demmler, Thomas Schneider, and Michael Zohner · 2015
Cited alongside, same era.
Weakening the isolation assumption of tamper-proof hardware tokens
Rafael Dowsley, Jörn Müller-Quade, and Tobias Nilges · 2015
Cited alongside, same era.
Combining private set-intersection with secure two-party computation
Michele Ciampi and Claudio Orlandi · 2018
Later among the works it cites.
Private set intersection with linear communication from general assumptions
Brett Hemenway Falk, Daniel Noble, and Rafail Ostrovsky · 2018
Later among the works it cites.
Privacy-preserving scoring of tree ensembles: A novel framework for AI in healthcare
Kyle Fritchman, Keerthanaa Saminathan, Rafael Dowsley, Tyler Hughes, Martine De Cock, Anderson Nascimento, and Ankur Teredesai · 2018
Later among the works it cites.
All you need is “love”: Evading hate-speech detection
Tommi Gröndahl, Luca Pajola, Mika Juuti, Mauro Conti, and N. Asokan · 2018
Later among the works it cites.
Scalable private set intersection based on OT extension
Benny Pinkas, Thomas Schneider, and Michael Zohner · 2018
Later among the works it cites.
Chameleon: A hybrid secure computation framework for machine learning applications
M Sadegh Riazi, Christian Weinert, Oleksandr Tkachenko, Ebrahim M Songhori, Thomas Schneider, and Farinaz Koushanfar · 2018
Later among the works it cites.
Automatic detection of cyberbullying in social media text
Cynthia Van Hee, Gilles Jacobs, Chris Emmery, Bart Desmet, Els Lefever, Ben Verhoeven, Guy De Pauw, Walter Daelemans, and Véronique Hoste · 2018
Later among the works it cites.
SynTF: Synthetic and differentially private term frequency vectors for privacy-preserving text mining
Benjamin Weggenmann and Florian Kerschbaum · 2018
Later among the works it cites.
Protecting privacy of users in brain-computer interface applications
Anisha Agarwal, Rafael Dowsley, Nicholas D. McKinney, Dongrui Wu, Chin-Teng Lin, Martine De Cock, and Anderson C. A. Nascimento · 2019
Closest in time.
Semeval-2019 Task 5: Multilingual detection of hate speech against immigrants and women in Twitter
Valerio Basile, Cristina Bosco, Elisabetta Fersini, Debora Nozza, Viviana Patti, Francisco Rangel, Paolo Rosso, and Manuela Sanguinetti · 2019
Closest in time.
Efficient and private scoring of decision trees, support vector machines and logistic regression models based on pre-computation
Martine De Cock, Rafael Dowsley, Caleb Horst, Raj Katti, Anderson Nascimento, Wing-Sea Poon, and Stacey Truex · 2019
Closest in time.
Privacy-preserving classification of personal text messages with secure multi-party computation
Devin Reich, Ariel Todoki, Rafael Dowsley, Martine De Cock, and Anderson C. A. Nascimento · 2019
Closest in time.
High performance logistic regression for privacy-preserving genome analysis
Martine De Cock, Rafael Dowsley, Anderson C. A. Nascimento, Davis Railsback, Jianwei Shen, and Ariel Todoki · 2020
Closest in time.