Physical Sciences and Mathematics Commons^™

A Look Into User Privacy And Third-Party Applications In Facebook, Sovantharith Seng, Mahdi Nasrullah Al-Ameen, Matthew Wright

Computer Science Faculty and Staff Publications

Purpose

A huge amount of personal and sensitive data are shared on Facebook, which makes it a prime target for attackers. Adversaries can exploit third-party applications connected to a user’s Facebook profiles (i.e. Facebook apps) to gain access to this personal information. Users’ lack of knowledge and the varying privacy policies of these apps make them further vulnerable to information leakage. However, little has been done to identify mismatches between users’ perceptions and the privacy policies of Facebook apps. This paper aims to address this challenge in the work.

Design/methodology/approach

The authors conducted a lab study with 31 participants, where …

A First Look Into Users’ Perceptions Of Facial Recognition In The Physical World, Sovantharith Seng, Mahdi Nasrullah Al-Ameen, Matthew Wright

Computer Science Faculty and Staff Publications

Facial recognition (FR) technology is being adopted in both private and public spheres for a wide range of reasons, from ensuring physical safety to providing personalized shopping experiences. It is not clear yet, though, how users perceive this emerging technology in terms of usefulness, risks, and comfort. We begin to address these questions in this paper. In particular, we conducted a vignette-based study with 314 participants on Amazon Mechanical Turk to investigate their perceptions of facial recognition in the physical world, based on thirty-five scenarios across eight different contexts of FR use. We found that users do not have a …

An Optimal Deterministic Algorithm For Geodesic Farthest-Point Voronoi Diagrams In Simple Polygons, Haitao Wang

Computer Science Faculty and Staff Publications

Given a set S of m point sites in a simple polygon P of n vertices, we consider the problem of computing the geodesic farthest-point Voronoi diagram for S in P. It is known that the problem has an Ω(n + m log m) time lower bound. Previously, a randomized algorithm was proposed [Barba, SoCG 2019] that can solve the problem in O(n + m log m) expected time. The previous best deterministic algorithms solve the problem in O(n log log n + m log m) time [Oh, Barba, and Ahn, …