7 Search Results for "Joseph, Anthony D."

Document
DOI: 10.4230/DagMan.3.1.1
Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371)

Authors: Anthony D. Joseph, Pavel Laskov, Fabio Roli, J. Doug Tygar, and Blaine Nelson

Published in: Dagstuhl Manifestos, Volume 3, Issue 1 (2013)

Abstract
The study of learning in adversarial environments is an emerging discipline at the juncture between machine learning and computer security. The interest in learning-based methods for security- and system-design applications comes from the high degree of complexity of phenomena underlying the security and reliability of computer systems. As it becomes increasingly difficult to reach the desired properties solely using statically designed mechanisms, learning methods are being used more and more to obtain a better understanding of various data collected from these complex systems. However, learning approaches can be evaded by adversaries, who change their behavior in response to the learning methods. To-date, there has been limited research into learning techniques that are resilient to attacks with provable robustness guarantees The Perspectives Workshop, "Machine Learning Methods for Computer Security" was convened to bring together interested researchers from both the computer security and machine learning communities to discuss techniques, challenges, and future research directions for secure learning and learning-based security applications. As a result of the twenty-two invited presentations, workgroup sessions and informal discussion, several priority areas of research were identified. The open problems identified in the field ranged from traditional applications of machine learning in security, such as attack detection and analysis of malicious software, to methodological issues related to secure learning, especially the development of new formal approaches with provable security guarantees. Finally a number of other potential applications were pinpointed outside of the traditional scope of computer security in which security issues may also arise in connection with data-driven methods. Examples of such applications are social media spam, plagiarism detection, authorship identification, copyright enforcement, computer vision (particularly in the context of biometrics), and sentiment analysis.
Cite as

Anthony D. Joseph, Pavel Laskov, Fabio Roli, J. Doug Tygar, and Blaine Nelson. Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371). In Dagstuhl Manifestos, Volume 3, Issue 1, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{joseph_et_al:DagMan.3.1.1,
  author =	{Joseph, Anthony D. and Laskov, Pavel and Roli, Fabio and Tygar, J. Doug and Nelson, Blaine},
  title =	{{Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371)}},
  pages =	{1--30},
  journal =	{Dagstuhl Manifestos},
  ISSN =	{2193-2433},
  year =	{2013},
  volume =	{3},
  number =	{1},
  editor =	{Joseph, Anthony D. and Laskov, Pavel and Roli, Fabio and Tygar, J. Doug and Nelson, Blaine},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagMan.3.1.1},
  URN =		{urn:nbn:de:0030-drops-43569},
  doi =		{10.4230/DagMan.3.1.1},
  annote =	{Keywords: Adversarial Learning, Computer Security, Robust Statistical Learning, Online Learning with Experts, Game Theory, Learning Theory}
}
Document
DOI: 10.4230/DagRep.2.9.109
Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371)

Authors: Anthony D. Joseph, Pavel Laskov, Fabio Roli, J. Doug Tygar, and Blaine Nelson

Published in: Dagstuhl Reports, Volume 2, Issue 9 (2013)

Abstract
The study of learning in adversarial environments is an emerging discipline at the juncture between machine learning and computer security that raises new questions within both fields. The interest in learning-based methods for security and system design applications comes from the high degree of complexity of phenomena underlying the security and reliability of computer systems. As it becomes increasingly difficult to reach the desired properties by design alone, learning methods are being used to obtain a better understanding of various data collected from these complex systems. However, learning approaches can be co-opted or evaded by adversaries, who change to counter them. To-date, there has been limited research into learning techniques that are resilient to attacks with provable robustness guarantees making the task of designing secure learning-based systems a lucrative open research area with many challenges. The Perspectives Workshop, ``Machine Learning Methods for Computer Security'' was convened to bring together interested researchers from both the computer security and machine learning communities to discuss techniques, challenges, and future research directions for secure learning and learning-based security applications. This workshop featured twenty-two invited talks from leading researchers within the secure learning community covering topics in adversarial learning, game-theoretic learning, collective classification, privacy-preserving learning, security evaluation metrics, digital forensics, authorship identification, adversarial advertisement detection, learning for offensive security, and data sanitization. The workshop also featured workgroup sessions organized into three topic: machine learning for computer security, secure learning, and future applications of secure learning.
Cite as

Anthony D. Joseph, Pavel Laskov, Fabio Roli, J. Doug Tygar, and Blaine Nelson. Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371). In Dagstuhl Reports, Volume 2, Issue 9, pp. 109-130, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{joseph_et_al:DagRep.2.9.109,
  author =	{Joseph, Anthony D. and Laskov, Pavel and Roli, Fabio and Tygar, J. Doug and Nelson, Blaine},
  title =	{{Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371)}},
  pages =	{109--130},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{9},
  editor =	{Joseph, Anthony D. and Laskov, Pavel and Roli, Fabio and Tygar, J. Doug and Nelson, Blaine},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.9.109},
  URN =		{urn:nbn:de:0030-drops-37908},
  doi =		{10.4230/DagRep.2.9.109},
  annote =	{Keywords: Adversarial Learning, Computer Security, Robust Statistical Learning, Online Learning with Experts, Game Theory, Learning Theory}
}
Document
DOI: 10.4230/DagSemProc.06131.1
06131 Abstracts Collection – Peer-to -Peer -Systems and -Applications

