Fetching the paper…
Reading the bibliography…
Machine-learning models for security-critical applications such as bot, malware, or spam detection, operate in constrained discrete domains.
J. E. Doran and D. Michie, “Experiments with the graph traverser program,”
1966
Earlier work this paper cites.
P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,”
1968
Earlier work this paper cites.
I. Pohl, “Heuristic search viewed as path finding in a graph,”
1970
Earlier work this paper cites.
I. Pohl, “The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving,” in
1973
Earlier work this paper cites.
J. Pearl and J. H. Kim, “Studies in semi-admissible heuristics,”
1982
Earlier work this paper cites.
R. Dechter and J. Pearl, “Generalized best-first search strategies and the optimality of A*,”
1985
Earlier work this paper cites.
E. Rich and K. Knight,
1991
Earlier work this paper cites.
O. L. Mangasarian, “Arbitrary-norm separating plane,”
1999
Earlier work this paper cites.
A. Back, U. Möller, and A. Stiglic, “Traffic analysis attacks and trade-offs in anonymity providing systems,” in
2001
Earlier work this paper cites.
F. Plastria and E. Carrizosa, “Gauge distances and median hyperplanes,”
2001
Earlier work this paper cites.
M. Likhachev, G. J. Gordon, and S. Thrun, “ARA*: Anytime A* with provable bounds on sub-optimality,” in
2003
Earlier work this paper cites.
R. Dingledine, N. Mathewson, and P. F. Syverson, “Tor: The second-generation onion router,” in
2004
Earlier work this paper cites.
N. N. Dalvi, P. M. Domingos, Mausam, S. K. Sanghai, and D. Verma, “Adversarial classification,” in
2004
Earlier work this paper cites.
D. Lowd and C. Meek, “Adversarial learning,” in
2005
Earlier work this paper cites.
M. Liberatore and B. N. Levine, “Inferring the source of encrypted HTTP connections,” in
2006
Earlier work this paper cites.
A. Abbasi and H. Chen, “Writeprints: A stylometric approach to identity-level identification and similarity detection in cyberspace,”
2008
Earlier work this paper cites.
A. Panchenko, L. Niessen, A. Zinnen, and T. Engel, “Website fingerprinting in onion routing based anonymization networks,” in
2011
Earlier work this paper cites.
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay, “Scikit-learn: Machine learning in Python,”
2011
Earlier work this paper cites.
O. Tange, “Gnu parallel - the command-line power tool,”
2011
Earlier work this paper cites.
K. P. Dyer, S. E. Coull, T. Ristenpart, and T. Shrimpton, “Peek-a-boo, I still see you: Why efficient traffic analysis countermeasures fail,” in
2012
Earlier work this paper cites.
B. Biggio, I. Corona, D. Maiorca, B. Nelson, N. Srndic, P. Laskov, G. Giacinto, and F. Roli, “Evasion attacks against machine learning at test time,” in
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
M. Kosinski, D. Stillwell, and T. Graepel, “Private traits and attributes are predictable from digital records of human behavior,”
2013
Earlier work this paper cites.
I. J. Goodfellow, J. Shlens, and C. Szegedy, “Explaining and harnessing adversarial examples,”
2014
Earlier work this paper cites.
X. Cai, R. Nithyanand, T. Wang, R. Johnson, and I. Goldberg, “A systematic approach to developing and evaluating website fingerprinting defenses,” in
2014
Cited alongside, same era.
X. Cai, R. Nithyanand, and R. Johnson, “CS-BuFLO: A congestion sensitive website fingerprinting defense,” in
2014
Cited alongside, same era.
T. Wang, X. Cai, R. Nithyanand, R. Johnson, and I. Goldberg, “Effective attacks and provable defenses for website fingerprinting,” in
2014
Cited alongside, same era.
K. Asif, W. Xing, S. Behpour, and B. D. Ziebart, “Adversarial cost-sensitive classification,” in
2015
Cited alongside, same era.
S. Moosavi-Dezfooli, A. Fawzi, and P. Frossard, “Deepfool: A simple and accurate method to fool deep neural networks,” in
2016
Cited alongside, same era.
G. Cherubin, “Bayes, not naïve: Security bounds on website fingerprinting defenses,”
2017
Later among the works it cites.
2017
Later among the works it cites.
H. Dang, Y. Huang, and E. Chang, “Evading classifiers by morphing in the dark,” in
2017
Later among the works it cites.
B. Kulynych, “textfool: Plausible looking adversarial examples for text classification,” Jul 2017
2017
Later among the works it cites.
I. Guyon, U. von Luxburg, S. Bengio, H. M. Wallach, R. Fergus, S. V. N. Vishwanathan, and R. Garnett, Eds.,
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…
N. Papernot, P. D. McDaniel, S. Jha, M. Fredrikson, Z. B. Celik, and A. Swami, “The limitations of deep learning in adversarial settings,” in
2016
Cited alongside, same era.
O. Bastani, Y. Ioannou, L. Lampropoulos, D. Vytiniotis, A. V. Nori, and A. Criminisi, “Measuring neural net robustness with constraints,” in
2016
Cited alongside, same era.
2016
Cited alongside, same era.
N. Papernot, P. D. McDaniel, A. Swami, and R. E. Harang, “Crafting adversarial input sequences for recurrent neural networks,” in
2016
Cited alongside, same era.
2016
Cited alongside, same era.
M. Juárez, M. Imani, M. Perry, C. Díaz, and M. Wright, “Toward an efficient website fingerprinting defense,” in
2016
Cited alongside, same era.
A. Fawzi, S. Moosavi-Dezfooli, and P. Frossard, “Robustness of classifiers: from adversarial to random noise,” in
2016
Cited alongside, same era.
2018
Closest in time.
E. Wong, F. Schmidt, J. H. Metzen, and J. Z. Kolter, “Scaling provable adversarial defenses,”
2018
Closest in time.
Y. Tsuzuku, I. Sato, and M. Sugiyama, “Lipschitz-margin training: Scalable certification of perturbation invariance for deep neural networks,” in
2018
Closest in time.
J. Ebrahimi, A. Rao, D. Lowd, and D. Dou, “Hotflip: White-box adversarial examples for text classification,” in
2018
Closest in time.
J. Jia and N. Z. Gong, “Attriguard: A practical defense against attribute inference attacks via adversarial machine learning,” in
2018
Closest in time.
2018
Closest in time.
B. Liang, H. Li, M. Su, P. Bian, X. Li, and W. Shi, “Deep text classification can be fooled,” in
2018
Closest in time.
J. Gao, J. Lanchantin, M. L. Soffa, and Y. Qi, “Black-box generation of adversarial text sequences to evade deep learning classifiers,” in
2018
Closest in time.
2018
Closest in time.
X. Zhang and D. Evans, “Cost-sensitive robustness against adversarial examples,”
2018
Closest in time.
C. Cadwalladr and E. Graham-Harrison, “How Cambridge Analytica turned facebook ‘likes’ into a lucrative political tool,”
2018
Closest in time.
“Coalition letter to Amazon regarding the facial recognition system, Rekognition,” 2018
2018
Closest in time.
P. Sirinam, M. Imani, M. Juárez, and M. Wright, “Deep fingerprinting: Undermining website fingerprinting defenses with deep learning,” in
2018
Closest in time.
V. Rimmer, D. Preuveneers, M. Juárez, T. van Goethem, and W. Joosen, “Automated website fingerprinting through deep learning,” in
2018
Closest in time.
E. Rescorla, K. Oku, N. Sullivan, and C. Wood, “Encrypted Server Name Indication for TLS 1.3,” Working Draft, IETF Secretariat, Internet-Draft draft-ietf-tls-esni-02, October 2018,
2018
Closest in time.
E. Rescorla, “The Transport Layer Security (TLS) Protocol Version 1.3,” Internet Requests for Comments, RFC Editor, RFC 8446, August 2018
2018
Closest in time.
M. Alzantot, Y. Sharma, A. Elgohary, B. Ho, M. B. Srivastava, and K. Chang, “Generating natural language adversarial examples,” in
2018
Closest in time.