Specification of Evolving Privacy Policies for Online Social Networks

Pardo, Raúl; Sanchez, Ivana Kellyerova Cesar; Schneider, Gerardo

doi:10.1109/time.2016.15

Cited by 4 publications

(16 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some initial work has been recently done on the specification side with a proof of concept implementation. The work in [263,264] presents an approach based on extending a privacy language with real-time, while [262] proposes a combination of static privacy policy language with automata. However, a general working solution to this challenge is still missing.…”

Section: Challengesmentioning

confidence: 99%

A survey of challenges for runtime verification from advanced application domains (beyond software)

Sánchez

Schneider

Ahrendt

et al. 2019

Form Methods Syst Des

Self Cite

View full text Add to dashboard Cite

Runtime verification is an area of formal methods that studies the dynamic analysis of execution traces against formal specifications. Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors. Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor.Most of the applications in runtime verification have been focused on the dynamic analysis of software, even though there are many more potential applications to other computational devices and target systems. In this paper we present a collection of challenges for runtime verification extracted from concrete application domains, focusing on the difficulties that must be overcome to tackle these specific challenges. The computational models that characterize these domains require to devise new techniques beyond the current state of the art in runtime verification.

show abstract

Section: Challengesmentioning

confidence: 99%

A survey of challenges for runtime verification from advanced application domains (beyond software)

Sánchez

Schneider

Ahrendt

et al. 2019

Form Methods Syst Des

Self Cite

View full text Add to dashboard Cite

show abstract

“…We introduce a formal privacy policy framework for OSNs where properties regarding users knowledge and beliefs as well as time can be expressed. Our framework extends the framework in [21], in which temporal properties were expressed using temporal operators ✷ and ✸. Our solution allows to describing properties at concrete moments in time.…”

Section: A Timed Privacy Policy Frameworkmentioning

confidence: 99%

“…We will use F K B L RT to denote the set of all well-formed KBL R T formulae. The syntax introduces the following novel notions that have not been considered in other formal privacy policies languages such as [8,11,18,21].…”

Section: Terms Of the Elements Of T Can Be Built As Smentioning

confidence: 99%

“…Moreover, in our models we include a knowledge base for each agent, and the set of privacy policies that they have activated. We reuse the models defined for the previous version of this framework [21]. Nevertheless, the expressiveness of the privacy policies that can be enforced in PPF R T have substantially increased (see Section 4).…”

Section: 21mentioning

confidence: 99%

“…Note that the previous policy only requires to activate the static policy "only my friends can see my pictures" during weekends. Though quite expressive, a major restriction of the logic in [21] is that it does not have time, so one cannot express different instants at which an event happens and when knowledge is acquired. Moreover, the logic only includes a knowledge modality thus implicitly assuming that the information that users are told is true.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Timed Epistemic Knowledge Bases for Social Networks

2018

Self Cite

View full text Add to dashboard Cite

We present an epistemic logic equipped with time-stamps in the atoms and epistemic operators, which allows to reason not only about information available to the different agents, but also about the moments at which events happen and new knowledge is acquired or deduced. Our logic includes both an epistemic operator and a belief operator, which allows to model the disclosure of information that may not be accurate.Our main motivation is to model rich privacy policies in online social networks. Online Social Networks (OSNs) are increasingly used for social interactions in the modern digital era, which bring new challenges and concerns in terms of privacy. Most social networks today offer very limited mechanisms to express the desires of users in terms of how information that affects their privacy is shared. In particular, most current privacy policy formalisms allow only static policies, which are not rich enough to express timed properties like "my location after work should not be disclosed to my boss". The logic we present in this paper enables to express rich properties and policies in terms of the knowledge available to the different users and the precise time of actions and deductions. Our framework can be instantiated for different OSNs, by specifying the effect of the actions in the evolution of the social network and in the knowledge disclosed to each agent.We present an algorithm for deducing knowledge, which can also be instantiated with different variants of how the epistemic information is preserved through time. Our algorithm allows to model not only social networks with eternal information but also networks with ephemeral disclosures. Policies are modelled as formulae in the logic, which are interpreted over timed traces representing the evolution of the social network. Alice picture 0 (Bob, pub) K 0 Alice B 0 Alice loc 0 (Bob, pub)

show abstract

Secure Photo Sharing in Social Networks

Picazo-Sanchez

Pardo

Schneider

2017

ICT Systems Security and Privacy Protection

Self Cite

View full text Add to dashboard Cite

Nowadays, in an ubiquitous world where everything is connected to the Internet and where social networks play an important role in our lives, security and privacy is a must. Billions of pictures are uploaded daily to social networks and, with them, parts of our private life are disclosed. In this work, we propose a practical solution for secure photo sharing on social network with independence of its architecture which can be either centralised or distributed. This solution solves the inconsistencies that appear in distributed social network as a consequence of treating photos and access policies separately. Specifically, we solve this open problem by attaching an access policy to the images and thus, each time a photo is re-shared, the access policy will travel together with the image.

show abstract

Specification of Evolving Privacy Policies for Online Social Networks

Cited by 4 publications

References 9 publications

A survey of challenges for runtime verification from advanced application domains (beyond software)

A survey of challenges for runtime verification from advanced application domains (beyond software)

Timed Epistemic Knowledge Bases for Social Networks

Secure Photo Sharing in Social Networks

Contact Info

Product

Resources

About