• Jan 17, 2006 WeH 4625
  A DoS-limiting Network Architecture. by Xiaowei Yang, David Wetherall, Tom Anderson In SIGCOMM 2005 (Suggested by Jason) pdf
  Presenter: David Brumley
• Jan 24, 2006 WeH 4625
  Protocol-Independent Adaptive Replay of Application Dialog. by Weidong Cui, Vern Paxson, Nicholas C. Weaver, and Randy H. Katz. to appear, Proc. NDSS 2006. pdf
  Presenter: Jason Franklin
• Jan 31, 2006 NSH 3001
  Off by Default! by Hitesh Ballani, Yatin Chawathe, Sylvia Ratnasamy, Timothy Roscoe, and Scott Shenker in ACM Hotnets IV pdf
  DoS: Fighting Fire with Fire Michael Walfish, Hari Balakrishnan, David Karger, and Scott Shenker pdf
  Presenter: Vyas Sekar
• Feb 7, 2006 NsH 3001
  Compact E-Cash. by Jan Camenisch, Susan Hohenberger, and Anna Lysyanskaya. in EuroCrypt 2005 (suggested by John Bethencourt) E-Print
  Presenter: John Bethencourt
  Slides: pdf, source (opendocument)
• Feb 14, 2006 NsH 3001 (note room change)
  Scalability, Fidelity and Containment in the Potemkin Virtual Honeyfarm. by Michael Vrable, Justin Ma, Jay chen, David Moore, Erik Vandekieft, Alex C. Snoeren, Geoffrey M. Voelker and Stefan Savage in SOSP 2005. pdf
  Presenter: Jon McCune
• Feb 21, 2006 WeH 4625
  Automated Generate and Analysis of Attack Graphs. by O. Sheyner, J. Haines, S. Jha, R. Lippmann, and J. M. Wing in IEEE Security & Privacy, 2002 (suggested by Pratyusa) pdf
  Presenter: Pratyusa Manadhata.
• Feb 28, 2006 NSH 3001 WE WILL BEGIN AT 4:30 DUE TO ANOTHER TALK
  Profiling Internet Backbone Traffic: Behavior Models and Applications by Kuai Xu and Zhi-Li Zhang and Supratik Bhattacharyya in SIGCOMM 2005. pdf
  Presented by Shobha Venkataraman.
• March 7, 2006 WeH 4625
  Intro to Bilinear Maps.
  Presenter: John Bethencourt
  Slides: pdf, source (latex)
• March 14, 2006 - Spring Break
• March 21, 2006 - CANCELLED!
• March 28, 2006 NSH 3001
  Efficient Collision Search Attacks on SHA-0. by Xiaoyun Wang, Hongbo Yu, and Yiqun Lisa Yin in Crypto 2004 (suggested by Bryan Parno) pdf and
  Finding Collisions in the Full SHA-1. by Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu. in Crypto 2004 (suggested by Bryan Parno) pdf
  Presenter: Bryan Parno Slides
• April 4, 2006 WeH 4625
  Cancelled
• April 11, 2006 WeH 4625
  Introduction to Weakest Precondition via Two Applications. by David Brumley.
• April 18, 2006 WeH 4625
  
• April 25, 2006 NsH 3001
  
• May 2, 2006 WeH 4625
  

About SRG

The group is informal, consisting of people interested in security coming together to further understand the field. The main point of SRG is to stay abreast with the latest developments in security. The security reading group is a group of people interested in:

• Network security
• Software security
• Cryptography

Meeting Format

SRG meetings begin with a paper roundup session. Attendees are encouraged to say a few words (e.g., < 2 minutes) about the most interesting paper they have read in the proceeding week. We also use this time to go through the list of papers at a recent conference, giving an overview of what was accepted. This portion of the meeting is intended to give the "bird's eye" view of what is out there.

We then present at least one paper. Everyone attending the meeting should read the paper. If you haven't read it, you are unlikely to get much value out of attending. However, we don't expect everyone to fully understand each paper or be an expert in each topic. This portion of the meeting is inteded to provide depth into an interesting paper.

We encourage researchers of all abilities to attend, from undergrads to faculty. We encourage people to ask questions, even those that may seem "stupid", as they often lead to interesting discussions and insights. Example discussion and questions may include:

• What exactly is the problem solved? Often it is hard to understand exactly what problem is really being solved by the solution. An intro may have very general statements about a very vague problem, while the solution has many assumptions built in.
• Was the problem solved well? Some security papers have quite a bit of "fluff" attached to them that may obscure how well the solution works.
• Is the problem interesting? Is the problem wide-spread? Is this a specific instance of a more general problem? Was this a LPU - least publishable unit?
• Do you buy the solution? Do you think in reality the solution won't work, is too expensive, etc..
• What improvements can be made.
• What paper/advancement would you expect to be made next in this area.

Mailing Lists

We maintain an Andrew mailing list called "srg-list" (note the -list is necessary because Andrew is stupid). You can subscribe/unsubscribe/view archives via the SRG mailman site.

The email address is srg-list@lists.andrew.cmu.edu. E-mail to the list and archives is restricted to CMU accounts.

To subscribe, send email to the "srg-list-join" on lists.andrew.cmu.edu.

Note: A very good alternate location to look is maintained by Tao Xie

Conference Schedules

Note this is sorted by the next submission date.

Conference	Next Submission Date	Next Conference Date
NDSS	Sep 10, 2006	Feb 28 - Mar 2, 2007
POPL	Oct 2006	Jan 17 - 19, 2007
PLDI	Oct 2006	Jun 1, 2007
IEEE Security & Privacy (Oakland)	Nov 2006	May 21 - 24, 2006
Eurocrypt	Nov 2006	May 28 - June 1, 2006
Usenix Security	Feb 2007	Jul 31 - Aug 4, 2006
Crypto	Feb 2007	Aug 20 - 24, 2006
CCS	May 2007	Oct 20 - Nov 3, 2006

Archives

Nothing here yet. We'll update this section with the list of old papers we've read.