GameSec 2012

Conference on Decision and Game Theory for Security

November 5-6, 2012, Budapest, Hungary

Paper Submission

Submission page:

Submission instructions
Prospective authors are encouraged to submit a PDF version of their papers adhering to the Springer Lecture Notes in Computer Science (LNCS) format. Each submission should be previously unpublished work that is not currently under submission to another conference. Submissions can be (but do not have to be) anonymized. Full paper submissions are not to exceed 20 pages including references and well-formatted appendices. Full papers should make a strong technical contribution and adequately highlight the novel aspects of the work in relation to related research. Short paper submissions may present work in progress, novel applications and practice/industry experiences. Potential short papers will be evaluated based on their novelty and potential for sparking discussions and future collaborations. Short paper submissions are limited to 10 pages.

GameSec 2012 Proceedings

The conference proceedings published by Springer as part of LNCS series are available here!

List of Accepted Full Papers

  • Where to Hide the Bits?
    Benjamin Johnson, Pascal Schöttle and Rainer Böhme.
  • Socio-Rational Secret Sharing as a New Direction in Rational Cryptography
    Mehrdad Nojoumian and Douglas Stinson.
  • Audit Mechanisms for Provable Risk Management and Accountable Data Governance
    Jeremiah Blocki, Nicolas Christin, Anupam Datta and Arunesh Sinha.
  • A Game Theoretical Analysis of Lemonizing Cybercriminal Black Markets
    Celine Hoe, Murat Kantarcioglu and Alain Bensoussan.
  • Computing the Nash Equilibria of Intruder Classification Games
    Lemonia Dritsoula, Patrick Loiseau and John Musacchio.
  • Upper Bounds for Adversaries' Utility in Attack Trees
    Ahto Buldas and Roman Stepanenko.
  • Using Signaling Games to Model the Multi-Step Attack-Defense Scenarios on Confidentiality
    Jingqiang Lin, Peng Liu and Jiwu Jing.
  • Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality
    Áron Lászka, Dávid Szeszlér and Levente Buttyán.
  • Game Theoretic Model of Strategic Honeypot Selection in Computer Networks
    Radek Pibil, Viliam Lisy, Christopher Kiekintveld, Branislav Bosansky and Michal Pechoucek.
  • Incentives and security in electric distribution networks
    Saurabh Amin, Galina Schwartz and Hamidou Tembine.

List of Accepted Short Papers

  • Simulation and Game-Theoretic Analysis of an Attacker-Defender Game
    Alan Nochenson and C. F. Larry Heimann.
  • Deceptive Routing in Relay Networks
    Andrew Clark, Quanyan Zhu, Radha Poovendran and Tamer Basar.
  • A Game-Theoretic Framework for Network Security Vulnerability Assessment and Mitigation
    Assane Gueye and Vladimir Marbukh.
  • Are We Compromised? Modelling Security Assessment Games
    Viet Pham and Carlos Cid.
  • Defending Against the Unknown Enemy: Applying FlipIt to System Security
    Kevin Bowers, Marten van Dijk, Robert Griffin, Ari Juels, Alina Oprea, Ronald Rivest and Nikos Triandopoulos
  • A Cost-Based Mechanism for Evaluating the Effectiveness of Moving Target Defenses
    Michael Collins.
  • Security Games and Risk Minimization for Automatic Generation Control in Smart Grid
    Yee Wei Law, Tansu Alpcan, Marimuthu Palaniswami and Subhrakanti Dey.
  • Contractual Agreement Design for Enforcing Honesty in Cloud Outsourcing
    Robert Nix and Murat Kantarcioglu.

List of Accepted Posters

  • Guessing Games: Evaluating the Security of a Password Management Scheme
    Jeremiah Blocki, Manuel Blum and Anupam Datta (Carnegie Mellon University, USA).
  • A Game Inspired Defense Architecture
    Harkeerat Bedi, Sajjan Shiva, Chris Simmons, Vivek Shandilya (University of Memphis, USA).
  • Towards a Resilience Index for Social Networks Under Evacuation
    Francesco Ciardiello (University of Sheffield), Jane Binner (University of Sheffield) and Vincent Schmidt (Air Force Research Laboratory, USA).
  • Nonzero-Sum Stochastic Games for Security in Networks with Interdependent Nodes
    Kien Nguyen (Bloomberg, USA), Hamidou Tembine (Supélec, France), Tansu Alpcan (University of Melbourne, Australia) and Tamer Basar (University of Illinois at Urbana-Champaign, USA).
  • Analysis of strategic stakeholder interactions in cloud-based mobile app use by privacy-sensitive end users
    Kalliopi Anastasopoulou (University of the Aegean, Greece), Theo Tryfonas (University of Bristol, UK) and Spyros Kokolakis (University of the Aegean, Greece).
  • Incentive Mechanisms for Secure Smartphone Collaboration
    Kohei Sugiyama (KDDI R&D Laboratories, Japan), Takeshi Kubo (KDDI R&D Laboratories, Japan), Lingjie Duan (Singapore University of Technology and Design, Singapore), Atsushi Tagami (KDDI R&D Laboratories, Japan), Teruyuki Hasegawa (KDDI R&D Laboratories, Japan) and Jianwei Huang (Chinese University of Hong Kong, China) .
  • Near-Optimal Node Blacklisting in Adversarial Networks
    Christos Dimitrakakis (École Polytechnique Fédérale de Lausanne, Switzerland) and Aikaterini Mitrokotsa (École Polytechnique Fédérale de Lausanne, Switzerland).
  • On some Distributed Disorder Detection
    Krzysztof Szajowski (Wroclaw University of Technology).