43 research outputs found
Dealing with Dimensionality: Problems and Techniques in High-Dimensional Statistics
In modern data analysis, problems involving high dimensional data with more variables than subjects is increasingly common. Two such cases are mediation analysis and distributed optimization. In Chapter 2 we start with an overview of high dimensional statistics and mediation analysis. In Chapter 3 we motivate and prove properties for a new marginal screening procedure for performing high dimensional mediation analysis. This screening procedure is shown via simulation to perform better than benchmark approaches and is applied to a DNA methylation study. In Chapter 4 we construct a cryptosystem that accurately performs distributed penalized quantile regression in the high-dimensional setting using a divide-and-conquer approach while preserving the privacy of subject data
Security, Comfort, Healthcare, and Energy Saving: A Review on Biometric Factors for Smart Home Environment
The Internet of Things (IoT) have become significantly important in authentication mechanisms in which traditional authentication have shift to the biometric factors whereby biometric is said to offer more security and convenience to the users.The purpose of this paper is to provide an extensive review on biometric factors for smart home environments that are intended for security, comfort, healthcare, and energy saving.This paper also discusses the security authentication mechanisms, which are knowledge factor (password, PIN), ownership factor (ID card, passport), and inherent factor (fingerprint, iris, facial), known as biometric factors.Biometric factors can be used as authentications for smart home environments, which are more robust and reliable in terms of accuracy, convenience, and speed
Recommended from our members
Toward practical and private online services
Today's common online services (social networks, media streaming, messaging,
email, etc.) bring convenience. However, these services are susceptible to
privacy leaks. Certainly, email snooping by rogue employees, email server
hacks, and accidental disclosures of user ratings for movies are some
sources of private information leakage. This dissertation investigates the
following question: Can we build systems that (a) provide strong privacy
guarantees to the users, (b) are consistent with existing commercial and policy
regimes, and (c) are affordable?
Satisfying all three requirements simultaneously is challenging, as providing
strong privacy guarantees usually necessitates either sacrificing functionality,
incurring high resource costs, or both. Indeed, there are powerful cryptographic
protocols---private information retrieval (PIR), and secure two-party
computation (2PC)---that provide strong guarantees but are orders of magnitude
more expensive than their non-private counterparts. This dissertation takes
these protocols as a starting point and then substantially reduces their costs
by tailoring them using application-specific properties. It presents two
systems, Popcorn and Pretzel, built on this design ethos.
Popcorn is a Netflix-like media delivery system, that provably hides, even from
the content distributor (for example, Netflix), which movie a user is watching.
Popcorn tailors PIR protocols to the media domain. It amortizes the server-side
overhead of PIR by batching requests from the large number of concurrent users
retrieving content at any given time; and, it forms large batches without
introducing playback delays by leveraging the properties of media streaming.
Popcorn is consistent with the prevailing commercial regime (copyrights, etc.),
and its per-request dollar cost is 3.87 times that of a non-private system.
The other system described in this dissertation, Pretzel, is an email system
that encrypts emails end-to-end between senders and intended recipients, but
allows the email service provider to perform content-based spam filtering and
targeted advertising. Pretzel refines a 2PC protocol. It reduces the resource
consumption of the protocol by replacing the underlying encryption scheme with a
more efficient one, applying a packing technique to conserve invocations of the
encryption algorithm, and pruning the inputs to the protocol. Pretzel's costs,
versus a legacy non-private implementation, are estimated to be up to 5.4 times
for the email provider, with additional but modest client-side requirements.
Popcorn and Pretzel have fundamental connections. For instance, the
cryptographic protocols in both systems securely compute vector-matrix products.
However, we observe that differences in the vector and matrix dimensions lead to
different system designs.
Ultimately, both systems represent a potentially appealing compromise: sacrifice
some functionality to build in strong privacy properties at affordable costs.Computer Science
Vulnerability Assessment and Privacy-preserving Computations in Smart Grid
Modern advances in sensor, computing, and communication technologies enable various smart grid applications which highlight the vulnerability that requires novel approaches to the field of cybersecurity. While substantial numbers of technologies have been adopted to protect cyber attacks in smart grid, there lacks a comprehensive review of the implementations, impacts, and solutions of cyber attacks specific to the smart grid.In this dissertation, we are motivated to evaluate the security requirements for the smart grid which include three main properties: confidentiality, integrity, and availability. First, we review the cyber-physical security of the synchrophasor network, which highlights all three aspects of security issues. Taking the synchrophasor network as an example, we give an overview of how to attack a smart grid network. We test three types of attacks and show the impact of each attack consisting of denial-of-service attack, sniffing attack, and false data injection attack.Next, we discuss how to protect against each attack. For protecting availability, we examine possible defense strategies for the associated vulnerabilities.For protecting data integrity, a small-scale prototype of secure synchrophasor network is presented with different cryptosystems. Besides, a deep learning based time-series anomaly detector is proposed to detect injected measurement. Our approach observes both data measurements and network traffic features to jointly learn system states and can detect attacks when state vector estimator fails.For protecting data confidentiality, we propose privacy-preserving algorithms for two important smart grid applications. 1) A distributed privacy-preserving quadratic optimization algorithm to solve Security Constrained Optimal Power Flow (SCOPF) problem. The SCOPF problem is decomposed into small subproblems using the Alternating Direction Method of Multipliers (ADMM) and gradient projection algorithms. 2) We use Paillier cryptosystem to secure the computation of the power system dynamic simulation. The IEEE 3-Machine 9-Bus System is used to implement and demonstrate the proposed scheme. The security and performance analysis of our implementations demonstrate that our algorithms can prevent chosen-ciphertext attacks at a reasonable cost
Discourses on social software
Can computer scientists contribute to the solution of societal problems? Can logic help to model social interactions? Are there recipes for making groups with diverging preferences arrive at reasonable decisions? Why is common knowledge important for social interaction? Does the rational pursuit of individual interests put the public interest in danger, and if so, why? Discourses on Social Software sheds light on these and similar questions. This book offers the reader an ideal introduction to the exciting new field of social software. It shows in detail the many ways in which the seemingly abstract sciences of logic and computer science can be put to use to analyse and solve contemporary social problems. The unusual format of a series of discussions among a logician, a computer scientist, a philosopher and some researchers from other disciplines encourages the reader to develop his own point of view. The only requirements for reading this book are a nodding familiarity with logic, a curious mind, and a taste for spicy debate.Kunnen de computerwetenschappers bijdragen aan een oplossing van sociale problemen? Kan logica gebruikt worden om sociale interactie te modelleren? Zijn er regels op te stellen om groepen met afwijkende voorkeuren tot redelijke besluiten te laten komen? Discourses on Social Software biedt de lezer een ideale inleiding op (nog nieuwe) gebied van sociale software. Het toont in detail de vele manieren waarin de schijnbaar abstracte wetenschappen van logica en computerwetenschap aan het werk kunnen worden gezet om eigentijdse sociale problemen te analyseren en op te lossen. Door de ongebruikelijke aanpak in dit boek, namelijk door discussies tussen een logicus, een computerwetenschapper, een filosoof en onderzoekers uit andere disciplines, wordt de lezer aangemoedigd zijn eigen standpunt te ontwikkelen. De enige vereisten om dit boek te lezen zijn enige vertrouwdheid met de logica, een nieuwsgierige geest, en liefde voor een pittig debat