S&P 2013 : IEEE Symposium on Security and Privacy
Call For Papers
Call For Papers
Since 1980, the IEEE Symposium on Security and Privacy has been the premier forum for computer security research, presenting the latest developments and bringing together researchers and practitioners.
The 34th IEEE Symposium on Security and Privacy will take place on May 19-22, 2013 at the Westin St. Francis Hotel, in San Francisco, CA, USA. We solicit previously unpublished papers offering novel research contributions in any aspect of computer security or privacy. Papers may present advances in the theory, design, implementation, analysis, verification, or empirical evaluation of secure systems.
Topics of interest include:
Access control Malware
Anonymity Language-based security
Application security Network security
Attacks and defenses Privacy-preserving systems
Authentication Protocol security
Censorship and censorship-resistance Secure information flow
Distributed systems security Security and privacy policies
Embedded systems security Security architectures
Forensics System security
Hardware security Usability andsecurity
Intrusion detection Web security
This topic list is not meant to be exhaustive; S&P is interested in all aspects of computer security and privacy. Papers without a clear application to security or privacy, however, will be considered out of scope and may be rejected without full review.
Systematization of Knowledge Papers
Following the success of the previous years' conferences, we are also soliciting papers focused on systematization of knowledge (SoK). The goal of this call is to encourage work that evaluates, systematizes, and contextualizes existing knowledge. These papers can provide a high value to our community but may not be accepted because of a lack of novel research contributions. Suitable papers include survey papers that provide useful perspectives on major research areas, papers that support or challenge long-held beliefs with compelling evidence, or papers that provide an extensive and realistic evaluation of competing approaches to solving specific problems. Submissions are encouraged to analyze the current research landscape: identify areas that have enjoyed much research attention, point out open areas with unsolved challenges, and present a prioritization that can guide researchers to make progress on solving important challenges. Submissions must be distinguished by a checkbox on the submission form. In addition, the paper title must have the prefix "SoK:". They will be reviewed by the full PC and held to the same standards as traditional research papers, except instead of emphasizing novel research contributions the emphasis will be on value to the community. Accepted papers will be presented at the symposium and included in the proceedings.
Research papers and SoK papers due: Wednesday, November 14, 2012
Acceptance notification: Monday, January 28, 2013
Final papers due: Monday, March 4, 2013
All deadlines are 23:59 EST (UTC-5).
Instructions for Paper Submission
These instructions apply to both the research papers and systematization of knowledge papers.
All submissions must be original work; the submitter must clearly document any overlap with previously published or simultaneously submitted papers from any of the authors. Failure to point out and explain overlap will be grounds for rejection. Simultaneous submission of the same paper to another venue with proceedings or a journal is not allowed and will be grounds for automatic rejection. Contact the program committee chairs if there are questions about this policy.
Anonymous Submission. Papers must be submitted in a form suitable for anonymous review: no author names or affiliations may appear on the title page, and papers should avoid revealing their identity in the text. When referring to your previous work, do so in the third person, as though it were written by someone else. Only blind the reference itself in the (unusual) case that a third-person reference is infeasible. Contact the program chairs if you have any questions. Papers that are not properly anonymized may be rejected without review.
Page Limit and Formatting. Papers must not exceed 15 pages total (including the references and appendices). Papers must be formatted for US letter (not A4) size paper with margins of at least 3/4 inch on all sides. The text must be formatted in a two-column layout, with columns no more than 9 in. high and 3.375 in. wide. The text must be in Times font, 10-point or larger, with 12-point or larger line spacing. Authors are encouraged to use the IEEE conference proceedings templates found at: http://www.computer.org/portal/web/cscps/formatting Failure to adhere to the page limit and formatting requirements will be grounds for rejection.
Submission. Submissions must be in Portable Document Format (.pdf). Authors should pay special attention to unusual fonts, images, and figures that might create problems for reviewers. Your document should render correctly in Adobe Reader 9 and when printed in black and white.
Conference Submission Server. Papers must be submitted using the submission site: https://oakland.gtisc.gatech.edu.
Submissions may be started now, and updated at any time until the submission deadline expires.
Publication and Presentation. Authors are responsible for obtaining appropriate publication clearances. One of the authors of the accepted paper is expected to present the paper at the conference. Submissions received after the submission deadline or failing to conform to the submission guidelines risk rejection without review.
For more information, contact the Program Co-Chairs at: email@example.com.
A continuing feature of the symposium is a session of 5-minute talks where attendees can present preliminary research results and new ideas. More information on work-in-progress talk submissions will be available on the conference website.
Program Committee Chairs:
Wenke Lee, Georgia Institute of Technology
Adrian Perrig, Carnegie Mellon University and ETH Zurich
Michael Backes, Saarland University and MPI-SWS
Program Committee Members:
Martin Abadi, UC Santa Cruz and Microsoft Research Matteo Maffei, Saarland University
Michael Bailey, University of Michigan Z. Morley Mao, University of Michigan
Herbert Bos, Vrije Universiteit Amsterdam Jonathan McCune, Carnegie Mellon University
Lujo Bauer, Carnegie Mellon University Patrick McDaniel, Pennsylvania State University
David Brumley, Carnegie Mellon University John Mitchell, Stanford University
Juan Caballero, IMDEA Software Institute Arvind Narayanan, Princeton University
Srdjan Capkun, ETH Zurich Peng Ning, North Carolina State University
Shuo Chen, Microsoft Research Cristina Nita-Rotaru, Purdue University
Yan Chen, Northwestern University Bryan Parno, Microsoft Research
Weidong Cui, Microsoft Research Roberto Perdisci, University of Georgia
Robert Cunningham, MIT Lincoln Laboratory Niels Provos, Google
George Danezis, Microsoft Research Thomas Ristenpart, University of Wisconsin
Anupam Datta, Carnegie Mellon University William Robertson, Northeastern University
William Enck, North Carolina State University Ahmad-Reza Sadeghi, Technical University of Darmstadt
David Evans, University of Virginia David Sands, Chalmers University of Technology
Nick Feamster, University of Maryland R. Sekar, Stony Brook University
Debin Gao, Singapore Management University Simha Sethumadhavan, Columbia University
Deepak Garg, MPI-SWS Kapil Singh, IBM Research
Virgil Gligor, Carnegie Mellon University Radu Sion, Stony Brook University
Guofei Gu, Texas A&M University Robin Sommer, ICSI/LBNL
Thorsten Holz, Ruhr-University Bochum Paul Syverson, Naval Research Labs
Seny Kamara, Microsoft Research Patrick Traynor, Georgia Institute of Technology
Yongdae Kim, KAIST Venkat Venkatakrishnan, University of Illinois, Chicago
Engin Kirda, Northeastern University Giovanni Vigna, UC Santa Barbara
Christopher Kruegel, UC Santa Barbara Helen Wang, Microsoft Research
Ruby Lee, Princeton University Xiaofeng Wang, Indiana University
Ninghui Li, Purdue University Yinglian Xie, Microsoft Research
Ben Livshits, Microsoft Research Wei Zou, Peking University
John Lui, Chinese University of Hong Kong