Anna Squicciarini

Anna Squicciarini

Auto-generated profile, based on publicly available information

Anna Squicciarini

Pennsylvania State University

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 July 2016 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
DLDan Lin
Dan Lin
JKJian Kang
Jian Kang
ASAnna Squicciarini
Anna Squicciarini
YWYingjie Wu
Yingjie Wu
SGSashi Gurung
Sashi Gurung
OTOzan Tonguz
Ozan Tonguz
Vehicular Ad-hoc Networks (VANETs) are an emerging field, whereby vehicle-to-vehicle communications can enable many new applications such as safety and entertainment services. Most VANET applications are enabled by different routing protocols. The design of such routing protocols, however, is quite challenging due to the dynamic nature of nodes (vehicles) in VANETs. To exploit the unique characteristics of VANET nodes, we design a moving-zone based architecture in which vehicles collaborate with one another to form dynamic moving zones so as to facilitate information dissemination. We propose a novel approach that introduces moving object modeling and indexing techniques from the theory of large moving object databases into the design of VANET routing protocols. The results of extensive simulation studies carried out on real road maps demonstrate the superiority of our approach compared with both clustering and non-clustering based routing protocols.

2 August 2004 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
EBE. Bertino
E. Bertino
EFE. Ferrari
E. Ferrari
ASA.C. Squicciarini
A.C. Squicciarini
We present Trust-/spl Xscr/;, a comprehensive XML-based framework for trust negotiations, specifically conceived for a peer-to-peer environment. Trust negotiation is a promising approach for establishing trust in open systems like the Internet, where sensitive interactions may often occur between entities at first contact, with no prior knowledge of each other. The framework we propose takes into account all aspects related to negotiations, from the specification of the profiles and policies of the involved parties to the selection of the best strategy to succeed in the negotiation. Trust-/spl Xscr/; presents a number of innovative features, such as the support for protection of sensitive policies, the use of trust tickets to speed up the negotiation, and the support of different strategies to carry on a negotiation. In this paper, besides presenting the language to encode security information, we present the system architecture and algorithms according to which negotiations take place.

20 April 2009
Verified
Conference Paper
Open access
PDF file
ASAnna Cinzia Squicciarini
Anna Cinzia Squicciarini
MSMohamed Shehab
Mohamed Shehab
FPFederica Paci
Federica Paci
Social Networking is one of the major technological phenomena of the Web 2.0, with hundreds of millions of people participating. Social networks enable a form of self expression for users, and help them to socialize and share content with other users. In spite of the fact that content sharing represents one of the prominent features of existing Social Network sites, Social Networks yet do not support any mechanism for collaborative management of privacy settings for shared content. In this paper, we model the problem of collaborative enforcement of privacy policies on shared data by using game theory. In particular, we propose a solution that offers automated ways to share images based on an extended notion of content ownership. Building upon the Clarke-Tax mechanism, we describe a simple mechanism that promotes truthfulness, and that rewards users who promote co-ownership. We integrate our design with inference techniques that free the users from the burden of manually selecting privacy preferences for each picture. To the best of our knowledge this is the first time such a protection mechanism for Social Networking has been proposed. In the paper, we also show a proof-of-concept application, which we implemented in the context of Facebook, one of today's most popular social networks. We show that supporting these type of solutions is not also feasible, but can be implemented through a minimal increase in overhead to end-users.

6 March 2012 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
SSSmitha Sundareswaran
Smitha Sundareswaran
ASAnna Squicciarini
Anna Squicciarini
DLDan Lin
Dan Lin
Cloud computing enables highly scalable services to be easily consumed over the Internet on an as-needed basis. A major feature of the cloud services is that users' data are usually processed remotely in unknown machines that users do not own or operate. While enjoying the convenience brought by this new emerging technology, users' fears of losing control of their own data (particularly, financial and health data) can become a significant barrier to the wide adoption of cloud services. To address this problem, in this paper, we propose a novel highly decentralized information accountability framework to keep track of the actual usage of the users' data in the cloud. In particular, we propose an object-centered approach that enables enclosing our logging mechanism together with users' data and policies. We leverage the JAR programmable capabilities to both create a dynamic and traveling object, and to ensure that any access to users' data will trigger authentication and automated logging local to the JARs. To strengthen user's control, we also provide distributed auditing mechanisms. We provide extensive experimental studies that demonstrate the efficiency and effectiveness of the proposed approaches.

1 June 2012
Verified
Conference Paper
Closed access
SSSmitha Sundareswaran
Smitha Sundareswaran
ASAnna Squicciarini
Anna Squicciarini
DLDan Lin
Dan Lin
The expanding Cloud computing services offer great opportunities for consumers to find the best service and best pricing, which however raises new challenges on how to select the best service out of the huge pool. It is time-consuming for consumers to collect the necessary information and analyze all service providers to make the decision. This is also a highly demanding task from a computational perspective, because the same computations may be conducted repeatedly by multiple consumers who have similar requirements. Therefore, in this paper, we propose a novel brokerage-based architecture in the Cloud, where the Cloud brokers is responsible for the service selection. In particular, we design a unique indexing technique for managing the information of a large number of Cloud service providers. We then develop efficient service selection algorithms that rank potential service providers and aggregate them if necessary. We prove the efficiency and effectiveness of our approach through an experimental study with the real and synthetic Cloud data.

23 July 2007 in Journal of Computer Security
Verified
Journal Article
Closed access
PDF file
ABAbhilasha Bhargav-Spantzel
Abhilasha Bhargav-Spantzel
ASAnna C. Squicciarini
Anna C. Squicciarini
SMShimon Modi
Shimon Modi
MYMatthew Young
Matthew Young
EBElisa Bertino
Elisa Bertino
SEStephen J. Elliott
Stephen J. Elliott
An emerging approach to the problem of identity theft is represented by the adoption of biometric authentication systems. Such systems however present several challenges, related to privacy, reliability and security of the biometric data. Inter-opera