Stanford Security Seminar

• Thursday, August 28, 2014, 4:15pm
  Anupam Datta
  Privacy through Accountability: The Case of Web Advertising
• Tuesday, August 26, 2014, 4:15pm
  Moni Naor
  Primary-Secondary-Resolvers Membership Proof Systems and their Applications to DNSSEC
• Friday, August 8, 2014, 4:15pm
  Elaine Shi
  Circuit ORAM and Secure Computation for Big Data
• Tuesday, July 8, 2014, 4:15pm
  Muhammad Naveed
  Dynamic Searchable Encryption via Blind Storage
• Wednesday, June 4, 2014, 4:15pm
  Vasilis Pappas
  Defending against Return-Oriented Programming
• Wednesday, May 28, 2014, 4:15pm
  Omar Choudary
  Chip and Skim: cloning EMV cards with the pre-play attack
• Friday, May 23, 2014, 3:30pm
  Thomas Ristenpart
  Honey Encryption: Beyond the Brute-force Barrier
• Wednesday, April 9, 2014, 4:15pm
  Leo Ducas
  The Versatility of Discrete Gaussians over Lattices
• Wednesday, April 2, 2014, 4:15pm
  Trevor Perrin
  End-to-end secure messaging: New projects and techniques
• Tuesday, March 25, 2014, 4:15pm
  Alessandro Chiesa
  Succinct Non-Interactive Zero-Knowledge
• Thursday, March 6, 2014, 4:15pm
  Ranjit Kumaresan
  How to Use Bitcoin to Design Fair Protocols
• Friday, February 28, 2014, 3:30pm
  Hoeteck Wee
  Dual System Encryption via Predicate Encodings
• Tuesday, February 18, 2014, 4:15pm
  Elette Boyle
  On Extractability (aka Differing-Inputs) Obfuscation
• Tuesday, January 28, 2014, 4:15pm
  Juan Garay
  Rational Protocol Design: Cryptographic Security Against Incentive-driven Attacks
• Tuesday, January 21, 2014, 4:15pm
  Emil Stefanov
  When Encrypting Cloud Storage is not Enough: Concealing Access Patterns for Privacy
• Tuesday, December 17, 2013, 4:15pm
  Elaine Shi
  Practical Oblivious Computation: From Theory to Hardware to Compiler
• Tuesday, December 3, 2013, 4:30pm
  Mohammad Hajiabadi
  How encryption with standard security copes under stronger forms of attack, with applications to computational soundness
• Wednesday, October 23, 2013, 4:30pm
  Mariana Raykova
  Succinct NIZKs from Quadratic Span Programs (QSPs) and Quadratic Arithmetic Programs (QAPs), and Pinocchio - a system for nearly practical verifiable computation
• Wednesday, October 2, 2013, 4:15pm
  Nathan Keller
  Minimalism in Cryptography - On the security of the Even-Mansour cryptosystem and its iterates
• Tuesday, September 24, 2013, 4:30pm
  Ranjit Kumaresan
  On the Cryptographic Complexity of the Worst Functions

The seminar is currently coordinated by Joe Zimmerman (jzim at cs dot stanford).