The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] timestamp(4hit)

1-4hit
  • Token Model and Interpretation Function for Blockchain-Based FinTech Applications Open Access

    Kanta MATSUURA  

     
    INVITED PAPER

      Vol:
    E102-A No:1
      Page(s):
    3-10

    Financial Technology (FinTech) is considered a taxonomy that describes a wide range of ICT (information and communications technology) associated with financial transactions and related operations. Improvement of service quality is the main issue addressed in this taxonomy, and there are a large number of emerging technologies including blockchain-based cryptocurrencies and smart contracts. Due to its innovative nature in accounting, blockchain can also be used in lots of other FinTech contexts where token models play an important role for financial engineering. This paper revisits some of the key concepts accumulated behind this trend, and shows a generalized understanding of the technology using an adapted stochastic process. With a focus on financial instruments using blockchain, research directions toward stable applications are identified with the help of a newly proposed stabilizer: interpretation function of token valuation. The idea of adapted stochastic process is essential for the stabilizer, too.

  • Online Timing Correlation of Streaming Data with Uncertain Timestamps

    Chan-gun LEE  Aloysius K. MOK  Prabhudev KONANA  

     
    PAPER-Dependable Computing

      Vol:
    E92-D No:6
      Page(s):
    1260-1267

    We introduce the interval timing correlation, which can establish timing correlation conditions to handle interval timing timestamps. Interval timestamps are adopted to handle the temporal uncertainties in the timestamps of stream data. A probabilistic querying approach is taken in order to support timing predicates such as deadline, delay, and within over interval timestamps. A timing correlation condition entails a desired confidence threshold (minimum satisfaction probability). We define the interval timing correlation and discuss how to implement the algorithm. We present an analysis result which can effectively identify only tuples that need to be considered in determining the correlation. The performance of the proposed algorithm is shown.

  • Application-Coexistent Wire-Rate Network Monitor for 10 Gigabit-per-Second Network

    Kenji SHIMIZU  Tsuyoshi OGURA  Tetsuo KAWANO  Hiroyuki KIMIYAMA  Mitsuru MARUYAMA  Keiichi KOYANAGI  

     
    PAPER

      Vol:
    E89-D No:12
      Page(s):
    2875-2885

    To apply network monitoring functions to emerging high-quality video streaming services, we proposed an application-coexistent monitor (APCM). In APCM, a streaming server can works as an active monitor and a passive monitor. In addition, IP packets sent from the server carry monitoring information together with application's data such as video signals. To achieve APCM on a 10-Gbps network, we developed a network interface card for an application-coexistent wire-rate network monitor (AWING NIC). It provides (1) a function to append GPS-based accurate timestamps to every packet that streaming applications send and receive, which can be used for real-time monitoring of delays and inter-packet gap, and (2) functions to capture and generate 10-Gbps wire-rate traffic without depending on packets' size, achieved by our highly-efficient DMA-transfer mechanisms. Such monitoring capability are unprecedented in existing PC-based systems because of the limitation in PC system's architecture. As an evaluation of APCM in an actual network, we conducted an experiment to transmit a 6-Gbps high-quality video stream over an IP network with the system in which we installed the AWING NIC. The results revealed that the video stream became highly bursty by passing through the network, and the observed smallest inter-packet gap corresponds to the value of 10-Gbps wire-rate traffic, which supports the effectiveness of our development.

  • Security Verification of Real-Time Cryptographic Protocols Using a Rewriting Approach

    Takehiko TANAKA  Yuichi KAJI  Hajime WATANABE  Toyoo TAKATA  Tadao KASAMI  

     
    PAPER-Software Theory

      Vol:
    E81-D No:4
      Page(s):
    355-363

    A computational model for security verification of cryptographic protocols is proposed. Until most recently, security verification of cryptographic protocols was left to the protocol designers' experience and heuristics. Though some formal verification methods have been proposed for this purpose, they are still insufficient for the verification of practical real-time cryptographic protocols. In this paper we propose a new formalism based on a term rewriting system approach that we have developed. In this model, what and when the saboteur can obtain is expressed by a first-order term of a special form, and time-related concepts such as the passage of time and the causality relation are specified by conditional term rewriting systems. By using our model, a cryptographic protocol which was shown to be secure by the BAN-logic is shown to be insecure.