University of California San Francisco

Displaying 1-40 of 42 results

  • White Papers // Feb 2014

    Virtual CAN Lines in an Integrated MPSoC Architecture

    The standard solution for automotive control networks is the Control Area Network (CAN) bus. Almost any vehicular computer system comprehends at least one CAN line. For the past two decades, software development for control system has been strongly connected to the properties and interfaces of the CAN bus. Currently, the...

    Provided By University of California San Francisco

  • White Papers // Jan 2014

    A Secure Online Algorithm for Link Analysis on Weighted Graph

    The expertise location problem is to find a person in an organization or community who is knowledgeable (and authoritative) in an area. Several approaches construct an explicit social network between individuals, based on email or similar logs, and then use graphical analysis to locate the relevant experts. Identifying domain experts...

    Provided By University of California San Francisco

  • White Papers // Nov 2013

    Tracking Deformable Objects with Point Clouds

    The authors introduce an algorithm for tracking deformable objects from a sequence of point clouds. The proposed tracking algorithm is based on a probabilistic generative model that incorporates observations of the point cloud and the physical properties of the tracked object and its environment. They propose a modified expectation maximization...

    Provided By University of California San Francisco

  • White Papers // Oct 2013

    When Do Redundant Requests Reduce Latency ?

    Several systems possess the flexibility to serve requests in more than one way. For instance, a distributed storage system storing multiple replicas of the data can serve a request from any of the multiple servers that store the requested data, or a computational task may be performed in a compute-cluster...

    Provided By University of California San Francisco

  • White Papers // Sep 2013

    Privacy-preserving and Secure Distributed Storage Codes

    In this paper, the authors present explicit codes for distributed storage that, in the presence of repair dynamics, provide information theoretic privacy and security from passive eavesdroppers and/or malicious adversaries. These codes meet previously derived lower bounds on the resources of storage and bandwidth utilized. This paper turns out to...

    Provided By University of California San Francisco

  • White Papers // Jul 2013

    A Case for OS Friendly Hardware Accelerators

    Modern SoCs make extensive use of specialized hardware accelerators to meet the demanding energy-efficiency requirements of demanding applications, such as computer graphics and video encoding/decoding. Unfortunately, the state of the art is a sea of heterogeneous fixed-function processing units wired together in an ad-hoc fashion, with dedicated memory spaces and...

    Provided By University of California San Francisco

  • White Papers // Jul 2013

    Accounting for Variation in Spam Effectivness

    Cybercrime today is a profit-driven enterprise. Viewing computer security through the lens of business incentives in this way helps guide the efforts of policy-makers and researchers, since the effectiveness of countermeasures is directly related to their effect on cybercriminals' profit motives, the root causes of cybercrime. In this paper, understanding...

    Provided By University of California San Francisco

  • White Papers // May 2013

    Watertight Planar Surface Meshing of Indoor Point-Clouds with Voxel Carving

    3D modeling of building architecture from point-cloud scans is a rapidly advancing field. These models are used in augmented reality, navigation, and energy simulation applications. State-of-the-art scanning produces accurate point-clouds of building interiors containing hundreds of millions of points. Current surface reconstruction techniques either do not preserve sharp features common...

    Provided By University of California San Francisco

  • White Papers // Apr 2013

    The MDS Queue: Analysing Latency Performance of Codes and Redundant Requests

    In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication-based methods at a significantly lower storage cost. In particular, it is well...

    Provided By University of California San Francisco

  • White Papers // Apr 2013

    A Multicore Operating System With QoS Guarantees for Network Audio Applications

    In this paper, the authors explain about the role of the Operating System (OS) within computer nodes of network audio systems. While many efforts in the network-audio community focus on low-latency network protocols, here, they highlight the importance of the OS for network audio applications. They present Tessellation, an experimental...

    Provided By University of California San Francisco

  • White Papers // Mar 2013

    Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search

    Breadth-First Search (BFS) is a fundamental graph primitive frequently used as a building block for many complex graph algorithms. In the worst case, the complexity of BFS is linear in the number of edges and vertices, and the conventional top-down approach always takes as much time as the worst case....

    Provided By University of California San Francisco

  • White Papers // Feb 2013

    In Quest of Benchmarking Security Risks to Cyber-Physical Systems

    The authors present a generic yet practical framework for assessing security risks to Cyber-Physical Systems (CPSs). Their framework can be used to benchmark security risks when information is less than perfect, and interdependencies of physical and computational components may result in correlated failures. Such environments are prone to externalities, and...

    Provided By University of California San Francisco

  • White Papers // Dec 2012

    Querying the Internet with PIER

    The database research community prides itself on scalable technologies. Yet database systems traditionally do not excel on one important scalability dimension: the degree of distribution. This limitation has hampered the impact of database technologies on massively distributed systems like the Internet. In this paper, the authors present the initial design...

    Provided By University of California San Francisco

  • White Papers // Dec 2012

    Cyber-Security for the Controller Area Network (CAN) Communication Protocol

    The authors propose a security mechanism to help prevent cyber-attacks (masquerade and replay) in vehicles with architecture based on Controller Area Network (CAN). They focus on CAN as it will likely continue being used in upcoming in-vehicle architectures. The CAN protocol contains no direct support for secure communications. Retrofitting the...

    Provided By University of California San Francisco

  • White Papers // Oct 2012

    Mining Permission Request Patterns from Android and Facebook Applications

    Android and Facebook provide third-party applications with access to users' private data and the ability to perform potentially sensitive operations (e.g., post to a user's wall or place phone calls). As a security measure, these platforms restrict applications' privileges with permission systems: users must approve the permissions requested by applications...

    Provided By University of California San Francisco

  • White Papers // Aug 2012

    Security Analysis of Smartphone Point-of-Sale Systems

    The authors experimentally investigate the security of several Smartphone Point-Of-Sale (POS) systems that consist of a software application combined with an Audio-jack Magnetic Stripe Reader (AMSR). The latter is a small hardware dongle that reads magnetic stripes on payment cards, (sometimes) encrypts the sensitive card data, and transmits the result...

    Provided By University of California San Francisco

  • White Papers // Jan 2012

    A Soft Real-Time, Parallel GUI Service in Tessellation Many-Core OS

    The authors discuss the design and implementation of a parallel GUI Service in Tessellation OS and investigate its capability to provide soft service-time guarantees to visual applications. Use of GPU bandwidth reservation permits their GUI service to miss only 0.1% of client deadlines under an overloaded scenario, while a more...

    Provided By University of California San Francisco

  • White Papers // Jan 2012

    Hypervisors as a Foothold for Personal Computer Security: An Agenda for the Research Community

    The current consumer software stack makes end-user systems extremely difficult to secure. Consumer operating systems are large and complex, so they are easily subverted by malware, which makes its way onto users' machines either by exploiting vulnerable applications or through social engineering. Once malware has compromised the OS, it can...

    Provided By University of California San Francisco

  • White Papers // Jun 2011

    DRESS Codes for the Storage Cloud: Simple Randomized Constructions

    The authors introduce an efficient family of exact regenerating codes for data storage in large-scale distributed systems. They refer to these new codes as Distributed Replication-based Exact Simple Storage (DRESS) codes. A key property of DRESS codes is their very efficient distributed and uncoded repair and growth processes that have...

    Provided By University of California San Francisco

  • White Papers // Nov 2010

    Security Interdependencies for Networked Control Systems with Identical Agents

    In this paper, the authors study the security choices of identical plant-controller systems, when their security is interdependent due the exposure to network induced risks. Each plant is modeled by a discrete-time stochastic linear system, which is sensed and controlled over a communication network. The authors model security decisions of...

    Provided By University of California San Francisco

  • White Papers // Oct 2010

    Quantize-Map-and-Forward Relaying: Coding and System Design

    Quantize-Map-and-Forward (QMF) is a relaying scheme that has been shown to achieve the capacity of Gaussian relay networks to within a constant gap. Under QMF the compression indices forwarded by relays are not decoded explicitly. Instead, the message is decoded jointly with the compression indices. In this paper, the authors...

    Provided By University of California San Francisco

  • White Papers // Jul 2010

    Distributed Intrusion Detection in the Presence of Correlated Sensor Readings: Signal-Space and Communication-Complexity View-Point

    In this paper, the authors propose a signal-space viewpoint in which every point in the three-dimensional signal space corresponds to a collection of sensor readings. In this space, in the absence of measurement noise, the intruder and clutter are represented by two surfaces. The problem of sensor-network-based distributed intrusion detection...

    Provided By University of California San Francisco

  • White Papers // May 2010

    Towards Understanding Cloud Performance Tradeoffs Using Statistical Workload Analysis and Replay

    Cloud computing has given rise to a variety of distributed applications that rely on the ability to harness commodity resources for large scale computations. The inherent performance variability in these applications' workload coupled with the system's heterogeneity render ineffective heuristics-based design decisions such as system configuration, application partitioning and placement,...

    Provided By University of California San Francisco

  • White Papers // Apr 2010

    Healthcare Is Not Something You Can Isolate From Life In General: Factors Influencing Successful Clinical Capacity Building In The Pacific

    Capacity Building Assistance (CBA) uses multiple techniques, including training and technical assistance, to develop a sustainable infrastructure for healthcare agencies. Although there is some evidence that CBA is effective, much remains to be learned about the best ways to implement it. The authors assessed factors influencing the delivery of an...

    Provided By University of California San Francisco

  • White Papers // Feb 2010

    Security Analysis of Online Centroid Anomaly Detection

    Security issues are crucial in a number of machine learning applications, especially in scenarios dealing with human activity rather than natural phenomena (e.g., information ranking, spam detection, malware detection, etc.). It is to be expected in such cases that learning algorithms will have to deal with manipulated data aimed at...

    Provided By University of California San Francisco

  • White Papers // Dec 2009

    Dedalus: Datalog in Time and Space

    Recent research has explored using Datalog-based languages to express a distributed system as a set of logical invariants. Two properties of distributed systems proved difficult to model in Datalog. First, the state of any such system evolves with its execution. Second, deductions in these systems may be arbitrarily delayed, dropped,...

    Provided By University of California San Francisco

  • White Papers // Jun 2009

    The Gh0st in the Shell: Network Security in the Himalayas

    The town of Dharamsala in the Himalayas of India harbors not only the Tibetan government in-exile, but also a very unique Internet community operated by the researcher. The combination of high-profile clientele and naive users makes for a very interesting setting from a network security standpoint. Using packet capture and...

    Provided By University of California San Francisco

  • White Papers // Apr 2009

    Verifiable Order Statistics for Secure Aggregation

    In-network aggregation can save significant bandwidth in a distributed query systems, but is subject to attack by adversaries. Prior work addressed settings where data sources are trusted, but the aggregation infrastructure needs to be se-cured. The authors study extensions that also make aggregate queries robust to adversarial data sources, which...

    Provided By University of California San Francisco

  • White Papers // Jan 2009

    Elimination of Timing Attacks with a Precision Timed Architecture

    Side-channel attacks exploit information-leaky implementations of cryptographic algorithms to find the encryption key. These information leaks are caused by the underlying execution platform which contains hardware elements designed to optimize performance at the expense of predictable execution time. This shows that for security systems, not only does the software need...

    Provided By University of California San Francisco

  • White Papers // Oct 2008

    Cross-Site Request Forgeries: Exploitation and Prevention

    Cross-Site Request Forgery (CSRF) attacks occur when a malicious web site causes a user's web browser to perform an unwanted action on a trusted site. These attacks have been called the \"Sleeping giant\" of web-based vulnerabilities, because many sites on the Internet fail to protect against them and because they...

    Provided By University of California San Francisco

  • White Papers // Oct 2008

    Security Against Sybil Attack in Wireless Sensor Network Through Location Verification

    A new functional for planar triangulation called inner core has been proposed in for a location verification based defense against Sybil attack for sensor network, and also has been shown that the legitimacy of a new node inside the inner core of a triangle obtained by the triangulation of the...

    Provided By University of California San Francisco

  • White Papers // Jun 2008

    A Digital Lego Set and Exercises for Teaching Security Protocols

    To bridge the gap between the instruction of security primitives and protocols, the authors have designed and developed a digital Lego system and supporting course materials. Their digital Lego pieces are designed to use shapes to provide a generic representation of security protocols. With the automatic Lego piece generation and...

    Provided By University of California San Francisco

  • White Papers // Apr 2008

    Real-Time Distributed Discrete-Event Execution with Fault Tolerance

    Large-scale distributed embedded systems are a mixture of software components, hardware devices (such as sensors and actuators), and networks. Examples include automotive and avionics systems. From a high-level design perspective, the Discrete-Event (DE) models of these systems consist of interconnected actors accepting inputs and producing outputs via the connections between...

    Provided By University of California San Francisco

  • White Papers // Feb 2008

    On Automatic Placement of Declassifiers for Information-Flow Security

    Security-typed languages can be used to build programs that are information-flow secure, meaning that they do not allow secret data to leak. Declassification allows programs to leak secret information in carefully prescribed ways. Manually placing declassifiers to authorize certain flows of information can be dangerous because an incorrectly placed declassifier...

    Provided By University of California San Francisco

  • White Papers // Dec 2007

    Security Analysis on Defenses against Sybil Attacks in Wireless Sensor Networks

    Few security mechanisms in Wireless Sensor Networks (WSNs) have been implemented, and even fewer have been applied in real deployments. The limited resources of each sensor node makes security in WSNs hard, as the tradeoff between security and practicality must be carefully considered. While there are many types of security...

    Provided By University of California San Francisco

  • White Papers // Oct 2007

    Intruder Detection Over Sensor Placement in a Hexagonal Lattice

    The problem of intrusion detection and location identification in the presence of clutter is considered. In many practical applications, for a fixed intruder or clutter location, only a small number of neighboring sensor nodes will register a significant reading. As a result, performance is strongly dependent on the local geometry...

    Provided By University of California San Francisco

  • White Papers // Sep 2007

    Deterministic Regenerating Codes for Distributed Storage

    It is well known that erasure coding can be used in storage systems to efficiently store data while protecting against failures. Conventionally, the design of erasure codes has focused on the tradeoff between redundancy and reliability; under this criterion, an Maximum Distance Separable (MDS) code is optimal. However, practical storage...

    Provided By University of California San Francisco

  • White Papers // Nov 2006

    ASM Relational Transducer Security Policies

    The authors present a model of the security policy for the web-based continue conference management tool. The policy model and properties are written as ASM relational transducers, which they extend with a module system in order to simplify the handling of conflicting updates. They assume prior familiarity with the security...

    Provided By University of California San Francisco

  • White Papers // May 2006

    Automated Mapping From a Domain Specific Language to a Commercial Embedded Multiprocessor

    Application specific programmable systems are capable of high performance implementations while remaining flexible enough to support a range of applications. Architects of these systems achieve high performance through domain specific optimizations, often introduced at the expense of programming productivity. The authors examine one of the most performance critical and time...

    Provided By University of California San Francisco

  • White Papers // Apr 2006

    Security of Blind Digital Signatures

    A digital signature scheme allows one to \"Sign\" documents in such a way that everyone can verify the validity of authentic signatures, but no one can forge signatures of new documents. Blind digital signatures were introduced by the researcher. In this paper, the authors show how security and blindness properties...

    Provided By University of California San Francisco

  • White Papers // Oct 2007

    Intruder Detection Over Sensor Placement in a Hexagonal Lattice

    The problem of intrusion detection and location identification in the presence of clutter is considered. In many practical applications, for a fixed intruder or clutter location, only a small number of neighboring sensor nodes will register a significant reading. As a result, performance is strongly dependent on the local geometry...

    Provided By University of California San Francisco

  • White Papers // Apr 2006

    Security of Blind Digital Signatures

    A digital signature scheme allows one to \"Sign\" documents in such a way that everyone can verify the validity of authentic signatures, but no one can forge signatures of new documents. Blind digital signatures were introduced by the researcher. In this paper, the authors show how security and blindness properties...

    Provided By University of California San Francisco

  • White Papers // Dec 2009

    Dedalus: Datalog in Time and Space

    Recent research has explored using Datalog-based languages to express a distributed system as a set of logical invariants. Two properties of distributed systems proved difficult to model in Datalog. First, the state of any such system evolves with its execution. Second, deductions in these systems may be arbitrarily delayed, dropped,...

    Provided By University of California San Francisco

  • White Papers // Feb 2014

    Virtual CAN Lines in an Integrated MPSoC Architecture

    The standard solution for automotive control networks is the Control Area Network (CAN) bus. Almost any vehicular computer system comprehends at least one CAN line. For the past two decades, software development for control system has been strongly connected to the properties and interfaces of the CAN bus. Currently, the...

    Provided By University of California San Francisco

  • White Papers // May 2006

    Automated Mapping From a Domain Specific Language to a Commercial Embedded Multiprocessor

    Application specific programmable systems are capable of high performance implementations while remaining flexible enough to support a range of applications. Architects of these systems achieve high performance through domain specific optimizations, often introduced at the expense of programming productivity. The authors examine one of the most performance critical and time...

    Provided By University of California San Francisco

  • White Papers // Apr 2008

    Real-Time Distributed Discrete-Event Execution with Fault Tolerance

    Large-scale distributed embedded systems are a mixture of software components, hardware devices (such as sensors and actuators), and networks. Examples include automotive and avionics systems. From a high-level design perspective, the Discrete-Event (DE) models of these systems consist of interconnected actors accepting inputs and producing outputs via the connections between...

    Provided By University of California San Francisco

  • White Papers // Mar 2013

    Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search

    Breadth-First Search (BFS) is a fundamental graph primitive frequently used as a building block for many complex graph algorithms. In the worst case, the complexity of BFS is linear in the number of edges and vertices, and the conventional top-down approach always takes as much time as the worst case....

    Provided By University of California San Francisco

  • White Papers // Jul 2013

    A Case for OS Friendly Hardware Accelerators

    Modern SoCs make extensive use of specialized hardware accelerators to meet the demanding energy-efficiency requirements of demanding applications, such as computer graphics and video encoding/decoding. Unfortunately, the state of the art is a sea of heterogeneous fixed-function processing units wired together in an ad-hoc fashion, with dedicated memory spaces and...

    Provided By University of California San Francisco

  • White Papers // Apr 2013

    A Multicore Operating System With QoS Guarantees for Network Audio Applications

    In this paper, the authors explain about the role of the Operating System (OS) within computer nodes of network audio systems. While many efforts in the network-audio community focus on low-latency network protocols, here, they highlight the importance of the OS for network audio applications. They present Tessellation, an experimental...

    Provided By University of California San Francisco

  • White Papers // Jan 2012

    A Soft Real-Time, Parallel GUI Service in Tessellation Many-Core OS

    The authors discuss the design and implementation of a parallel GUI Service in Tessellation OS and investigate its capability to provide soft service-time guarantees to visual applications. Use of GPU bandwidth reservation permits their GUI service to miss only 0.1% of client deadlines under an overloaded scenario, while a more...

    Provided By University of California San Francisco

  • White Papers // Jan 2006

    Efficiently Binding Data to Owners in Distributed Content-Addressable Storage Systems

    Distributed content-addressable storage systems use self-verifying data to protect data integrity and to enable graceful scaling. One feature commonly missing from these systems, however, is the ability to identify the owner of a piece of data in a non-repudiable manner. While a solution that associates a certificate with each block...

    Provided By University of California San Francisco

  • White Papers // Feb 2006

    Probabilistic Data Aggregation in Distributed Networks

    The authors explore techniques to reduce the sensitivity of large-scale data aggregation networks to the loss of data. Their approach leverages multi-level modeling and prediction techniques to account for missing data points and is enabled by the temporal correlation that is present in typical data aggregation applications. The result can...

    Provided By University of California San Francisco

  • White Papers // Sep 2007

    Deterministic Regenerating Codes for Distributed Storage

    It is well known that erasure coding can be used in storage systems to efficiently store data while protecting against failures. Conventionally, the design of erasure codes has focused on the tradeoff between redundancy and reliability; under this criterion, an Maximum Distance Separable (MDS) code is optimal. However, practical storage...

    Provided By University of California San Francisco

  • White Papers // Oct 2013

    When Do Redundant Requests Reduce Latency ?

    Several systems possess the flexibility to serve requests in more than one way. For instance, a distributed storage system storing multiple replicas of the data can serve a request from any of the multiple servers that store the requested data, or a computational task may be performed in a compute-cluster...

    Provided By University of California San Francisco

  • White Papers // Apr 2013

    The MDS Queue: Analysing Latency Performance of Codes and Redundant Requests

    In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication-based methods at a significantly lower storage cost. In particular, it is well...

    Provided By University of California San Francisco

  • White Papers // Dec 2012

    Querying the Internet with PIER

    The database research community prides itself on scalable technologies. Yet database systems traditionally do not excel on one important scalability dimension: the degree of distribution. This limitation has hampered the impact of database technologies on massively distributed systems like the Internet. In this paper, the authors present the initial design...

    Provided By University of California San Francisco

  • White Papers // Apr 2010

    Healthcare Is Not Something You Can Isolate From Life In General: Factors Influencing Successful Clinical Capacity Building In The Pacific

    Capacity Building Assistance (CBA) uses multiple techniques, including training and technical assistance, to develop a sustainable infrastructure for healthcare agencies. Although there is some evidence that CBA is effective, much remains to be learned about the best ways to implement it. The authors assessed factors influencing the delivery of an...

    Provided By University of California San Francisco

  • White Papers // Oct 2012

    Mining Permission Request Patterns from Android and Facebook Applications

    Android and Facebook provide third-party applications with access to users' private data and the ability to perform potentially sensitive operations (e.g., post to a user's wall or place phone calls). As a security measure, these platforms restrict applications' privileges with permission systems: users must approve the permissions requested by applications...

    Provided By University of California San Francisco

  • White Papers // Nov 2006

    ASM Relational Transducer Security Policies

    The authors present a model of the security policy for the web-based continue conference management tool. The policy model and properties are written as ASM relational transducers, which they extend with a module system in order to simplify the handling of conflicting updates. They assume prior familiarity with the security...

    Provided By University of California San Francisco

  • White Papers // Feb 2010

    Security Analysis of Online Centroid Anomaly Detection

    Security issues are crucial in a number of machine learning applications, especially in scenarios dealing with human activity rather than natural phenomena (e.g., information ranking, spam detection, malware detection, etc.). It is to be expected in such cases that learning algorithms will have to deal with manipulated data aimed at...

    Provided By University of California San Francisco

  • White Papers // Dec 2007

    Security Analysis on Defenses against Sybil Attacks in Wireless Sensor Networks

    Few security mechanisms in Wireless Sensor Networks (WSNs) have been implemented, and even fewer have been applied in real deployments. The limited resources of each sensor node makes security in WSNs hard, as the tradeoff between security and practicality must be carefully considered. While there are many types of security...

    Provided By University of California San Francisco

  • White Papers // Feb 2008

    On Automatic Placement of Declassifiers for Information-Flow Security

    Security-typed languages can be used to build programs that are information-flow secure, meaning that they do not allow secret data to leak. Declassification allows programs to leak secret information in carefully prescribed ways. Manually placing declassifiers to authorize certain flows of information can be dangerous because an incorrectly placed declassifier...

    Provided By University of California San Francisco

  • White Papers // Nov 2010

    Security Interdependencies for Networked Control Systems with Identical Agents

    In this paper, the authors study the security choices of identical plant-controller systems, when their security is interdependent due the exposure to network induced risks. Each plant is modeled by a discrete-time stochastic linear system, which is sensed and controlled over a communication network. The authors model security decisions of...

    Provided By University of California San Francisco

  • White Papers // Oct 2008

    Cross-Site Request Forgeries: Exploitation and Prevention

    Cross-Site Request Forgery (CSRF) attacks occur when a malicious web site causes a user's web browser to perform an unwanted action on a trusted site. These attacks have been called the \"Sleeping giant\" of web-based vulnerabilities, because many sites on the Internet fail to protect against them and because they...

    Provided By University of California San Francisco

  • White Papers // Jun 2008

    A Digital Lego Set and Exercises for Teaching Security Protocols

    To bridge the gap between the instruction of security primitives and protocols, the authors have designed and developed a digital Lego system and supporting course materials. Their digital Lego pieces are designed to use shapes to provide a generic representation of security protocols. With the automatic Lego piece generation and...

    Provided By University of California San Francisco

  • White Papers // Sep 2013

    Privacy-preserving and Secure Distributed Storage Codes

    In this paper, the authors present explicit codes for distributed storage that, in the presence of repair dynamics, provide information theoretic privacy and security from passive eavesdroppers and/or malicious adversaries. These codes meet previously derived lower bounds on the resources of storage and bandwidth utilized. This paper turns out to...

    Provided By University of California San Francisco

  • White Papers // Jan 2012

    Hypervisors as a Foothold for Personal Computer Security: An Agenda for the Research Community

    The current consumer software stack makes end-user systems extremely difficult to secure. Consumer operating systems are large and complex, so they are easily subverted by malware, which makes its way onto users' machines either by exploiting vulnerable applications or through social engineering. Once malware has compromised the OS, it can...

    Provided By University of California San Francisco

  • White Papers // Feb 2013

    In Quest of Benchmarking Security Risks to Cyber-Physical Systems

    The authors present a generic yet practical framework for assessing security risks to Cyber-Physical Systems (CPSs). Their framework can be used to benchmark security risks when information is less than perfect, and interdependencies of physical and computational components may result in correlated failures. Such environments are prone to externalities, and...

    Provided By University of California San Francisco

  • White Papers // Apr 2009

    Verifiable Order Statistics for Secure Aggregation

    In-network aggregation can save significant bandwidth in a distributed query systems, but is subject to attack by adversaries. Prior work addressed settings where data sources are trusted, but the aggregation infrastructure needs to be se-cured. The authors study extensions that also make aggregate queries robust to adversarial data sources, which...

    Provided By University of California San Francisco

  • White Papers // Oct 2008

    Security Against Sybil Attack in Wireless Sensor Network Through Location Verification

    A new functional for planar triangulation called inner core has been proposed in for a location verification based defense against Sybil attack for sensor network, and also has been shown that the legitimacy of a new node inside the inner core of a triangle obtained by the triangulation of the...

    Provided By University of California San Francisco

  • White Papers // Jan 2014

    A Secure Online Algorithm for Link Analysis on Weighted Graph

    The expertise location problem is to find a person in an organization or community who is knowledgeable (and authoritative) in an area. Several approaches construct an explicit social network between individuals, based on email or similar logs, and then use graphical analysis to locate the relevant experts. Identifying domain experts...

    Provided By University of California San Francisco

  • White Papers // Jan 2009

    Elimination of Timing Attacks with a Precision Timed Architecture

    Side-channel attacks exploit information-leaky implementations of cryptographic algorithms to find the encryption key. These information leaks are caused by the underlying execution platform which contains hardware elements designed to optimize performance at the expense of predictable execution time. This shows that for security systems, not only does the software need...

    Provided By University of California San Francisco

  • White Papers // Jul 2013

    Accounting for Variation in Spam Effectivness

    Cybercrime today is a profit-driven enterprise. Viewing computer security through the lens of business incentives in this way helps guide the efforts of policy-makers and researchers, since the effectiveness of countermeasures is directly related to their effect on cybercriminals' profit motives, the root causes of cybercrime. In this paper, understanding...

    Provided By University of California San Francisco

  • White Papers // Jun 2011

    DRESS Codes for the Storage Cloud: Simple Randomized Constructions

    The authors introduce an efficient family of exact regenerating codes for data storage in large-scale distributed systems. They refer to these new codes as Distributed Replication-based Exact Simple Storage (DRESS) codes. A key property of DRESS codes is their very efficient distributed and uncoded repair and growth processes that have...

    Provided By University of California San Francisco

  • White Papers // May 2013

    Watertight Planar Surface Meshing of Indoor Point-Clouds with Voxel Carving

    3D modeling of building architecture from point-cloud scans is a rapidly advancing field. These models are used in augmented reality, navigation, and energy simulation applications. State-of-the-art scanning produces accurate point-clouds of building interiors containing hundreds of millions of points. Current surface reconstruction techniques either do not preserve sharp features common...

    Provided By University of California San Francisco

  • White Papers // May 2010

    Towards Understanding Cloud Performance Tradeoffs Using Statistical Workload Analysis and Replay

    Cloud computing has given rise to a variety of distributed applications that rely on the ability to harness commodity resources for large scale computations. The inherent performance variability in these applications' workload coupled with the system's heterogeneity render ineffective heuristics-based design decisions such as system configuration, application partitioning and placement,...

    Provided By University of California San Francisco

  • White Papers // Nov 2013

    Tracking Deformable Objects with Point Clouds

    The authors introduce an algorithm for tracking deformable objects from a sequence of point clouds. The proposed tracking algorithm is based on a probabilistic generative model that incorporates observations of the point cloud and the physical properties of the tracked object and its environment. They propose a modified expectation maximization...

    Provided By University of California San Francisco

  • White Papers // Jul 2010

    Distributed Intrusion Detection in the Presence of Correlated Sensor Readings: Signal-Space and Communication-Complexity View-Point

    In this paper, the authors propose a signal-space viewpoint in which every point in the three-dimensional signal space corresponds to a collection of sensor readings. In this space, in the absence of measurement noise, the intruder and clutter are represented by two surfaces. The problem of sensor-network-based distributed intrusion detection...

    Provided By University of California San Francisco

  • White Papers // Oct 2010

    Quantize-Map-and-Forward Relaying: Coding and System Design

    Quantize-Map-and-Forward (QMF) is a relaying scheme that has been shown to achieve the capacity of Gaussian relay networks to within a constant gap. Under QMF the compression indices forwarded by relays are not decoded explicitly. Instead, the message is decoded jointly with the compression indices. In this paper, the authors...

    Provided By University of California San Francisco

  • White Papers // Aug 2012

    Security Analysis of Smartphone Point-of-Sale Systems

    The authors experimentally investigate the security of several Smartphone Point-Of-Sale (POS) systems that consist of a software application combined with an Audio-jack Magnetic Stripe Reader (AMSR). The latter is a small hardware dongle that reads magnetic stripes on payment cards, (sometimes) encrypts the sensitive card data, and transmits the result...

    Provided By University of California San Francisco