The Perpetual Object of Regulation: Privacy As Pacification

This article theorizes the relationship of privacy to capital and projects of security and, in doing so, situates privacy in context to pacification. In particular, the article provides an interrogation of the contradictory structuring of privacy as both an object threatened by security and the role of privacy as a means to resist or limit projects of security. Through an analysis of Thomas Hobbes’ writings, this contradictory dual-deployment of privacy is unseated to reveal that far from challenging security, privacy has historically been presupposed and structured by security projects. Moreover, by acclimatizing us to our existence as atomized individuals, alienated from our collective social power, privacy in fact pacifies us. This process is explored through an examination of the Passenger Flight List agreement (PNR) between the United States and EU member states. The article concludes with a brief discussion of the implications of our reliance on privacy has for challenging the logics of security and pacification, especially with the emergent technology of Drones

Internet of Things and its enhanced data security

The Internet of Things (IoT), an emerging global Internet-based technical architecture facilitating the exchange of information, goods and services in the internet world has an impact on the security and privacy of the involved stakeholders. Measures ensuring the architectures resilience to attacks, data authentication, and access control and client privacy need to be established. This paper includes a survey of IoT and various security issues related to it. Furthermore, out of all security issues, concern over data authentication and transfer is taken into consideration. Here we will discuss the idea for two levels of security in form of two different approaches i.e. Advance Encryption Standards (AES) and the Steganography approach via an image and the simulating of these two logics in the MATLAB

Privacy Architectures: Reasoning About Data Minimisation and Integrity

Privacy by design will become a legal obligation in the European Community if the Data Protection Regulation eventually gets adopted. However, taking into account privacy requirements in the design of a system is a challenging task. We propose an approach based on the specification of privacy architectures and focus on a key aspect of privacy, data minimisation, and its tension with integrity requirements. We illustrate our formal framework through a smart metering case study.Comment: appears in STM - 10th International Workshop on Security and Trust Management 8743 (2014

PriCL: Creating a Precedent A Framework for Reasoning about Privacy Case Law

We introduce PriCL: the first framework for expressing and automatically reasoning about privacy case law by means of precedent. PriCL is parametric in an underlying logic for expressing world properties, and provides support for court decisions, their justification, the circumstances in which the justification applies as well as court hierarchies. Moreover, the framework offers a tight connection between privacy case law and the notion of norms that underlies existing rule-based privacy research. In terms of automation, we identify the major reasoning tasks for privacy cases such as deducing legal permissions or extracting norms. For solving these tasks, we provide generic algorithms that have particularly efficient realizations within an expressive underlying logic. Finally, we derive a definition of deducibility based on legal concepts and subsequently propose an equivalent characterization in terms of logic satisfiability.Comment: Extended versio

A Temporal Logic for Hyperproperties

Hyperproperties, as introduced by Clarkson and Schneider, characterize the correctness of a computer program as a condition on its set of computation paths. Standard temporal logics can only refer to a single path at a time, and therefore cannot express many hyperproperties of interest, including noninterference and other important properties in security and coding theory. In this paper, we investigate an extension of temporal logic with explicit path variables. We show that the quantification over paths naturally subsumes other extensions of temporal logic with operators for information flow and knowledge. The model checking problem for temporal logic with path quantification is decidable. For alternation depth 1, the complexity is PSPACE in the length of the formula and NLOGSPACE in the size of the system, as for linear-time temporal logic

Belief Semantics of Authorization Logic

Authorization logics have been used in the theory of computer security to reason about access control decisions. In this work, a formal belief semantics for authorization logics is given. The belief semantics is proved to subsume a standard Kripke semantics. The belief semantics yields a direct representation of principals' beliefs, without resorting to the technical machinery used in Kripke semantics. A proof system is given for the logic; that system is proved sound with respect to the belief and Kripke semantics. The soundness proof for the belief semantics, and for a variant of the Kripke semantics, is mechanized in Coq