Authors: Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
From 26.03.06 to 29.03.06, the Dagstuhl Seminar 06131 ``Peer-to-Peer-Systems and -Applications'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle. 06131 Abstracts Collection – Peer-to -Peer -Systems and -Applications. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{joseph_et_al:DagSemProc.06131.1,
  author =	{Joseph, Anthony D. and Steinmetz, Ralf and Stoica, Ion and Wehrle, Klaus},
  title =	{{06131 Abstracts Collection – Peer-to -Peer -Systems and -Applications}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.1},
  URN =		{urn:nbn:de:0030-drops-8455},
  doi =		{10.4230/DagSemProc.06131.1},
  annote =	{Keywords: Peer-to-Peer, self-organisation, massively distributed systems}
}
Document
DOI: 10.4230/DagSemProc.06131.2
06131 Executive Summary – Peer-to-Peer-Systems and -Applications

Authors: Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
This is the executive summary of Dagstuhl Seminar 06131, "Peer-to-Peer-Systems and -Applications". The seminar was held from March 26th to March 29th, 2006, at the International Conference and Research Center for Computer Science at Castle Dagstuhl, Germany.
Cite as

Anthony D. Joseph, Ralf Steinmetz, Ion Stoica, and Klaus Wehrle. 06131 Executive Summary – Peer-to-Peer-Systems and -Applications. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{joseph_et_al:DagSemProc.06131.2,
  author =	{Joseph, Anthony D. and Steinmetz, Ralf and Stoica, Ion and Wehrle, Klaus},
  title =	{{06131 Executive Summary – Peer-to-Peer-Systems and -Applications}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.2},
  URN =		{urn:nbn:de:0030-drops-8522},
  doi =		{10.4230/DagSemProc.06131.2},
  annote =	{Keywords: Peer-to-Peer, self-organisation, massively distributed systems}
}
Document
DOI: 10.4230/DagSemProc.06131.3
Fairness in Peer-to-Peer Networks

Authors: Kolja Eger and Ulrich Killat

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
The first Peer-to-Peer (P2P) networks were based mainly on the altruistic behaviour of its peers. Although newer implementations incorporate some kind of incentive mechanism to award sharing peers, no P2P network assures some quality of service. Our work is meant as a first step towards the development of P2P networks with quality of service. We propose a distributed resource allocation algorithm where peers control the service rate to its neighbours. This algorithm is based on the congestion pricing principle known from IP networks and ensures some form of fairness. Hence a peer gets a fair share of the resources available in the P2P network weighted by its contribution to the network. We present the first simulation results about the convergence of our algorithm and its functionality in large and varying networks.
Cite as

Kolja Eger and Ulrich Killat. Fairness in Peer-to-Peer Networks. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{eger_et_al:DagSemProc.06131.3,
  author =	{Eger, Kolja and Killat, Ulrich},
  title =	{{Fairness in Peer-to-Peer Networks}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.3},
  URN =		{urn:nbn:de:0030-drops-6452},
  doi =		{10.4230/DagSemProc.06131.3},
  annote =	{Keywords: Pricing, Rate Control, Resource Allocation, Distributed Optimisation, Fairness, P2P Networks}
}
Document
DOI: 10.4230/DagSemProc.06131.4
On the Topologies Formed by Selfish Peers

Authors: Stefan Schmid, Thomas Moscibroda, and Roger Wattenhofer

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
Many P2P systems are only proven efficient for static environments. However, in practice, P2P systems are often very dynamic in the sense that peers can join and leave a system at any time and concurrently. In the first part of my talk, I will present a DHT we have developed recently in our group which maintains desirable properties under worst-case churn. In the second part of my talk, we will briefly look at another challenge of prime importance in P2P computing, namely selfishness. Concretely, some results are presented concerning the impact of selfish behavior on the performance of P2P topologies.
Cite as

Stefan Schmid, Thomas Moscibroda, and Roger Wattenhofer. On the Topologies Formed by Selfish Peers. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{schmid_et_al:DagSemProc.06131.4,
  author =	{Schmid, Stefan and Moscibroda, Thomas and Wattenhofer, Roger},
  title =	{{On the Topologies Formed by Selfish Peers}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.4},
  URN =		{urn:nbn:de:0030-drops-6431},
  doi =		{10.4230/DagSemProc.06131.4},
  annote =	{Keywords: Churn, Selfishness, P2P Topologies}
}
Document
DOI: 10.4230/DagSemProc.06131.5
Taming Dynamic and Selfish Peers

Authors: Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer

Published in: Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006)

Abstract
Peer-to-peer systems are often faced with the problem of frequent membership changes. However, many systems are only proven efficient or correct in static environments. In my talk, I will present techniques to maintain desirable properties of a distributed hash table (low peer degree, low network diameter) in spite of ongoing and concurrent dynamics. I will then go on and study the effect of peers not acting according to our protocols. Concretely, I assume that peers are selfish and choose the behavior which maximizes their utility. I will report on our results concerning the impact of selfishness on the peer-to-peer topology.
Cite as

Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Taming Dynamic and Selfish Peers. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{schmid_et_al:DagSemProc.06131.5,
  author =	{Schmid, Stefan and Kuhn, Fabian and Moscibroda, Thomas and Wattenhofer, Roger},
  title =	{{Taming Dynamic and Selfish Peers}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.5},
  URN =		{urn:nbn:de:0030-drops-6477},
  doi =		{10.4230/DagSemProc.06131.5},
  annote =	{Keywords: Churn, Selfishness, P2P Topologies}
}
  • Refine by Author
  • 4 Joseph, Anthony D.
  • 2 Laskov, Pavel
  • 2 Moscibroda, Thomas
  • 2 Nelson, Blaine
  • 2 Roli, Fabio
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 2 Adversarial Learning
  • 2 Churn
  • 2 Computer Security
  • 2 Game Theory
  • 2 Learning Theory
  • Show More...

  • Refine by Type
  • 7 document

  • Refine by Publication Year
  • 3 2007
  • 2 2006
  • 2 2013

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact