University of Tokushima

Displaying 1-27 of 27 results

  • White Papers // Oct 2013

    Black Hole Firewalls Require Huge Energy of Measurement

    The unitary moving mirror model is one of the best quantum systems for checking the reasoning of the firewall paradox in quantum black holes. Though the late-time part of radiations emitted from the mirror is fully entangled with the early-part, no AMPS's firewall exists with a deadly, huge average energy...

    Provided By University of Tokushima

  • White Papers // Dec 2012

    On-Line Non-Transferable Signatures

    Undeniable signatures, introduced by the researchers, and designated confirmer signatures, introduced by the researcher, allow a signer to control the verifiability of the user signatures by requiring a verifier to interact with the signer to verify a signature. An important security requirement for these types of signature schemes is non-transferability...

    Provided By University of Tokushima

  • White Papers // Dec 2012

    A Formal Model of LoA Elevation in Online Trust

    In emerging service federations, maintaining security is a key issue for the federation to be widely accepted. Online trust is proposed and built to solve part of this problem. If online trust is established in a federation, sensitive data can be exchanged according to a level for handling the data....

    Provided By University of Tokushima

  • White Papers // Dec 2012

    Relatedness of Given Names

    As a result of the author's need for help in finding a given name for the unborn baby, the Nameling, a search engine for given names, based on data from the "Social Web" was born. Within less than six months, more than 35,000 users accessed Nameling with more than 300,000...

    Provided By University of Tokushima

  • White Papers // Nov 2012

    Automatic Originator Regulation of IMS Multiple Traffic by Stateless Signaling Prioritization

    In emergent situations such as an earthquake, huge traffic from multiple services pours into IP Multimedia Subsystem (IMS) network and leads to a severe congestion problem. To protect IMS network, telecom companies usually take a measure of originator regulation on voice calls. However existing solutions are unable to maximize the...

    Provided By University of Tokushima

  • White Papers // May 2012

    Virtual Cognitive Base Station: Enhancing Software-Based Virtual Router Architecture With Cognitive Radio

    AMPHIBIA is a framework which enables dynamic virtual network provisioning over wired and wireless networks for providing diverse services by coordinated reconfiguration in both sides of wired and wireless networks, exploiting the emerging network virtualization and cognitive radio technologies. AMPHIBIA introduces a new concept of a virtual Cognitive Base Station...

    Provided By University of Tokushima

  • White Papers // May 2012

    Inter-Domain Communication Protocol for Real-Time File Access Monitor of Virtual Machine

    Real-time Virtual Machine (VM) monitoring is now necessary and challenging problem for making ubiquitous virtual machines secure. With the rapid advance of hypervisor such as Xen, Linux KVM and VMWare, VM monitoring technologies have been well developed and researched. However, real-time access monitoring has not been proposed and is still...

    Provided By University of Tokushima

  • White Papers // Mar 2012

    A Space-Time Coding Design for Continuous Phase Modulation Over the Frequency Selective Fading Channel

    In this paper, the authors propose an orthogonal Space-Time Block Coding (STBC) for Continuous Phase Modulation (CPM) over frequency-selective channels. The new method maintains the constant envelope and the phase continuity of the CPM waveforms by inserting three blocks of data-dependent symbols in addition to a Cyclic Prefix (CP). At...

    Provided By University of Tokushima

  • White Papers // Feb 2012

    Asymptotically First-Order Optimal Bandwidth Selection for Di erences of Nonparametric Estimators

    Bandwidth selection procedures based on the asymptotic Approximation of the Mean Squared Error (AMSE) criterion are investigated. The authors present the simultaneous selection method of two distinct bandwidths among a class that encompass the existing methods as special cases. They show that the asymptotic behavior of the AMSE reveals dichotomous...

    Provided By University of Tokushima

  • White Papers // Sep 2011

    RGEM: A Responsive GPGPU Execution Model for Runtime Engines

    General-purpose computing on graphics processing units, also known as GPGPU, is a burgeoning technique to enhance the computation of parallel programs. Applying this technique to real-time applications, however, requires additional support for timeliness of execution. In particular, the non-preemptive nature of GPGPU, associated with copying data to/from the device memory...

    Provided By University of Tokushima

  • White Papers // Sep 2011

    On the (Im)possibility Results for Strong Attack Models for Public Key Cryptsystems

    The security notion of cryptographic primitives can be formalized by the combination of an adversarial goal (GOAL) and an ATtacK model (ATK). Moreover, the securities of schemes are analyzed from the view point of security notion, with or without random oracle, and computational assumptions. For public key encryption scheme, indistinguishability...

    Provided By University of Tokushima

  • White Papers // Jun 2011

    Poplar: A Java Extension for Evolvable Component Integration

    The Java programming language contains many features that aid Component-Based Software Development (CBSD), such as interfaces, visibility levels, and strong support for encapsulation. However, component evolution often causes so-called breaking changes, largely because of the rigidity of component interconnections in the form of explicit method calls and field accesses. The...

    Provided By University of Tokushima

  • White Papers // Apr 2011

    TimeGraph: GPU Scheduling for Real-Time Multi-Tasking Environments

    The Graphics Processing Unit (GPU) is now commonly used for graphics and data-parallel computing. As more and more applications tend to accelerate on the GPU in multi-tasking environments where multiple tasks access the GPU concurrently, operating systems must provide prioritization and isolation capabilities in GPU resource management, particularly in real-time...

    Provided By University of Tokushima

  • White Papers // Jan 2011

    On Black-Box Separations among Injective One-Way Functions

    A One-Way Permutation (OWP) is one of the most fundamental cryptographic primitives, and can be used as a building block for most of basic symmetric-key cryptographic primitives. However, despite its importance and usefulness, previous black-box separation results have shown that constructing an OWP from another primitive seems hopeless, unless building...

    Provided By University of Tokushima

  • White Papers // Dec 2010

    Parallel Decryption Queries in Bounded Chosen Ciphertext Attacks

    Whether it is possible to construct a Chosen Ciphertext Attacks secure (CCA secure) Public Key Encryption (PKE) scheme only from a Chosen Plaintext Attacks secure (CPA secure) one is a fundamental open problem, and the best known positive results regarding this problem are the constructions of so-called bounded CCA secure...

    Provided By University of Tokushima

  • White Papers // Dec 2010

    Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption

    In this paper the authors propose generic conversions for transforming a Chosen-Plaintext Attack (CPA) secure Attribute-Based Encryption (ABE) to a Chosen-Ciphertext Attack (CCA) secure ABE. The only known generic conversion, to the best of their knowledge, was presented by researcher in ACM-CCS 2006, which itself subsumes the well-known IBE-to-PKE conversion...

    Provided By University of Tokushima

  • White Papers // Sep 2010

    OverCourt: DDoS Mitigation Through Credit-Based Traffic Segregation and Path Migration

    Distributed Denial of Service (DDoS) attacks have become one of the most serious threats to the Internet. To mitigate DDoS attacks, much progress has been made in developing currency-based solutions, where a sender is required to spend resources such as computational cost, bandwidth, prior knowledge, and human actions to purchase...

    Provided By University of Tokushima

  • White Papers // May 2010

    A Loadable Task Execution Recorder for Linux

    In this paper, the authors present a task recorder for Linux-based operating systems, in the form of a loadable kernel module. To the best of their knowledge, this is the first Linux task recorder which does not require kernel patches (kernel modifications). This complies with the requirements in the area...

    Provided By University of Tokushima

  • White Papers // Apr 2010

    AIRS: Supporting Interactive Real-Time Applications on Multicore Platforms

    Modern real-time systems increasingly operate with multiple interactive applications. While these systems often require reliable Quality-of-Service (QoS) for the applications, even under heavy workloads, many existing CPU schedulers are not very capable of satisfying such requirements. In this paper, the authors design and implement an Advanced Interactive and Real-time Scheduler...

    Provided By University of Tokushima

  • White Papers // Nov 2009

    Supporting Skill Awareness for Runners Through Wireless Sensor Network

    Running is regarded as effective sports in promoting health under heightened concerns about health. An opportunity of group pace-training among runners is increasing around their daily training field. In the past some of existing researches about skill science treat individuals and ideal space for reasons involving some technical constraint. However...

    Provided By University of Tokushima

  • White Papers // Oct 2009

    A Loadable Real-Time Scheduler Suite for Multicore Platforms

    Linux has received considerable attention in the embedded real-time systems domain recently, given that rich software libraries and device drivers are available. An issue of concern is, however, that the Linux kernel is not very capable of satisfying real-time systems requirements, particularly in the multicore context. In this paper, the...

    Provided By University of Tokushima

  • White Papers // Sep 2009

    Gang EDF Scheduling of Parallel Task Systems

    The preemptive real-time scheduling of sporadic parallel task systems is studied. The authors present an algorithm, called Gang EDF, which applies the Earliest-Deadline-First (EDF) policy to the traditional Gang scheduling scheme. They also provide schedulability analysis of Gang EDF. Specifically, the total amount of interference that is necessary to cause...

    Provided By University of Tokushima

  • White Papers // Aug 2009

    Distributed Source Coding of Correlated Gaussian Remote Sources

    In multi-user source networks distributed coding of correlated information sources is a form of communication system which is significant from both theoretical and practical point of view. The first fundamental theory in those coding systems was established by Slepian and Wolf. They considered a distributed source coding system of two...

    Provided By University of Tokushima

  • White Papers // May 2009

    UOA: User-Oriented-Addressing for Slice Computing

    Sharing computing resources over the Internet has become a popular approach for creating innovative network services. This emerging model of using networked computers is called "Slice computing". The term "Slice" refers to an intuitive description for the collection of isolated resources. Isolation in namespace, security and performance is the key...

    Provided By University of Tokushima

  • White Papers // Apr 2009

    Semi-Partitioned Scheduling of Sporadic Task Systems on Multiprocessors

    In this paper, the authors present a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, they...

    Provided By University of Tokushima

  • White Papers // Dec 2007

    Proxy Signatures Secure Against Proxy Key Exposure

    The authors provide an enhanced security model for proxy signatures that captures a more realistic set of attacks than previous models of the researchers. Their model is motivated by concrete attacks on existing schemes in scenarios in which proxy signatures are likely to be used. They provide a generic construction...

    Provided By University of Tokushima

  • White Papers // Sep 2006

    Forward-Secure and Searchable Broadcast Encryption with Short Ciphertexts and Private Keys

    Broadcast Encryption (BE) scheme allows a broadcaster to encrypt a message to an arbitrarily designated subset S of all users in the system. The authors introduce a primitive called Hierarchical Identity-Coupling Broadcast Encryption (HICBE) that can be used for constructing efficient collusion-resistant public-key broadcast encryption schemes with extended properties such...

    Provided By University of Tokushima

  • White Papers // May 2012

    Inter-Domain Communication Protocol for Real-Time File Access Monitor of Virtual Machine

    Real-time Virtual Machine (VM) monitoring is now necessary and challenging problem for making ubiquitous virtual machines secure. With the rapid advance of hypervisor such as Xen, Linux KVM and VMWare, VM monitoring technologies have been well developed and researched. However, real-time access monitoring has not been proposed and is still...

    Provided By University of Tokushima

  • White Papers // Sep 2009

    Gang EDF Scheduling of Parallel Task Systems

    The preemptive real-time scheduling of sporadic parallel task systems is studied. The authors present an algorithm, called Gang EDF, which applies the Earliest-Deadline-First (EDF) policy to the traditional Gang scheduling scheme. They also provide schedulability analysis of Gang EDF. Specifically, the total amount of interference that is necessary to cause...

    Provided By University of Tokushima

  • White Papers // Apr 2009

    Semi-Partitioned Scheduling of Sporadic Task Systems on Multiprocessors

    In this paper, the authors present a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, they...

    Provided By University of Tokushima

  • White Papers // May 2010

    A Loadable Task Execution Recorder for Linux

    In this paper, the authors present a task recorder for Linux-based operating systems, in the form of a loadable kernel module. To the best of their knowledge, this is the first Linux task recorder which does not require kernel patches (kernel modifications). This complies with the requirements in the area...

    Provided By University of Tokushima

  • White Papers // Oct 2009

    A Loadable Real-Time Scheduler Suite for Multicore Platforms

    Linux has received considerable attention in the embedded real-time systems domain recently, given that rich software libraries and device drivers are available. An issue of concern is, however, that the Linux kernel is not very capable of satisfying real-time systems requirements, particularly in the multicore context. In this paper, the...

    Provided By University of Tokushima

  • White Papers // Nov 2009

    Supporting Skill Awareness for Runners Through Wireless Sensor Network

    Running is regarded as effective sports in promoting health under heightened concerns about health. An opportunity of group pace-training among runners is increasing around their daily training field. In the past some of existing researches about skill science treat individuals and ideal space for reasons involving some technical constraint. However...

    Provided By University of Tokushima

  • White Papers // Aug 2009

    Distributed Source Coding of Correlated Gaussian Remote Sources

    In multi-user source networks distributed coding of correlated information sources is a form of communication system which is significant from both theoretical and practical point of view. The first fundamental theory in those coding systems was established by Slepian and Wolf. They considered a distributed source coding system of two...

    Provided By University of Tokushima

  • White Papers // May 2012

    Virtual Cognitive Base Station: Enhancing Software-Based Virtual Router Architecture With Cognitive Radio

    AMPHIBIA is a framework which enables dynamic virtual network provisioning over wired and wireless networks for providing diverse services by coordinated reconfiguration in both sides of wired and wireless networks, exploiting the emerging network virtualization and cognitive radio technologies. AMPHIBIA introduces a new concept of a virtual Cognitive Base Station...

    Provided By University of Tokushima

  • White Papers // Mar 2012

    A Space-Time Coding Design for Continuous Phase Modulation Over the Frequency Selective Fading Channel

    In this paper, the authors propose an orthogonal Space-Time Block Coding (STBC) for Continuous Phase Modulation (CPM) over frequency-selective channels. The new method maintains the constant envelope and the phase continuity of the CPM waveforms by inserting three blocks of data-dependent symbols in addition to a Cyclic Prefix (CP). At...

    Provided By University of Tokushima

  • White Papers // Jun 2011

    Poplar: A Java Extension for Evolvable Component Integration

    The Java programming language contains many features that aid Component-Based Software Development (CBSD), such as interfaces, visibility levels, and strong support for encapsulation. However, component evolution often causes so-called breaking changes, largely because of the rigidity of component interconnections in the form of explicit method calls and field accesses. The...

    Provided By University of Tokushima

  • White Papers // Dec 2012

    A Formal Model of LoA Elevation in Online Trust

    In emerging service federations, maintaining security is a key issue for the federation to be widely accepted. Online trust is proposed and built to solve part of this problem. If online trust is established in a federation, sensitive data can be exchanged according to a level for handling the data....

    Provided By University of Tokushima

  • White Papers // Dec 2012

    Relatedness of Given Names

    As a result of the author's need for help in finding a given name for the unborn baby, the Nameling, a search engine for given names, based on data from the "Social Web" was born. Within less than six months, more than 35,000 users accessed Nameling with more than 300,000...

    Provided By University of Tokushima

  • White Papers // Nov 2012

    Automatic Originator Regulation of IMS Multiple Traffic by Stateless Signaling Prioritization

    In emergent situations such as an earthquake, huge traffic from multiple services pours into IP Multimedia Subsystem (IMS) network and leads to a severe congestion problem. To protect IMS network, telecom companies usually take a measure of originator regulation on voice calls. However existing solutions are unable to maximize the...

    Provided By University of Tokushima

  • White Papers // Sep 2011

    On the (Im)possibility Results for Strong Attack Models for Public Key Cryptsystems

    The security notion of cryptographic primitives can be formalized by the combination of an adversarial goal (GOAL) and an ATtacK model (ATK). Moreover, the securities of schemes are analyzed from the view point of security notion, with or without random oracle, and computational assumptions. For public key encryption scheme, indistinguishability...

    Provided By University of Tokushima

  • White Papers // Feb 2012

    Asymptotically First-Order Optimal Bandwidth Selection for Di erences of Nonparametric Estimators

    Bandwidth selection procedures based on the asymptotic Approximation of the Mean Squared Error (AMSE) criterion are investigated. The authors present the simultaneous selection method of two distinct bandwidths among a class that encompass the existing methods as special cases. They show that the asymptotic behavior of the AMSE reveals dichotomous...

    Provided By University of Tokushima

  • White Papers // May 2009

    UOA: User-Oriented-Addressing for Slice Computing

    Sharing computing resources over the Internet has become a popular approach for creating innovative network services. This emerging model of using networked computers is called "Slice computing". The term "Slice" refers to an intuitive description for the collection of isolated resources. Isolation in namespace, security and performance is the key...

    Provided By University of Tokushima

  • White Papers // Oct 2013

    Black Hole Firewalls Require Huge Energy of Measurement

    The unitary moving mirror model is one of the best quantum systems for checking the reasoning of the firewall paradox in quantum black holes. Though the late-time part of radiations emitted from the mirror is fully entangled with the early-part, no AMPS's firewall exists with a deadly, huge average energy...

    Provided By University of Tokushima

  • White Papers // Sep 2010

    OverCourt: DDoS Mitigation Through Credit-Based Traffic Segregation and Path Migration

    Distributed Denial of Service (DDoS) attacks have become one of the most serious threats to the Internet. To mitigate DDoS attacks, much progress has been made in developing currency-based solutions, where a sender is required to spend resources such as computational cost, bandwidth, prior knowledge, and human actions to purchase...

    Provided By University of Tokushima

  • White Papers // Dec 2010

    Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption

    In this paper the authors propose generic conversions for transforming a Chosen-Plaintext Attack (CPA) secure Attribute-Based Encryption (ABE) to a Chosen-Ciphertext Attack (CCA) secure ABE. The only known generic conversion, to the best of their knowledge, was presented by researcher in ACM-CCS 2006, which itself subsumes the well-known IBE-to-PKE conversion...

    Provided By University of Tokushima

  • White Papers // Dec 2010

    Parallel Decryption Queries in Bounded Chosen Ciphertext Attacks

    Whether it is possible to construct a Chosen Ciphertext Attacks secure (CCA secure) Public Key Encryption (PKE) scheme only from a Chosen Plaintext Attacks secure (CPA secure) one is a fundamental open problem, and the best known positive results regarding this problem are the constructions of so-called bounded CCA secure...

    Provided By University of Tokushima

  • White Papers // Dec 2012

    On-Line Non-Transferable Signatures

    Undeniable signatures, introduced by the researchers, and designated confirmer signatures, introduced by the researcher, allow a signer to control the verifiability of the user signatures by requiring a verifier to interact with the signer to verify a signature. An important security requirement for these types of signature schemes is non-transferability...

    Provided By University of Tokushima

  • White Papers // Jan 2011

    On Black-Box Separations among Injective One-Way Functions

    A One-Way Permutation (OWP) is one of the most fundamental cryptographic primitives, and can be used as a building block for most of basic symmetric-key cryptographic primitives. However, despite its importance and usefulness, previous black-box separation results have shown that constructing an OWP from another primitive seems hopeless, unless building...

    Provided By University of Tokushima

  • White Papers // Dec 2007

    Proxy Signatures Secure Against Proxy Key Exposure

    The authors provide an enhanced security model for proxy signatures that captures a more realistic set of attacks than previous models of the researchers. Their model is motivated by concrete attacks on existing schemes in scenarios in which proxy signatures are likely to be used. They provide a generic construction...

    Provided By University of Tokushima

  • White Papers // Sep 2006

    Forward-Secure and Searchable Broadcast Encryption with Short Ciphertexts and Private Keys

    Broadcast Encryption (BE) scheme allows a broadcaster to encrypt a message to an arbitrarily designated subset S of all users in the system. The authors introduce a primitive called Hierarchical Identity-Coupling Broadcast Encryption (HICBE) that can be used for constructing efficient collusion-resistant public-key broadcast encryption schemes with extended properties such...

    Provided By University of Tokushima

  • White Papers // Sep 2011

    RGEM: A Responsive GPGPU Execution Model for Runtime Engines

    General-purpose computing on graphics processing units, also known as GPGPU, is a burgeoning technique to enhance the computation of parallel programs. Applying this technique to real-time applications, however, requires additional support for timeliness of execution. In particular, the non-preemptive nature of GPGPU, associated with copying data to/from the device memory...

    Provided By University of Tokushima

  • White Papers // Apr 2011

    TimeGraph: GPU Scheduling for Real-Time Multi-Tasking Environments

    The Graphics Processing Unit (GPU) is now commonly used for graphics and data-parallel computing. As more and more applications tend to accelerate on the GPU in multi-tasking environments where multiple tasks access the GPU concurrently, operating systems must provide prioritization and isolation capabilities in GPU resource management, particularly in real-time...

    Provided By University of Tokushima

  • White Papers // Apr 2010

    AIRS: Supporting Interactive Real-Time Applications on Multicore Platforms

    Modern real-time systems increasingly operate with multiple interactive applications. While these systems often require reliable Quality-of-Service (QoS) for the applications, even under heavy workloads, many existing CPU schedulers are not very capable of satisfying such requirements. In this paper, the authors design and implement an Advanced Interactive and Real-time Scheduler...

    Provided By University of Tokushima