Author Search Result

[Author] Koki ABE(4hit)

1-4hit
  • A Semi-Fragile Watermarking Scheme Using Weighted Vote with Sieve and Emphasis for Image Authentication

    Nozomi ISHIHARA  Koki ABE  

     
    PAPER-Information Security

      Vol:
    E90-A No:5
      Page(s):
    1045-1054

    This paper describes a semi-fragile watermarking scheme for image authentication and tamper-proofing. Each watermark bit is duplicated and randomly embedded in the original image in the discrete wavelet domain by modifying the corresponding image coefficients through quantization. The modifications are made so that they have little effect on the image and that the watermarking is robust against tampering. The watermark image for authentication is reconstructed by taking a weighted vote on the extracted bits. The bits that lose the vote are treated as having been tampered with, and the locations of the lost bits as indicating tampered positions. Thus, authentication and tamper-proofing can be done by observing the images of watermarks that win and lose votes. Sieving, emphasis, and weighted vote were found to be effectively make the authentication and tamper detection more accurate. The proposed scheme is robust against JPEG compression or acceptable modifications, but sensitive to malicious attacks such as cutting and pasting.

  • A Cost-Effective Handshake Protocol and Its Implementation for Bundled-Data Asynchronous Circuits

    Masakazu SHIMIZU  Koki ABE  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E89-A No:1
      Page(s):
    280-287

    We propose and implement a four-phase handshake protocol for bundled-data asynchronous circuits with consideration given to power consumption and area. A key aspect is that our protocol uses three phases for generating the matched delay to signal the completion of the data-path stage operation whereas conventional methods use only one phase. A comparison with other protocols at 0.18 µm process showed that our protocol realized lower power consumption than any other protocol at cycle times of 1.2 ns or more. The area of the delay generator required for a given data-path delay was less than half that of other protocols. The overhead of the timing generator was the same as or less than that of other protocols.

  • Parallel Architecture for 2-D Discrete Wavelet Transform with Low Energy Consumption

    Nozomi ISHIHARA  Koki ABE  

     
    PAPER-Digital Signal Processing

      Vol:
    E91-A No:8
      Page(s):
    2068-2075

    A novel two-dimensional discrete wavelet transform (2-DDWT) parallel architecture for higher throughput and lower energy consumption is proposed. The proposed architecture fully exploits full-page burst accesses of DRAM and minimizes the number of DRAM activate and precharge operations. Simulation results revealed that the architecture reduces the number of clock cycles for DRAM memory accesses as well as the DRAM power consumption with moderate cost of internal memory. Evaluation of the VLSI implementation of the architecture showed that the throughput of wavelet filtering was increased by parallelizing row filtering with a minimum area cost, thereby enabling DRAM full-page burst accesses to be exploited.

  • A Protocol Specification-Based Intrusion Detection System for VoIP and Its Evaluation

    Thyda PHIT  Koki ABE  

     
    PAPER-Internet

      Vol:
    E91-B No:12
      Page(s):
    3956-3965

    We propose an architecture of Intrusion Detection System (IDS) for VoIP using a protocol specification-based detection method to monitor the network traffics and alert administrator for further analysis of and response to suspicious activities. The protocol behaviors and their interactions are described by state machines. Traffic that behaves differently from the standard specifications are considered to be suspicious. The IDS has been implemented and simulated using OPNET Modeler, and verified to detect attacks. It was found that our system can detect typical attacks within a reasonable amount of delay time.

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.