Hyun KWON Changhyun CHO Jun LEE
Deep neural networks (DNNs) provide excellent services in machine learning tasks such as image recognition, speech recognition, pattern recognition, and intrusion detection. However, an adversarial example created by adding a little noise to the original data can result in misclassification by the DNN and the human eye cannot tell the difference from the original data. For example, if an attacker creates a modified right-turn traffic sign that is incorrectly categorized by a DNN, an autonomous vehicle with the DNN will incorrectly classify the modified right-turn traffic sign as a U-Turn sign, while a human will correctly classify that changed sign as right turn sign. Such an adversarial example is a serious threat to a DNN. Recently, an adversarial example with multiple targets was introduced that causes misclassification by multiple models within each target class using a single modified image. However, it has the weakness that as the number of target models increases, the overall attack success rate decreases. Therefore, if there are multiple models that the attacker wishes to attack, the attacker must control the attack success rate for each model by considering the attack priority for each model. In this paper, we propose a priority adversarial example that considers the attack priority for each model in cases targeting multiple models. The proposed method controls the attack success rate for each model by adjusting the weight of the attack function in the generation process while maintaining minimal distortion. We used MNIST and CIFAR10 as data sets and Tensorflow as machine learning library. Experimental results show that the proposed method can control the attack success rate for each model by considering each model's attack priority while maintaining minimal distortion (average 3.95 and 2.45 with MNIST for targeted and untargeted attacks, respectively, and average 51.95 and 44.45 with CIFAR10 for targeted and untargeted attacks, respectively).
Shuhei ENOMOTO Hiroki KUZUNO Hiroshi YAMADA
CPU flush instruction-based cache side-channel attacks (cache instruction attacks) target a wide range of machines. For instance, Meltdown / Spectre combined with FLUSH+RELOAD gain read access to arbitrary data in operating system kernel and user processes, which work on cloud virtual machines, laptops, desktops, and mobile devices. Additionally, fault injection attacks use a CPU cache. For instance, Rowhammer, is a cache instruction attack that attempts to obtain write access to arbitrary data in physical memory, and affects machines that have DDR3. To protect against existing cache instruction attacks, various existing mechanisms have been proposed to modify hardware and software aspects; however, when latest cache instruction attacks are disclosed, these mechanisms cannot prevent these. Moreover, additional countermeasure requires long time for the designing and developing process. This paper proposes a novel mechanism termed FlushBlocker to protect against all types of cache instruction attacks and mitigate against cache instruction attacks employ latest side-channel vulnerability until the releasing of additional countermeasures. FlushBlocker employs an approach that restricts the issuing of cache flush instructions and the attacks that lead to failure by limiting control of the CPU cache. To demonstrate the effectiveness of this study, FlushBlocker was implemented in the latest Linux kernel, and its security and performance were evaluated. Results show that FlushBlocker successfully prevents existing cache instruction attacks (e.g., Meltdown, Spectre, and Rowhammer), the performance overhead was zero, and it was transparent in real-world applications.
Jaewoong HEO Hyunghoon KIM Hyo Jin JO
With the development of in-vehicle network technologies, Automotive Ethernet is being applied to modern vehicles. Scalable service-Oriented MiddlewarE over IP (SOME/IP) is an automotive middleware solution that is used for communications of the infotainment domain as well as that of other domains in the vehicle. However, since SOME/IP lacks security, it is vulnerable to a variety of network-based attacks. In this paper, we introduce a new type of intrusion detection system (IDS) leveraging on SOME/IP packet's header information and packet reception time to deal with SOME/IP related network attacks.
Masaki YOSHII Ryohei BANNO Osamu MIZUNO
New services can use fog nodes to distribute Internet of Things (IoT) data. To distribute IoT data, we apply the publish/subscribe messaging model to a fog computing system. A service provider assigns a unique identifier, called a Tag ID, to a player who owes data. A Tag ID matches multiple IDs and resolves the naming rule for data acquisition. However, when users configure their fog node and distribute IoT data to multiple players, the distributed data may contain private information. We propose a table-based access control list (ACL) to manage data transmission permissions to address this issue. It is possible to avoid unnecessary transmission of private data by using a table-based ACL. Furthermore, because there are fewer data transmissions, table-based ACL reduces traffic. Consequently, the overall system's average processing delay time can be reduced. The proposed method's performance was confirmed by simulation results. Table-based ACL, particularly, could reduce processing delay time by approximately 25% under certain conditions. We also concentrated on system security. The proposed method was used, and a qualitative evaluation was performed to demonstrate that security is guaranteed.
Daiki OGAWA Koichi KOBAYASHI Yuh YAMASHITA
Design of distributed energy management systems composed of several agents such as factories and buildings is important for realizing smart cities. In addition, demand response for saving the power consumption is also important. In this paper, we propose a design method of distributed energy management systems with real-time demand response, in which both electrical energy and thermal energy are considered. Here, we use ADMM (Alternating Direction Method of Multipliers), which is well known as one of the powerful methods in distributed optimization. In the proposed method, demand response is performed in real-time, based on the difference between the planned demand and the actual value. Furthermore, utilizing a blockchain is also discussed. The effectiveness of the proposed method is presented by a numerical example. The importance of introducing a blockchain is pointed out by presenting the adverse effect of tampering the actual value.
For many countries in the world, 5G is of strategic significance. In the 5G era, telecom operators are expected to enable and provide multiple services with different communication characteristics like enhanced broadband, ultra-reliable and extreme real-time communications at the same time. To meet the requirements, the 5G network essentially will be more complex compared with traditional 3G/4G networks. The unique characteristics of 5G resulted from new technologies bring a lot of opportunities as well as significant challenges. In this paper we first introduce 5G vision and check the global status. And then we illustrate the 5G technical essentials and point out the new opportunities that 5G will bring to us. We also highlight the coming challenges and share our 5G experience and solutions toward 5G vision in many aspects, including network, management and business.
The hybrid implicit-explicit single-field finite-difference time-domain (HIE-SF-FDTD) method based on the wave equation of electric field is reformulated in a concise matrix-vector form. The global approximation error of the scheme is discussed theoretically. The second-order convergence of the HIE-SF-FDTD is numerically verified.
Yao ZHOU Hairui YU Wenjie XU Siyi YAO Li WANG Hongshu LIAO Wanchun LI
In this paper, a passive multiple-input multiple-output (MIMO) radar system with widely separated antennas that estimates the positions and velocities of multiple moving targets by utilizing time delay (TD) and doppler shift (DS) measurements is proposed. Passive radar systems can detect targets by using multiple uncoordinated and un-synchronized illuminators and we assume that all the measurements including TD and DS have been known by a preprocessing method. In this study, the algorithm can be divided into three stages. First, based on location information within a certain range and utilizing the DBSCAN cluster algorithm we can obtain the initial position of each target. In the second stage according to the correlation between the TD measurements of each target in a specific receiver and the DSs, we can find the set of DS measurements for each target. Therefore, the initial speed estimated values can be obtained employing the least squares (LS) method. Finally, maximum likelihood (ML) estimation of a first-order Taylor expansion joint TD and DS is applied for a better solution. Extensive simulations show that the proposed algorithm has a good estimation performance and can achieve the Cramér-Rao lower bound (CRLB) under the condition of moderate measurement errors.
Taek Young YOUN Bo Sun KWAK Seungkwang LEE Hyun Sook RHEE
To support secure database management, a number of value-added encryption schemes have been studied including order-revealing encryption (ORE) schemes. One of outstanding features of ORE schemes is the efficiency of range queries in an encrypted form. Compared to existing encryption methods, ORE leads to an increase in the length of ciphertexts. To improve the efficiency of ORE schemes in terms of the length of ciphertext, a new ORE scheme with shorter ciphertext has been proposed by Kim. In this paper, we revisit Kim's ORE scheme and show that the length of ciphertexts is not as short as analyzed in their paper. We also introduce a simple modification reducing the memory requirement than existing ORE schemes.
Gyeongjin RA Su-hyun KIM Imyeong LEE
Recently, the adoption of the industrial Internet of things (IIoT) has optimized many industrial sectors and promoted industry “smartization.” Smart factories and smart industries connect the real and virtual worlds through cyber-physical systems (CPS). However, these linkages will increase the cyber security danger surface to new levels, putting millions of dollars' worth of assets at risk if communications in big network systems like IIoT settings are left unsecured. To solve these problems, the fundamental method is security, such as authentication and confidentiality, and it should require the encryption key. However, it is challenging the security performance with the limited performance of the sensor. Blockchain-based identity management is emerging for lightweight, integrity and persistence. However, the key generation and management issues of blockchain face the same security performance issues. First, through blockchain smart contracts and hierarchical deterministic (HD) wallets, hierarchical key derivation efficiently distributes and manages keys by line and group in the IIoT environment. Second, the pairing verification value based on an elliptic curve single point called Root Signature performs efficient public key certificate registration and verification and improves the key storage space. Third, the identity log recorded through the blockchain is the global transparency of the key lifecycle, providing system reliability from various security attacks. Keyless Signature Infrastructure (KSI) is adopted to perform efficiently via hash-based scheme (hash calendar, hash tree etc.). We analyze our framework compared to hash-based state commitment methods. Accordingly, our method achieves a calculation efficiency of O(nlog N) and a storage space saving of 60% compared to the existing schemes.
Takuma KINUGAWA Toshimitsu USHIO
In spatially distributed systems such as smart buildings and intelligent transportation systems, control of spatio-temporal patterns is an important issue. In this paper, we consider a finite-horizon optimal spatio-temporal pattern control problem where the pattern is specified by a signal spatio-temporal logic formula over finite traces, which will be called an SSTLf formula. We give the syntax and Boolean semantics of SSTLf. Then, we show linear encodings of the temporal and spatial operators used in SSTLf and we convert the problem into a mixed integer programming problem. We illustrate the effectiveness of this proposed approach through an example of a heat system in a room.
Kota YAMASHITA Shotaro KAMIYA Koji YAMAMOTO Yusuke KODA Takayuki NISHIO Masahiro MORIKURA
In this study, a contextual multi-armed bandit (CMAB)-based decentralized channel exploration framework disentangling a channel utility function (i.e., reward) with respect to contending neighboring access points (APs) is proposed. The proposed framework enables APs to evaluate observed rewards compositionally for contending APs, allowing both robustness against reward fluctuation due to neighboring APs' varying channels and assessment of even unexplored channels. To realize this framework, we propose contention-driven feature extraction (CDFE), which extracts the adjacency relation among APs under contention and forms the basis for expressing reward functions in disentangled form, that is, a linear combination of parameters associated with neighboring APs under contention). This allows the CMAB to be leveraged with a joint linear upper confidence bound (JLinUCB) exploration and to delve into the effectiveness of the proposed framework. Moreover, we address the problem of non-convergence — the channel exploration cycle — by proposing a penalized JLinUCB (P-JLinUCB) based on the key idea of introducing a discount parameter to the reward for exploiting a different channel before and after the learning round. Numerical evaluations confirm that the proposed method allows APs to assess the channel quality robustly against reward fluctuations by CDFE and achieves better convergence properties by P-JLinUCB.
Koji ISHIBASHI Takanori HARA Sota UCHIMURA Tetsuya IYE Yoshimi FUJII Takahide MURAKAMI Hiroyuki SHINBO
In this paper, we propose new radio access network (RAN) architecture for reliable millimeter-wave (mmWave) communications, which has the flexibility to meet users' diverse and fluctuating requirements in terms of communication quality. This architecture is composed of multiple radio units (RUs) connected to a common distributed unit (DU) via fronthaul links to virtually enlarge its coverage. We further present grant-free non-orthogonal multiple access (GF-NOMA) for low-latency uplink communications with a massive number of users and robust coordinated multi-point (CoMP) transmission using blockage prediction for uplink/downlink communications with a high data rate and a guaranteed minimum data rate as the technical pillars of the proposed RAN. The numerical results indicate that our proposed architecture can meet completely different user requirements and realize a user-centric design of the RAN for beyond 5G/6G.
Jinyan LU Quanzhen HUANG Shoubing LIU
For intelligent vision measurement, the geometric image feature extraction is an essential issue. Contour primitive of interest (CPI) means a regular-shaped contour feature lying on a target object, which is widely used for geometric calculation in vision measurement and servoing. To realize that the CPI extraction model can be flexibly applied to different novel objects, the one-shot learning based CPI extraction can be implemented with deep convolutional neural network, by using only one annotated support image to guide the CPI extraction process. In this paper, we propose a multi-stage contour primitives of interest extraction network (MS-CPieNet), which uses the multi-stage strategy to improve the discrimination ability of CPI and complex background. Second, the spatial non-local attention module is utilized to enhance the deep features, by globally fusing the image features with both short and long ranges. Moreover, the dense 4-direction classification is designed to obtain the normal direction of the contour, and the directions can be further used for the contour thinning post-process. The effectiveness of the proposed methods is validated by the experiments with the OCP and ROCM datasets. A 2-D measurement experiments are conducted to demonstrate the convenient application of the proposed MS-CPieNet.
Tetsuya IIZUKA Meikan CHIN Toru NAKURA Kunihiro ASADA
This paper proposes a reference-clock-less quick-start-up CDR that resumes from a stand-by state only with a 4-bit preamble utilizing a phase generator with an embedded Time-to-Digital Converter (TDC). The phase generator detects 1-UI time interval by using its internal TDC and works as a self-tunable digitally-controlled delay line. Once the phase generator coarsely tunes the recovered clock period, then the residual time difference is finely tuned by a fine Digital-to-Time Converter (DTC). Since the tuning resolution of the fine DTC is matched by design with the time resolution of the TDC that is used as a phase detector, the fine tuning completes instantaneously. After the initial coarse and fine delay tuning, the feedback loop for frequency tracking is activated in order to improve Consecutive Identical Digits (CID) tolerance of the CDR. By applying the frequency tracking architecture, the proposed CDR achieves more than 100bits of CID tolerance. A prototype implemented in a 65nm bulk CMOS process operates at a 0.9-2.15Gbps continuous rate. It consumes 5.1-8.4mA in its active state and 42μA leakage current in its stand-by state from a 1.0V supply.
An asymmetric zero correlation zone (A-ZCZ) sequence set can be regarded as a special type of ZCZ sequence set, which consists of multiple sequence subsets. Each subset is a ZCZ sequence set, and have a common zero cross-correlation zone (ZCCZ) between sequences from different subsets. This paper supplements an existing construction of A-ZCZ sequence sets and further improves the research results. Besides, a new construction of A-ZCZ sequence sets is proposed by matrices transformation. The obtained sequence sets are optimal with respect to theoretical bound, and the parameters can be chosen more flexibly, such as the number of subsets and the lengths of ZCCZ between sequences from different subsets. Moreover, as the diversity of the orthogonal matrices and the flexibility of initial matrix, more A-ZCZ sequence sets can be obtained. The resultant sequence sets presented in this paper can be applied to multi-cell quasi-synchronous code-division multiple-access (QS-CDMA) systems, to eliminate the interference not only from the same cell but also from adjacent cells.
Koki TSUBOTA Hiroaki AKUTSU Kiyoharu AIZAWA
Image quality assessment (IQA) is a fundamental metric for image processing tasks (e.g., compression). With full-reference IQAs, traditional IQAs, such as PSNR and SSIM, have been used. Recently, IQAs based on deep neural networks (deep IQAs), such as LPIPS and DISTS, have also been used. It is known that image scaling is inconsistent among deep IQAs, as some perform down-scaling as pre-processing, whereas others instead use the original image size. In this paper, we show that the image scale is an influential factor that affects deep IQA performance. We comprehensively evaluate four deep IQAs on the same five datasets, and the experimental results show that image scale significantly influences IQA performance. We found that the most appropriate image scale is often neither the default nor the original size, and the choice differs depending on the methods and datasets used. We visualized the stability and found that PieAPP is the most stable among the four deep IQAs.
Takashi TOMITA Shigeki HAGIHARA Masaya SHIMAKAWA Naoki YONEZAKI
This paper focuses on verification for reactive system specifications. A reactive system is an open system that continuously interacts with an uncontrollable external environment, and it must often be highly safe and reliable. However, realizability checking for a given specification is very costly, so we need effective methods to detect and analyze defects in unrealizable specifications to refine them efficiently. We introduce a systematic characterization on necessary conditions of realizability. This characterization is based on quantifications for inputs and outputs in early and late behaviors and reveals four essential aspects of realizability: exhaustivity, strategizability, preservability and stability. Additionally, the characterization derives new necessary conditions, which enable us to classify unrealizable specifications systematically and hierarchically.
Sangyeop LEE Shuhei AMAKAWA Takeshi YOSHIDA Minoru FUJISHIMA
A power-scalable wideband distributed amplifier is proposed. For reducing the power consumption of this power-hungry amplifier, it is efficient to lower the supply voltage. However, there is a hurdle owing to the transistor threshold voltage. In this work, a CMOS deeply depleted channel process is employed to overcome the hurdle.
Privacy violations via spy cameras are becoming increasingly serious. With the recent advent of various smart home IoT devices, such as smart TVs and robot vacuum cleaners, spycam attacks that steal users' information are being carried out in more unpredictable ways. In this paper, we introduce a new spycam attack on a mobile WebVR environment. It is performed by a web attacker who maliciously accesses the back-facing cameras of victims' mobile devices while they are browsing the attacker's WebVR site. This has the power to allow the attacker to capture victims' surroundings even at the desired field of view through sophisticated content placement in VR scenes, resulting in serious privacy breaches for mobile VR users. In this letter, we introduce a new threat facing mobile VR and show that it practically works with major browsers in a stealthy manner.