PriCom 2019

The 5th International Symposium on Privacy Computing

19-21 August 2019, University of Kent, Canterbury, UK

How to Submit

Submissions must include an abstract, a list of keywords, the e-mail address of the corresponding author and should not exceed 8 pages, including tables and figures in the IEEE CS format. All paper submissions must represent original and unpublished work. Each submission will be peer reviewed by at least three program committee members. Submission of a paper should be regarded as an undertaking that, should the paper be accepted, at least one of the authors will register for the conference and present the work.

To submit your paper, please follow this link:

Topics of Interest

Topics of particular interest include, but are not limited to:

  • Theories and foundations for privacy computing
  • Programming languages and compilers for privacy computing
  • Privacy computing models
  • Privacy quantification, formal description
  • Privacy information engineering, providers, collectors, and users
  • Privacy operation and modelling
  • Data utility and privacy loss
  • Context-adaptive cryptography for privacy protection
  • Privacy protection based information hiding and sharing
  • Data analytics oriented privacy control and protection
  • Privacy-aware information collection
  • Privacy sensing and distribution
  • Combined and comprehensive privacy protection
  • Privacy preserving data publishing
  • Private information storage
  • Private integration and synergy
  • Private information exchange and sharing
  • Privacy inference and reasoning
  • Privacy in cloud
  • Privacy in online social networks
  • Privacy in IoT and industrial Internet
  • Privacy and AI
  • Privacy and blockchain
  • Legal issues in privacy computing and other interdisciplinary topics

Post-Conference Journal Special Issue

We plan to organise a special issue at an established journal in the field of cyber security, for selected papers presented at the conference. More details will be announced here later.