|
SRUTI '07 Call for Papers
3rd Workshop on Steps to Reducing Unwanted Traffic on the Internet (SRUTI '07)
June 18, 2007
Santa Clara, CA, USA
Sponsored by USENIX
Co-located with the 2007 USENIX Annual Technical Conference (USENIX '07), which will take place June 17–22, 2007
Important
Dates
Submissions due: Tuesday, April 17, 2007, 0400 UTC
(Monday, April 16, 2007, 11:00 p.m. EST)
Notification of acceptance: Saturday, May 5, 2007
Final papers due: Tuesday, May 15, 2007
Workshop
Organizers
Program Chair
Steven M. Bellovin, Columbia University
Program Committee
Paul Barford, University of Wisconsin
Pei Cao, Stanford University
Richard Clayton, University of Cambridge
Bill Cheswick, Consultant
Nick Feamster, Georgia Institute of Technology
Farnam Jahanian, University of Michigan
Tadayoshi Kohno, University of Washington
Athina Markopoulou, University of California, Irvine
Chris Morrow, Verizon Business
Sean Smith, Dartmouth University
Oliver Spatscheck, AT&T Labs—Research
Lakshmi Subramanian, New York University
Paul van Oorschot, Carleton University
Yi-Min Wang, Microsoft Research
Steering Committee
Steven M. Bellovin, Columbia University
Balachander Krishnamurthy, AT&T Labs—Research
Ellie Young, USENIX
Overview
Attacks on the Internet continue apace, with unwanted traffic, such as
phishing, spam, and distributed denial of service attacks increasing
steadily. Such unwanted traffic is seen in many protocols (IP, TCP,
DNS, BGP, and HTTP) and applications (e.g., email, Web), with
increasing economic motivation behind them. SRUTI seeks research on
the unwanted traffic problem that explores the underground economy
by examining commonalities in attacks and possible solutions.
Original research, promising ideas, and possible solutions at all
levels of the protocol stack are sought. We look for ideas in
networking and systems, and insights from other areas such as
economics. SRUTI seeks to foster better connections between academic
and industrial research communities, as well as those operating various
pieces of the Internet infrastructure.
SRUTI session chairs will play the role of a discussant, presenting a
summary of the papers in the session and a state-of-the-art synopsis
of the topic. The workshop will be interactive, with time for questions
and answers. Submissions must contribute to improving the current
understanding of unwanted traffic and/or suggestions for reducing
it. All submissions to SRUTI '07 will be via the Web submission form,
which will be available here soon. The proceedings of the workshop
will be published by USENIX. To ensure a productive workshop environment,
attendance will be by invitation and/or acceptance of paper
submission.
Topics
Relevant topics include:
- Architectural solutions to the unwanted traffic problem
- Scientific assessment of the spread and danger of the attacks
- Practical countermeasures to various aspects of unwanted traffic (phishing, spam, DoS, etc.)
- Cross-layer solutions and solutions to combination attacks
- Attacks on emerging technologies (e.g., sensors, VOIP, PDAs) and possible countermeasures
- Privacy and anonymity
- Intrusion avoidance, detection, and response
- All forms of malicious code
- Analysis of protocols and systems vulnerabilities
- Attacks on specific network technologies (e.g., wireless networks)
- New types of solutions: incentive-based, economic, statistical, collaborative, etc.
Paper Submissions
All submissions must be in English and must include a title and the
authors' names and affiliations. Submissions should be no more than
six (6) 8.5" x 11" pages long and must be formatted in 2 columns,
using 10 point Times Roman type on 12 point leading, in a text block
of 6.5" by 9". Papers should be submitted in PDF or PostScript only.
PDF users should use "Type 1" fonts instead of "Type 3," and should
embed and subset all fonts. You can find instructions on how to do
this at the following Web sites:
Each submission should have a
contact author who should provide full contact information (email,
phone, fax, mailing address). One author of each accepted paper will
be required to present the work at the workshop. Authors must submit
their papers by 0400 UTC, Tuesday, April 17, 2007. This is a hard
deadline—no extensions will be given. Final papers are due
on Tuesday, May 15, 2007, to be included in the workshop proceedings.
Simultaneous submission of the same work to multiple venues,
submission of previously published work, and plagiarism constitute
dishonesty or fraud. USENIX, like other scientific and technical
conferences and journals, prohibits these practices and may, on the
recommendation of a program chair, take action against authors who
have committed them. In some cases, program committees may share
information about submitted papers with other conference chairs and
journal editors to ensure the integrity of papers under
consideration. If a violation of these principles is found, sanctions
may include, but are not limited to, barring the authors from
submitting to or participating in USENIX conferences for a set period,
contacting the authors' institutions, and publicizing the details of
the case.
Authors uncertain whether their submission meets USENIX's guidelines
should contact the program chair at sruti07chair@usenix.org or the
USENIX office, submissionspolicy@usenix.org.
Accepted material may not be published in other conferences or
journals for one year from the date of acceptance by USENIX. Papers
accompanied by nondisclosure agreement forms will not be read or
reviewed. All submissions will be held in confidence prior to
publication of the technical program, both as a matter of policy and
in accordance with the U.S. Copyright Act of 1976.
How to Submit
Authors are required to submit papers by 0400 UTC, Tuesday, April 17,
2007. This is a hard deadline—no extensions will be given. All
submissions to SRUTI '07 must be electronic, in PDF or PostScript, via
this Web form.
Authors will be notified of acceptance decisions via email by
Saturday, May 5, 2007. If you do not receive notification by that
date, contact the program chair at sruti07chair@usenix.org.
|
Need help?
