University of California, Santa Cruz

Displaying 1-40 of 86 results

  • White Papers // Oct 2014

    Higher Order Differentiation Over Finite Fields with Applications to Generalising the Cube Attack

    The original motivation for this paper was to generalize the cube attack from the binary field to arbitrary finite fields. While doing so, the authors developed a number of tools and results for differentiation over finite fields which could have a broader applicability in cryptography. Higher order differentiation was introduced...

    Provided By University of California, Santa Cruz

  • White Papers // Feb 2014

    The Random Forest Kernel and Creating Other Kernels for Big Data From Random Partitions

    The authors present random partition Kernels, a new class of kernels derived by demonstrating a natural connection between random partitions of objects and kernels between those objects. They show how the construction can be used to create kernels from methods that would not normally be viewed as random partitions, such...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2014

    Confidentiality Issues on a GPU in a Virtualized Environment

    General-Purpose computing on Graphics Processing Units (GPGPU) combined to cloud computing is already a commercial success. However, there is little literature that investigates its security implications. Their objective is to highlight possible information leakage due to GPUs in virtualized and cloud computing environments. The authors provide insight into the different...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2014

    FlowR: Aspect Oriented Programming for Information Flow Control in Ruby

    In this paper, the authors report on their experience with providing Information Flow Control (IFC) as a library. Their aim was to support the use of an unmodified Platform-as-a-Service (PaaS) cloud infrastructure by IFC-aware web applications. They discuss how Aspect Oriented Programming (AOP) overcomes the limitations of RubyTrack, their first...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2014

    Verifying ARM6 Multiplication

    This paper discusses the ARM6 implementation of the multiply instructions, and the formal verification using the HOL proof system. For information about the ARM architecture the reader is referred to Furber and the ARM (Architecture Reference Manual). The verification of the block data transfer instruction class and all of the...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2014

    JMA: The Java-Multithreading Architecture for Embedded Processors

    Embedded processors are increasingly deployed in applications requiring high performance with good real-time characteristics whilst being low power. Parallelism has to be extracted in order to improve the performance at an architectural level. Extracting instruction level parallelism requires extensive speculation which adds complexity and increases power consumption. Alternatively, parallelism can...

    Provided By University of California, Santa Cruz

  • White Papers // Nov 2013

    Efficient Template Attacks

    Template attacks remain a powerful side-channel technique to eavesdrop on tamper-resistant hardware. They model the probability distribution of leaking signals and noise to guide a search for secret data values. In practice, several numerical obstacles can arise when implementing such attacks with multivariate normal distributions. The authors propose efficient methods...

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2013

    Formal Security Modeling in Autonomic Cloud Computing Environment

    The notions of Autonomic Components (ACs) and Autonomic-Component Ensembles (ACEs) have been put forward as a means to structure a system into well understood, independent and distributed building blocks that interact in specified ways. Autonomic systems exhibit the ability of self-monitoring, self-repairing, and self-optimizing by constantly sensing themselves and tuning...

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2013

    Security Reverse Engineering of Mobile Operating Systems: A Summary

    As small form-factor networking-enabled cellular devices proliferate in both consumer and corporate market segments, security concerns gradually come to the fore due to their frequent use for storing sensitive financial, personal or work-related data. Security is further hampered by version erosion which gives rise to exploiting known vulnerabilities, closed-source nature...

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2013

    Honeypot as the Intruder Detection System

    In this paper, the authors show possible implementation of honeypot in local network. The honeypot works as the 0-day malware detection system. It implements many of active or semi-active traps in local area network and DMZ in the company network. There are not defined the legal trace to the honeypot....

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2013

    Rewritable Storage Channels with Hidden State

    Many storage channels admit reading and rewriting of the content at a given cost. The authors consider rewritable channels with a hidden state which models the unknown characteristics of the memory cell. In addition to mitigating the effect of the write noise, rewrites can help the write controller obtain a...

    Provided By University of California, Santa Cruz

  • White Papers // May 2013

    Improved Exponents and Rates for Bit-Interleaved Coded Modulation

    Mismatched decoding theory is applied to study the error exponents (both random-coding and expurgated) and achievable rates for Bit-Interleaved Coded Modulation (BICM). The gains achieved by constant-composition codes with respect to the usual random codes are highlighted. Random-coding techniques are typically used to prove channel coding theorems for achievable rates...

    Provided By University of California, Santa Cruz

  • White Papers // May 2013

    Fixed-Threshold Polar Codes

    The authors study a family of polar codes whose frozen set is such that it discards the bit channels for which the mutual information falls below a certain (fixed) threshold. They show that if the threshold, which might depend on the code length, is bounded appropriately, a coding theorem can...

    Provided By University of California, Santa Cruz

  • White Papers // May 2013

    GMI and Mismatched-CSI Outage Exponents in MIMO Block-Fading Channels

    The authors study transmission over multiple-antenna block-fading channels with imperfect channel state information at both the transmitter and receiver. Specifically, they investigate achievable rates based on the generalized mutual information. They then analyze the corresponding outage probability in the high signal-to-noise ratio regime. The block-fading channel is a widely-used model...

    Provided By University of California, Santa Cruz

  • White Papers // May 2013

    The Mismatched Multiple-Access Channel: General Alphabets

    The problem of channel coding with a mismatched decoding rule arises in numerous settings. This paper considers channel coding for the memory-less multiple-access channel with a given (possibly suboptimal) decoding rule. Non-asymptotic bounds on the error probability are given, and a cost-constrained random-coding ensemble is used to obtain an achievable...

    Provided By University of California, Santa Cruz

  • White Papers // Feb 2013

    Cost-Constrained Random Coding and Applications

    This paper studies a random coding ensemble in which each codeword is constrained to satisfy multiple cost constraints. Using this ensemble, an achievable second-order coding rate is presented for the mismatched single-user channel. Achievable error exponents are given for the mismatched single-user channel and the matched multiple-access channel. The method...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2013

    METIS: Exploring Mobile Phone Sensing Offloading for Efficiently Supporting Social Sensing Applications

    Mobile phones play a pivotal role in supporting ubiquitous and unobtrusive sensing of human activities. However, maintaining a highly accurate record of a user's behavior throughout the day imposes significant energy demands on the phone's battery. In this paper, the authors present the design, implementation, and evaluation of METIS: an...

    Provided By University of California, Santa Cruz

  • White Papers // Oct 2012

    Generating Events with Style

    Threads and events are two common abstractions for writing concurrent programs. Because threads are often more convenient, but events more efficient, it is natural to want to translate the former into the latter. However, whereas there are many different event-driven styles, existing translators often apply ad-hoc rules which do not...

    Provided By University of California, Santa Cruz

  • White Papers // Oct 2012

    Mining User Mobility Features for Next Place Prediction in Location-Based Services

    Mobile location-based services are thriving, providing an unprecedented opportunity to collect fine grained spatiotemporal data about the places users visit. This multi-dimensional source of data offers new possibilities to tackle established research problems on human mobility, but it also opens avenues for the development of novel mobile applications and services....

    Provided By University of California, Santa Cruz

  • White Papers // Oct 2012

    Full System Simulation of Optically Interconnected Chip Multiprocessors Using gem5

    It has been shown that optical Network-on-Chip (NoC) can reduce power consumption of Chip Multi-Processors (CMP), popularly known as multicore processors. Typically, these networks are evaluated for latency and throughput using simulation of either synthetic traffic patterns or trace data, the latter coming from either real systems or computer architecture...

    Provided By University of California, Santa Cruz

  • White Papers // Oct 2012

    Unconditionally Secure Device-Independent Quantum Key Distribution With Only Two Devices

    Device-independent quantum key distribution is the task of using uncharacterized quantum devices to establish a shared key between two users. If a protocol is secure regardless of the device behaviour, it can be used to generate a shared key even if the supplier of the devices is malicious. To date,...

    Provided By University of California, Santa Cruz

  • White Papers // Oct 2012

    Converse Bounds for Finite-Length Joint Source-Channel Coding

    Based on the hypothesis-testing method, the authors derive lower bounds on the average error probability of finite-length joint source-channel coding. The extension of the meta-converse bound of channel coding to joint source-channel coding depends on the codebook and the decoding rule and thus, it is a priori computationally challenging. Weaker...

    Provided By University of California, Santa Cruz

  • White Papers // Oct 2012

    An Achievable Error Exponent for the Mismatched Multiple-Access Channel

    The problem of finding the mismatched capacity is an open problem in general, and most existing results are on achievable rates via random coding. This paper considers the channel coding for the discrete memory-less multiple-access channel with a given (possibly suboptimal) decoding rule. Using constant-composition random coding, an achievable error...

    Provided By University of California, Santa Cruz

  • White Papers // Oct 2012

    Ensemble-Tight Error Exponents for Mismatched Decoders

    This paper studies channel coding for discrete memory-less channels with a given (possibly suboptimal) decoding rule. Using upper and lower bounds on the random-coding error probability, the exponential behavior of three random-coding ensembles is characterized. The ensemble tightness of existing achievable error exponents is proven for the i.i.d. and constant-composition...

    Provided By University of California, Santa Cruz

  • White Papers // Aug 2012

    Mistify: Augmenting Cloud Storage With Delay-Tolerant Cooperative Backup

    A variety of personal backup services now allow users to synchronise their files across multiple devices such as laptops and Smartphones. These applications typically operate by synchronising each device with a centralised storage service across the Internet. However, access to the Internet may occasionally not be available, leaving any unsynchronised...

    Provided By University of California, Santa Cruz

  • White Papers // Aug 2012

    Secure and Robust Transmission and Verification of Unknown Quantum States in Minkowski Space

    An important class of cryptographic applications of relativistic quantum information work as follows. B generates a random qudit and supplies it to A at point P. A is supposed to transmit it at near light speed c to one of a number of possible pair wise space like separated points...

    Provided By University of California, Santa Cruz

  • White Papers // Aug 2012

    Security Details for Bit Commitment by Transmitting Measurement Outcomes

    Recently, a new quantum relativistic bit commitment protocol was introduced. Its security relies, essentially, on the impossibility of completing a nonlocal measurement on a distributed state outside the joint future light cone of its components. Its implementation requires minimal quantum resources: the receiver needs to send quantum states (which can...

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2012

    Infiltrate the Vault: Security Analysis and Decryption of Lion Full Disk Encryption

    With the launch of Mac OS X 10.7 (Lion), Apple has introduced a volume encryption mechanism known as FileVault 2. Apple only disclosed marketing aspects of the closed-source software, e.g. its use of the AES-XTS tweakable encryption, but a publicly available security evaluation and detailed description was unavailable until now....

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2012

    A Random Walk Around the City: New Venue Recommendation in Location-Based Social Networks

    The popularity of location-based social networks available on mobile devices means that large, rich datasets that contain a mixture of behavioral (users visiting venues), social (links between users), and spatial (distances between venues) information are available for mobile location recommendation systems. However, these datasets greatly differ from those used in...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2012

    Aurasium: Practical Policy Enforcement for Android Applications

    The increasing popularity of Google's mobile platform Android makes it the prime target of the latest surge in mobile malware. Most research on enhancing the platform's security and privacy controls requires extensive modification to the operating system, which has significant usability issues and hinders efforts for widespread adoption. The authors...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2012

    Mismatched Shaping Schemes for Bit-Interleaved Coded Modulation

    The authors consider Bit-Interleaved Coded Modulation (BICM) schemes where, instead of the true bit or symbol probabilities and the constellation used at the transmitter, the decoder uses arbitrary probabilities or reference constellations. They study the corresponding low- and high-signal-to-noise-ratio regimes and show that even in the presence of this extra...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2012

    Polymorphic Attacks Against Sequence-Based Software Birthmarks

    Sequence alignment algorithms have recently found a use in detecting code clones, software plagiarism, code theft, and polymorphic malware. This approach involves extracting birthmarks, in this case sequences, from programs and comparing them using sequence alignment, a procedure which has been intensively studied in the field of bio-informatics. This idea...

    Provided By University of California, Santa Cruz

  • White Papers // May 2012

    In the Blink of an Eye: There Goes Your AES Key

    This paper is a short summary of a real world AES key extraction performed on a military grade FPGA marketed as 'Virtually unbreakable' and 'Highly secure'. The authors demonstrated that it is possible to extract the AES key from the Actel/Microsemi ProASIC3 chip in a time of 0.01 seconds using...

    Provided By University of California, Santa Cruz

  • White Papers // Mar 2012

    Social Authentication: Harder Than it Looks

    A number of web service firms have started to authenticate users via their social knowledge, such as whether they can identify friends from photos. The authors investigate attacks on such schemes. First, attackers often know a lot about their targets; most people seek to keep sensitive information private from others...

    Provided By University of California, Santa Cruz

  • White Papers // Mar 2012

    The Quest to Replace Passwords: A Framework for Comparative Evaluation of Web Authentication Schemes

    The authors evaluate two decades of proposals to replace text passwords for general-purpose user authentication on the web using a broad set of twenty-five usability, deploy ability and security benefits that an ideal scheme might provide. The scope of proposals they survey is also extensive, including password management software, federated...

    Provided By University of California, Santa Cruz

  • White Papers // Feb 2012

    Random Coding Bounds That Attain the Joint Source-Channel Exponent

    This paper presents a random-coding upper bound on the average error probability of joint source-channel coding that attains Csiszars error exponent. The bound is based on a code construction for which source messages are assigned to disjoint subsets (classes), and code-words generated according to a distribution that depends on the...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    A Birthday Present Every Eleven Wallets? the Security of Customer-Chosen Banking PINs

    The authors provide the first published estimates of the difficulty of guessing a human-chosen 4-digit PIN. They begin with two large sets of 4-digit sequences chosen outside banking for online passwords and Smartphone unlock-codes. They use a regression model to identify a small number of dominant factors influencing user choice....

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    ThinkAir: Dynamic Resource Allocation and Parallel Execution in Cloud for Mobile Code Offloading

    Smartphones have exploded in popularity in recent years, becoming ever more sophisticated and capable. As a result, developers worldwide are building increasingly complex applications that require ever increasing amounts of computational power and energy. In this paper the authors propose ThinkAir, a framework that makes it simple for developers to...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    HELIX: Automatic Parallelization of Irregular Programs for Chip Multiprocessing

    The authors describe and evaluate HELIX, a new technique for automatic loop parallelization that assigns successive iterations of a loop to separate threads. They show that the inter-thread communication costs forced by loop-carried data dependences can be mitigated by code optimization, by using an effective heuristic for selecting loops to...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    On the Benefit of Using Tight Frames for Robust Data Transmission and Compressive Data Gathering in Wireless Sensor Networks

    Compressive Sensing (CS), a new sampling paradigm, has recently found several applications in Wireless Sensor Networks (WSNs). In this paper, the authors investigate the design of novel sensing matrices which lead to good expected-case performance - a typical performance indicator in practice - rather than the conventional worst-case performance that...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2010

    SMART: A Scalable Multipath Architecture for Intra-Domain QoS Provisioning

    The main concern with the IETF proposed Intserv architecture is that the use of per-flow routing and reservation state in tile routers may not be scalable to high-speed backbone networks. This paper proposes the Scalable Multipath Aggregated RouTing (SMART) architecture that aggregates flows along multipaths such that the per-flow reservation...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2010

    Knowledge Management in Call Centers: How Routing Rules Influence Expertise and Service Quality

    In a call center, customers are assigned to service agents by routing policies that seek to balance several objectives. Usually, these policies follow myopic rules in order to minimize the waiting time or maximize the quality experienced by the next customer. However, there is a secondary effect of the routing...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2009

    Financial Capital Injections Among New Black And White Business Ventures: Evidence From The Kauffman Firm Survey

    This paper uses new panel data from the Kauffman Firm Survey to examine racial differences in the incidence and determinants of financial capital use among young firms. The author finds a heavy reliance on owner's equity at startup that declines substantially in subsequent years, whereas the reliance on outsider debt...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2011

    A Distributed Approach for Multi-Constrained Path Selection and Routing Optimization

    Multi-Constrained Path (MCP) selection, in which the key objective is to search for feasible paths satisfying multiple routing constraints simultaneously, is known to be an NP-Complete problem. Multi-Constrained Path Optimization (MCPO) is different from MCP mainly in that, the feasible paths selected should also be optimal with regard to an...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2014

    Confidentiality Issues on a GPU in a Virtualized Environment

    General-Purpose computing on Graphics Processing Units (GPGPU) combined to cloud computing is already a commercial success. However, there is little literature that investigates its security implications. Their objective is to highlight possible information leakage due to GPUs in virtualized and cloud computing environments. The authors provide insight into the different...

    Provided By University of California, Santa Cruz

  • White Papers // Feb 2008

    Evaluating Business Intelligence Platforms: a case study

    Modern Business Intelligence (BI) technologies are tightly integrated, easily, and widely deployed and usable for they are based on prepackaged application solutions. The paper examines some common platforms supporting Business Intelligence (BI) activities in order to state evaluation criteria for the system choice. The evaluation considers a software measurement method...

    Provided By University of California, Santa Cruz

  • White Papers // Sep 2011

    A Reconfigurable Cache for Energy Efficiency

    The power dissipation of modern microprocessors is a primary design constraint across all processing domains, from embedded devices to high performance chips. On-chip caches often consume a significant fraction of the total processor energy budget. Allowing adaptation to the running workload can significantly lower their energy consumption. In this paper,...

    Provided By University of California, Santa Cruz

  • White Papers // Oct 2012

    Full System Simulation of Optically Interconnected Chip Multiprocessors Using gem5

    It has been shown that optical Network-on-Chip (NoC) can reduce power consumption of Chip Multi-Processors (CMP), popularly known as multicore processors. Typically, these networks are evaluated for latency and throughput using simulation of either synthetic traffic patterns or trace data, the latter coming from either real systems or computer architecture...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2014

    Verifying ARM6 Multiplication

    This paper discusses the ARM6 implementation of the multiply instructions, and the formal verification using the HOL proof system. For information about the ARM architecture the reader is referred to Furber and the ARM (Architecture Reference Manual). The verification of the block data transfer instruction class and all of the...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2007

    Programming Language Design and Analysis Motivated by Hardware Evolution

    Silicon chip design has passed a threshold whereby exponentially increasing transistor density no longer translates into increased processing power for single-processor architectures. Moore's Law now expresses itself as an exponentially increasing number of processing cores per fixed-size chip. The authors survey this process and its implications on programming language design...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2014

    JMA: The Java-Multithreading Architecture for Embedded Processors

    Embedded processors are increasingly deployed in applications requiring high performance with good real-time characteristics whilst being low power. Parallelism has to be extracted in order to improve the performance at an architectural level. Extracting instruction level parallelism requires extensive speculation which adds complexity and increases power consumption. Alternatively, parallelism can...

    Provided By University of California, Santa Cruz

  • White Papers // Sep 2011

    Safe Asynchronous Multicore Memory Operations

    Asynchronous memory operations provide a means for coping with the memory wall problem in multicore processors, and are available in many platforms and languages, e.g., the cell broadband engine, CUDA and OpenCL. Reasoning about the correct usage of such operations involves complex analysis of memory accesses to check for races....

    Provided By University of California, Santa Cruz

  • White Papers // Oct 2014

    Higher Order Differentiation Over Finite Fields with Applications to Generalising the Cube Attack

    The original motivation for this paper was to generalize the cube attack from the binary field to arbitrary finite fields. While doing so, the authors developed a number of tools and results for differentiation over finite fields which could have a broader applicability in cryptography. Higher order differentiation was introduced...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2012

    Polymorphic Attacks Against Sequence-Based Software Birthmarks

    Sequence alignment algorithms have recently found a use in detecting code clones, software plagiarism, code theft, and polymorphic malware. This approach involves extracting birthmarks, in this case sequences, from programs and comparing them using sequence alignment, a procedure which has been intensively studied in the field of bio-informatics. This idea...

    Provided By University of California, Santa Cruz

  • White Papers // Mar 2012

    Social Authentication: Harder Than it Looks

    A number of web service firms have started to authenticate users via their social knowledge, such as whether they can identify friends from photos. The authors investigate attacks on such schemes. First, attackers often know a lot about their targets; most people seek to keep sensitive information private from others...

    Provided By University of California, Santa Cruz

  • White Papers // Nov 2013

    Efficient Template Attacks

    Template attacks remain a powerful side-channel technique to eavesdrop on tamper-resistant hardware. They model the probability distribution of leaking signals and noise to guide a search for secret data values. In practice, several numerical obstacles can arise when implementing such attacks with multivariate normal distributions. The authors propose efficient methods...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    ThinkAir: Dynamic Resource Allocation and Parallel Execution in Cloud for Mobile Code Offloading

    Smartphones have exploded in popularity in recent years, becoming ever more sophisticated and capable. As a result, developers worldwide are building increasingly complex applications that require ever increasing amounts of computational power and energy. In this paper the authors propose ThinkAir, a framework that makes it simple for developers to...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2007

    Information Security Economics - and Beyond

    The economics of information security has recently become a thriving and fast-moving discipline. As distributed systems are assembled from machines belonging to principals with divergent interests, incentives are becoming as important to dependability as technical design. The new field provides valuable insights not just into 'Security' topics such as privacy,...

    Provided By University of California, Santa Cruz

  • White Papers // May 2008

    Authentication of FPGA Bitstreams: Why and How

    Encryption of volatile Field Programmable Gate Arrays (FPGA) bitstreams provides confidentiality to the design but does not ensure its authenticity. This paper motivates the need for adding authentication to the configuration process by providing application examples where this functionality is useful. An examination of possible solutions is followed by suggesting...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2009

    The Frequency Injection Attack on Ring-Oscillator-Based True Random Number Generators

    Random numbers are a vital part of many cryptographic protocols. Without randomness, transactions are deterministic and may be cloned or modified. In this paper, the authors outline an attack on the random number generators used in secure hardware. They have devised a frequency injection attack which is able to destroy...

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2013

    Formal Security Modeling in Autonomic Cloud Computing Environment

    The notions of Autonomic Components (ACs) and Autonomic-Component Ensembles (ACEs) have been put forward as a means to structure a system into well understood, independent and distributed building blocks that interact in specified ways. Autonomic systems exhibit the ability of self-monitoring, self-repairing, and self-optimizing by constantly sensing themselves and tuning...

    Provided By University of California, Santa Cruz

  • White Papers // May 2010

    Flash Memory 'Bumping' Attacks

    In this paper the authors introduce a new class of optical fault injection attacks called bumping attacks. These attacks are aimed at data extraction from secure embedded memory, which usually stores critical parts of algorithms, sensitive data and cryptographic keys. As a security measure, read-back access to the memory is...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    HELIX: Automatic Parallelization of Irregular Programs for Chip Multiprocessing

    The authors describe and evaluate HELIX, a new technique for automatic loop parallelization that assigns successive iterations of a loop to separate threads. They show that the inter-thread communication costs forced by loop-carried data dependences can be mitigated by code optimization, by using an effective heuristic for selecting loops to...

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2013

    Security Reverse Engineering of Mobile Operating Systems: A Summary

    As small form-factor networking-enabled cellular devices proliferate in both consumer and corporate market segments, security concerns gradually come to the fore due to their frequent use for storing sensitive financial, personal or work-related data. Security is further hampered by version erosion which gives rise to exploiting known vulnerabilities, closed-source nature...

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2013

    Honeypot as the Intruder Detection System

    In this paper, the authors show possible implementation of honeypot in local network. The honeypot works as the 0-day malware detection system. It implements many of active or semi-active traps in local area network and DMZ in the company network. There are not defined the legal trace to the honeypot....

    Provided By University of California, Santa Cruz

  • White Papers // Mar 2012

    The Quest to Replace Passwords: A Framework for Comparative Evaluation of Web Authentication Schemes

    The authors evaluate two decades of proposals to replace text passwords for general-purpose user authentication on the web using a broad set of twenty-five usability, deploy ability and security benefits that an ideal scheme might provide. The scope of proposals they survey is also extensive, including password management software, federated...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2010

    Inglorious Installers: Security in the Application Marketplace

    From mobile phones to social networks, installing and running third-party applications can be risky. Installing applications often requires running unverified, untrustworthy code with the privilege of a system administrator, allowing it to compromise the security of user data and the operating system. Once installed, applications on most platforms can access...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2014

    FlowR: Aspect Oriented Programming for Information Flow Control in Ruby

    In this paper, the authors report on their experience with providing Information Flow Control (IFC) as a library. Their aim was to support the use of an unmodified Platform-as-a-Service (PaaS) cloud infrastructure by IFC-aware web applications. They discuss how Aspect Oriented Programming (AOP) overcomes the limitations of RubyTrack, their first...

    Provided By University of California, Santa Cruz

  • White Papers // Apr 2009

    Satori: Enlightened Page Sharing

    The authors introduce Satori, an efficient and effective system for sharing memory in virtualized systems. Satori uses enlightenments in guest operating systems to detect sharing opportunities and manage the surplus memory that results from sharing. Their approach has three key benefits over existing systems: it is better able to detect...

    Provided By University of California, Santa Cruz

  • White Papers // Jun 2013

    Rewritable Storage Channels with Hidden State

    Many storage channels admit reading and rewriting of the content at a given cost. The authors consider rewritable channels with a hidden state which models the unknown characteristics of the memory cell. In addition to mitigating the effect of the write noise, rewrites can help the write controller obtain a...

    Provided By University of California, Santa Cruz

  • White Papers // Feb 2014

    The Random Forest Kernel and Creating Other Kernels for Big Data From Random Partitions

    The authors present random partition Kernels, a new class of kernels derived by demonstrating a natural connection between random partitions of objects and kernels between those objects. They show how the construction can be used to create kernels from methods that would not normally be viewed as random partitions, such...

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2012

    A Random Walk Around the City: New Venue Recommendation in Location-Based Social Networks

    The popularity of location-based social networks available on mobile devices means that large, rich datasets that contain a mixture of behavioral (users visiting venues), social (links between users), and spatial (distances between venues) information are available for mobile location recommendation systems. However, these datasets greatly differ from those used in...

    Provided By University of California, Santa Cruz

  • White Papers // Dec 2011

    SenShare: Transforming Sensor Networks Into Multi-Application Sensing Infrastructures

    Sensor networks are typically purpose-built, designed to support a single running application. As the demand for applications that can harness the capabilities of a sensor-rich environment increases, and the availability of sensing infrastructure put in place to monitor various quantities soars, there are clear benefits in a model where infrastructure...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    Centrality Prediction in Dynamic Human Contact Networks

    Real technological, social and biological networks evolve over time. Predicting their future topology has applications to epidemiology, targeted marketing, network reliability and routing in ad-hoc and peer-to-peer networks. The key problem for such applications is usually to identify the nodes that will be in more important positions in the future....

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    Monte Carlo-Based Bayesian Group Object Tracking and Causal Reasoning

    The authors present algorithms for tracking and reasoning of local traits in the subsystem level based on the observed emergent behavior of multiple coordinated groups in potentially cluttered environments. Their proposed Bayesian inference schemes, which are primarily based on (Markov chain) Monte Carlo sequential methods, include: an evolving network-based multiple...

    Provided By University of California, Santa Cruz

  • White Papers // Jul 2011

    Penalized L1 Minimization for Reconstruction of Time-Varying Sparse Signals

    Most practical signals of interest have a sparse representation if they are transformed into a suitable basis. The transformed signal can then be compressed, but this wastes resources as most of the sampled information is discarded after compression. Compressive Sensing (CS) leverages the compressibility of the signal by directly acquiring...

    Provided By University of California, Santa Cruz

  • White Papers // Dec 2010

    Energy Efficient Signal Acquisition Via Compressive Sensing in Wireless Sensor Networks

    This paper presents a novel approach based on the Compressive Sensing (CS) framework to monitor 1-D environmental information using a Wireless Sensor Network (WSN). The proposed method exploits the compressibility of the signal to reduce the number of samples required to recover the sampled signal at the Fusion Center (FC)...

    Provided By University of California, Santa Cruz

  • White Papers // Aug 2011

    Energy Efficient Signal Acquisition in Wireless Sensor Networks : A Compressive Sensing Framework

    The sampling rate of the sensors in Wireless Sensor Networks (WSNs) determines the rate of its energy consumption since most of the energy is used in sampling and transmission. To save the energy in WSNs and thus prolong the network lifetime, the authors present a novel approach based on the...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    On the Benefit of Using Tight Frames for Robust Data Transmission and Compressive Data Gathering in Wireless Sensor Networks

    Compressive Sensing (CS), a new sampling paradigm, has recently found several applications in Wireless Sensor Networks (WSNs). In this paper, the authors investigate the design of novel sensing matrices which lead to good expected-case performance - a typical performance indicator in practice - rather than the conventional worst-case performance that...

    Provided By University of California, Santa Cruz

  • White Papers // Jan 2012

    On the Design of Optimized Projections for Sensing Sparse Signals in Overcomplete Dictionaries

    Sparse signals can be sensed with a reduced number of random projections and then reconstructed if Compressive Sensing (CS) is employed. Traditionally, the projection matrix has been chosen as a random Gaussian matrix, but improved reconstruction performance can be obtained by optimizing the projection matrix. In this paper, the authors...

    Provided By University of California, Santa Cruz