Entity

Time filter

Source Type

Tokyo, Japan

Internet Initiative Japan Inc. is a telecommunications company based in Tokyo, Japan. Established on December 3, 1992, it employs 1,715 people and has a capitalization of ¥14,295,000,000. They provide internet connectivity and network-related services, network systems construction, operation and maintenance, development and sales of telecommunication equipment. They are an IPv6 Tunnel Broker providing IP tunneling between the U.S. and Japan. Wikipedia.


Cittadini L.,Third University of Rome | Muhlbauer W.,ETH Zurich | Uhlig S.,TU Berlin | Bush R.,Internet Initiative Japan | And 2 more authors.
IEEE Journal on Selected Areas in Communications | Year: 2010

Internet routing table size growth and BGP update churn are two prominent Internet scaling issues. There is widespread belief in a high and fast growing number of ASs that deaggregate prefixes, e.g., due to multi-homing and for the purpose of traffic engineering. Moreover, researchers often blame specific classes of ASs for generating a disproportionate amount of BGP updates. Our primary objective is to challenge such widespread assumptions ("myths") and not solely to confirm previous findings [1]-[3]. Surprisingly, we find severe discrepancies between existing myths and reality. According to our results, there is no trend towards more aggressive prefix deaggregation or traffic engineering over time. With respect to update dynamics, we observe that deaggregated prefixes generally do not generate a disproportionate number of BGP updates, with respect to their share of the BGP routing table. On the other side, we observe much more widespread traffic engineering in the form of AS path prepending and scoped advertisements compared to previous studies [1]. Overall, our work gives a far more positive picture compared to the alarming discourses typically heard [1], [2], [4]: The impact of "bad guys" on routing table size growth and BGP churn has not changed for the worse in recent years. Rather, it increases at the same pace as the Internet itself. © 2006 IEEE. Source


Zhang Z.,Purdue University | Zhang Y.,University of Michigan | Hu Y.C.,Purdue University | Mao Z.M.,University of Michigan | Bush R.,Internet Initiative Japan
IEEE/ACM Transactions on Networking | Year: 2010

IP prefix hijacking remains a major threat to the security of the Internet routing system due to a lack of authoritative prefix ownership information. Despite many efforts in designing IP prefix hijack detection schemes, no existing design can satisfy all the critical requirements of a truly effective system: real-time, accurate, lightweight, easily and incrementally deployable, as well as robust in victim notification. In this paper, we present a novel approach that fulfills all these goals by monitoring network reachability from key external transit networks to one's own network through lightweight prefix-owner-based active probing. Using the prefix-owner's view of reachability, our detection system, iSPY, can differentiate between IP prefix hijacking and network failures based on the observation that hijacking is likely to result in topologically more diverse polluted networks and unreachability. Through detailed simulations of Internet routing, 25-day deployment in 88 autonomous systems (ASs) (108 prefixes), and experiments with hijacking events of our own prefix from multiple locations, we demonstrate that iSPY is accurate with false negative ratio below 0.45% and false positive ratio below 0.17%. Furthermore, iSPY is truly real-time; it can detect hijacking events within a few minutes. © 1993-2012 IEEE. Source


Suga Y.,Internet Initiative Japan
Frontiers in Artificial Intelligence and Applications | Year: 2015

Visual secret sharing scheme with access structure based on graph has been proposed and this can be considered as an extension of (2,n)-threshold VSS scheme. Ateniese et al. showed a decomposition method that we decompose star graphs from a given graph which edges are specified by qualified sets, that is two participants (vertices in a given graph) has a common edge if and only if participants can reconstruct the secret image by stacking the shares each other. This paper classifies graph-based VSS schemes and show several optimal examples and also proposes optimal construction about graph-based VSS scheme for (multiple) q secrets which pixel expansion is less than 3∗q. © 2015 The authors and IOS Press. All rights reserved. Source


Suga Y.,Internet Initiative Japan
Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010 | Year: 2010

In current content delivery service, contents are usually encrypted for access control mechanism, so several key distribution schemes have been proposed. In this paper, we propose a new key derivation scheme for hierarchy-based access control. We assume that content consumers are listed in digraph structure, and all nodes are assigned seeds(pre- keys) for decryption keys. All decryption keys are generated from initial keys assigned in root nodes, and a decryption key is derived from seeds of an ancestor node only using the one-way hash function. The proposed scheme includes conventional hierarchy-based key derivation schemes and can be implemented with low cost in computation for decryption keys because we do not need exponential calculations. © 2010 IEEE. Source


Suga Y.,Internet Initiative Japan
Proceedings - 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013 | Year: 2013

Fast (k, n)-threshold secret sharing schemes with exclusive-OR operations have proposed by Kurihara et al. and Fujii et al. independently. Their method are ideal that share size is equal to the size of the data to be distributed with the benefits that can be handled very fast for using only XOR operation at distribution and restoration processes. In these cases for the number of shares n, target data must be equally divided into individual n-p-1 pieces where n-p is a prime of more than n. Contributions of this paper are the followings: (1) the number of divisions for the original data n-p-1 is able to be less than n-1, (2) the size of the share is able to be smaller than the size of target data, and (3) makes it possible to select the number of shares other than prime numbers. For (1) it is possible to configure as well as assumptions on the conventional method, on the other hand for (2) and (3), to construct shares by introducing a hash function, as well as a conventional XOR operation. In addition, this paper also proposes a simple and efficient method based on the idea of (2) and (3) by reconsidering a (3,2,4) ramp secret sharing scheme proposed by Matsumoto et al. announced in SCIS2012. © 2013 IEEE. Source

Discover hidden collaborations