Curriculum Vitaes

Jun Kurihara

  (栗原 淳)

Profile Information

Affiliation
Associate Professor, Graduate School of Information Science, University of Hyogo
Software Engineer, Zettant Inc.
Degree
PhD in Engineering(Sep, 2012, Tokyo Institute of Technology)
ME(Mar, 2006, Tokyo Institute of Technology)
BE(Mar, 2004, Tokyo Institute of Technology)

J-GLOBAL ID
201901005849225399
researchmap Member ID
B000351973

External link


Papers

 34
  • Itaru Kurihara, Jun Kurihara, Toshiaki Tanaka
    IEEE Access, 12 69163-69171, May, 2024  Peer-reviewed
  • Ryu Watanabe, Ayumu Kubota, Jun Kurihara, Kouichi Sakurai
    Advanced Information Networking and Applications - Proceedings of the 38th International Conference on Advanced Information Networking and Applications (AINA-2024), Volume 6, 204 LNDECT 385-394, Apr 10, 2024  Peer-reviewed
  • Jun Kurihara, Toshiaki Tanaka, Takeshi Kubo
    Computer Networks, 237 110078, Dec, 2023  Peer-reviewedLead authorCorresponding author
  • Ryu Watanabe, Ayumu Kubota, Jun Kurihara
    Advanced Information Networking and Applications Proceedings of the 37th International Conference on Advanced Information Networking and Applications (AINA-2023), Volume 3, 655 LNNS 585-596, Mar, 2023  Peer-reviewed
  • Ryu Watanabe, Ayumu Kubota, Jun Kurihara
    Advanced Information Networking and Applications - Proceedings of the 36th International Conference on Advanced Information Networking and Applications (AINA-2022), 449 LNNS 167-179, Apr, 2022  Peer-reviewed
  • KURIHARA Jun, NAKAMURA Toru, WATANABE Ryu
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E104-A(9) 1271-1283, Sep, 2021  Peer-reviewedLead authorCorresponding author
    <p>This paper investigates an adversarial model in the scenario of private information retrieval (PIR) from n coded storage servers, called Byzantine adversary. The Byzantine adversary is defined as the one altering b server responses and erasing u server responses to a user's query. In this paper, two types of Byzantine adversaries are considered; 1) the classic omniscient type that has the full knowledge on n servers as considered in existing literature, and 2) the reasonable limited-knowledge type that has information on only b+u servers, i.e., servers under the adversary's control. For these two types, this paper reveals that the resistance of a PIR scheme, i.e., the condition of b and u to correctly obtain the desired message, can be expressed in terms of a code parameter called the coset distance of linear codes employed in the scheme. For the omniscient type, the derived condition expressed by the coset distance is tighter and more precise than the estimation of the resistance by the minimum Hamming weight of the codes considered in existing researches. Furthermore, this paper also clarifies that if the adversary is limited-knowledge, the resistance of a PIR scheme could exceed that for the case of the omniscient type. Namely, PIR schemes can increase their resistance to Byzantine adversaries by allowing the limitation on adversary's knowledge.</p>
  • Yuji Koike, Takuya Hayashi, Jun Kurihara, Takanori Isobe 0001
    IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 104-A(1) 182-189, 2021  Peer-reviewed
  • Jun Kurihara, Toru Nakamura
    IEICE Communications Express, 9(7) 342-347, Jul 1, 2020  Peer-reviewed
    <p>In private information retrieval (PIR) from coded storage servers, consider the case where some of servers are Byzantine adversaries and unresponsive. There have been proposed several specialized schemes guaranteeing that the user can correctly obtain the desired message even in the adversarial situation. However, to the best of our knowledge, such resistance to the adversaries in PIR schemes based on arbitrary codes have been not precisely characterized. In this paper, we reveal that the exact resistance to Byzantine and unresponsive servers is expressed in terms of the coset distance of linear codes in linear PIR schemes based on arbitrary storage code.</p>
  • Kazuaki Ueda, Kenji Yokota, Jun Kurihara, Atsushi Tagami
    IEICE Transactions, 102-B(9) 1813-1821, Sep, 2019  Peer-reviewed
  • Kalika Suksomboon, Atsushi Tagami, Anirban Basu, Jun Kurihara
    43rd IEEE Conference on Local Computer Networks, LCN 2018, Chicago, IL, USA, October 1-4, 2018, 303-306, Oct, 2018  Peer-reviewed
  • Kalika Suksomboon, Atsushi Tagami, Anirban Basu, Jun Kurihara
    Proceedings of the 4th ACM Conference on Information-Centric Networking, ICN 2017, Berlin, Germany, September 26-28, 2017, 176-177, Sep, 2017  Peer-reviewed
  • Kazuaki Ueda, Kenji Yokota, Jun Kurihara, Atsushi Tagami
    2016 IEEE Global Communications Conference, GLOBECOM 2016, Washington, DC, USA, December 4-8, 2016, 1-6, Dec, 2016  Peer-reviewed
  • KURIHARA Jun, YOKOTA Kenji, TAGAMI Atsushi
    IEICE Transactions on Communications, 99(12) 2520-2531, Dec, 2016  Peer-reviewed
    <p>Content-centric networking (CCN) is an emerging networking architecture that is being actively investigated in both the research and industrial communities. In the latest version of CCN, a large number of interests have to be issued when large content is retrieved. Since CCN routers have to search several tables for each incoming interest, this could cause a serious problem of router workload. In order to solve this problem, this paper introduces a novel strategy of "grouping" multiple interests with common information and "packing" them to a special interest called the list interest. Our list interest is designed to co-operate with the manifest of CCN as its dual. This paper demonstrates that by skipping and terminating several search steps using the common information in the list interest, the router can search its tables for the list interest-based request with dramatically smaller complexity than the case of the standard interest-based request. Furthermore, we also consider the deployment of list interests and design a novel TCP-like congestion control method for list interests to employ them just like standard interests.</p>
  • Jun Kurihara, Kenji Yokota, Atsushi Tagami
    Proceedings of the 3rd ACM Conference on Information-Centric Networking, ICN '16, Kyoto, Japan, September 26-28, 2016, 186-194, Sep, 2016  Peer-reviewed
  • Kenji Yokota, Kohei Sugiyama, Jun Kurihara, Atsushi Tagami
    30th IEEE International Conference on Advanced Information Networking and Applications, AINA 2016, Crans-Montana, Switzerland, 23-25 March, 2016, 124-131, Mar, 2016  Peer-reviewed
  • Kazuaki Ueda, Kenji Yokota, Jun Kurihara, Atsushi Tagami
    12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015, Dallas, TX, USA, October 19-22, 2015, 531-536, Oct, 2015  Peer-reviewed
    In the research of content-centric networking ( CCN), there have been investigated several fragmentation methods of CCN messages in order to implement CCN as an L3 protocol. The latest version of the CCN protocol ( CCN 1.0) adopts the end-to-end fragmentation method that fragments CCN messages only at the content publisher. This allows intermediate routers to simply forward fragmentation packets, and hence this can solve the problem of the processing delay at routers in the existing fragmentation methods for the CCN. However, the end-to-end fragmentation has not been well-analyzed and well-evaluated yet. In this paper, we analyze the end-to-end fragmentation and clarify its important parameter for the efficient transmission. Moreover, we evaluate fragmentation methods for the cache-hit ratio and the header overhead, and we clarify advantages and disadvantages of the methods in terms of the transmission efficiency.
  • Jun Kurihara, Kenji Yokota, Kazuaki Ueda, Atsushi Tagami
    12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015, Dallas, TX, USA, October 19-22, 2015, 500-505, Oct, 2015  Peer-reviewed
    In the latest version of content-centric networking ( CCN 1.0), a number of interests are issued when a large content is retrieved, and this could be a serious problem due to routers' heavy workload. In order to solve this problem, this paper proposes a novel strategy of "grouping" multiple interests with the common information and "packing" them to a special interest called the list interest. Our list interest is designed to co-operate with the manifest of CCN 1.0. This paper demonstrates that by using the common information in the list interest, the router can search its FIB/PIT/CS for the list interest-based request with dramatically smaller complexity than the case of the standard interest-based request. Furthermore, we also give a novel TCP-like congestion control method for list interests.
  • Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu
    IEEE Transactions on Information Theory, 61(7) 3912-3936, Jul, 2015  Peer-reviewed
    By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C_1 of length n over a field extension and its subcode C_2. One is called the relative dimension/intersection profile (RDIP), and the other is called the relative generalized rank weight (RGRW). We clarify their basic properties and the relation between the RGRW and the minimum rank distance. As applications of the RDIP and the RGRW, the security performance and the error correction capability of secure network coding, guaranteed independently of the underlying network code, are analyzed and clarified. We propose a construction of secure network coding scheme, and analyze its security performance and error correction capability as an example of applications of the RDIP and the RGRW. Silva and Kschischang showed the existence of a secure network coding in which no part of the secret message is revealed to the adversary even if any dim C_1-1 links are wiretapped, which is guaranteed over any underlying network code. However, the explicit construction of such a scheme remained an open problem. Our new construction is just one instance of secure network coding that solves this open problem.
  • Jun Kurihara, Ersin Uzun, Christopher A. Wood
    2015 IFIP Networking Conference (IFIP Networking), 1-9, May, 2015  Peer-reviewed
  • Kurihara Jun, Miyake Yutaka
    IEICE Communications Express, 2(10) 442-446, Oct, 2013  Peer-reviewed
    This paper proposes a coding scheme to securely store a secret file in a distributed storage system that uses an arbitrary regenerating code. Our scheme encodes the secret file to the input of a certain regenerating code by using the coset coding scheme with a maximum rank distance (MRD) code. We show that our scheme can protect the secret file from being leaked to an eavesdropper in the distributed storage system. Existing security schemes for distributed storage systems are based on specific regenerating codes, and they cannot be used with other regenerating codes. In contrast, our scheme can guarantee the security against the eavesdropper independently of the construction of the underlying regenerating code.
  • KURIHARA Jun, UYEMATSU Tomohiko, MATSUMOTO Ryutaroh
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 95(11) 2067-2075, Nov 1, 2012  Peer-reviewed
    This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using the relative dimension/length profile (RDLP) and the relative generalized Hamming weight (RGHW). We first describe the equivocation &Delta;m of the secret vector $\vec{s}$=[s1,...,sl] given m shares in terms of the RDLP of linear codes. We also characterize two thresholds t1 and t2 in the secret sharing schemes by the RGHW of linear codes. One shows that any set of at most t1 shares leaks no information about $\vec{s}$, and the other shows that any set of at least t2 shares uniquely determines $\vec{s}$. It is clarified that both characterizations for t1 and t2 are better than Chen et al.'s ones derived by the regular minimum Hamming weight. Moreover, this paper characterizes the strong security in secret sharing schemes based on linear codes, by generalizing the definition of strongly-secure threshold ramp schemes. We define a secret sharing scheme achieving the &alpha;-strong security as the one such that the mutual information between any r elements of (s1,...,sl) and any &alpha;-r+1 shares is always zero. Then, it is clarified that secret sharing schemes based on linear codes can always achieve the &alpha;-strong security where the value &alpha; is precisely characterized by the RGHW.
  • Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto
    2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, 533-540, Jul 9, 2012  Peer-reviewed
    The universal secure network coding presented by Silva et al. realizes secure and reliable transmission of a secret message over any underlying network code, by using maximum rank distance codes. Inspired by their result, this paper considers the secure network coding based on arbitrary linear codes, and investigates its security performance and error correction capability that are guaranteed independently of the underlying network code. The security performance and error correction capability are said to be universal when they are independent of underlying network codes. This paper introduces new code parameters, the relative dimension/intersection profile (RDIP) and the relative generalized rank weight (RGRW) of linear codes. We reveal that the universal security performance and universal error correction capability of secure network coding are expressed in terms of the RDIP and RGRW of linear codes. The security and error correction of existing schemes are also analyzed as applications of the RDIP and RGRW.
  • Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto
    IEEE International Symposium on Information Theory - Proceedings, 1483-1487, Jul, 2012  Peer-reviewed
  • Jun Kurihara, Tomohiko Uyematsu
    49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Allerton Park & Retreat Center, Monticello, IL, USA, 28-30 September, 2011, 951-957, Sep, 2011  Peer-reviewed
  • KURIHARA Jun, UYEMATSU Tomohiko
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 94(6) 1375-1380, Jun 1, 2011  Peer-reviewed
    This paper presents a novel technique to realize Karnin et al.'s (k,n)-threshold schemes over binary field extensions as a software. Our realization uses the matrix representation of finite fields and matrix-vector multiplications, and enables rapid operations in software implementation. The theoretical evaluation and computer simulation reveal that our realization of Karnin et al.'s scheme achieves much faster processing time than the ordinary symbol oriented realization of the scheme. Further, we show that our realization has comparable performance to the existing exclusive-OR-based fast schemes of Fujii et al. and Kurihara et al.
  • Jun Kurihara, Tomohiko Uyematsu
    PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON COMMUNICATION THEORY, RELIABILITY, AND QUALITY OF SERVICE (CTRQ 2011), 35-39, Apr, 2011  Peer-reviewed
    In order to provide reliable and secure communication against eavesdroppers and jammers over networks, Universal Secure Error-Correcting Network Codes (USECNC) based on Maximum-Rank-Distance (MRD) codes have been introduced. This code can be applied to any underlying network codes. However, Shioji et al. introduced a reasonable network model against the code. In their model, an attacker eavesdrops information symbols from some links, where the set of eavesdropping links is re-selected during one packet transmission. The MRD-code-based USECNC cannot guarantee the security against eavesdroppers under this model. Inspired by Shioji et al.' s result, this paper considers the model such that the set of links that jamming (error) symbols are injected into is re-selected for each time slot. We show that the MRDcode- based USECNC cannot guarantee the error-correcting capability under the model of time-varying jamming links, even if the number of jamming links is limited to only one. Furthermore, by introducing a restriction on the field of local coding vectors in the network coding, we propose a simple solution to the problem of time-varying jamming links for MRD-code-based USECNC.
  • KURIHARA Jun, KIYOMOTO Shinsaku, WATANABE Ryu, TANAKA Toshiaki
    The Journal of The Institute of Image Information and Television Engineers, 64(12) 1921-1932, Dec 1, 2010  Peer-reviewed
    In this paper, we present an authentication mechanism for ISDB-T broadcast streams, especially a One-Seg broadcast stream, which is suitable for low-power devices. Our method makes it possible to authenticate data streams at a low computational cost. The method requires a small memory for buffering to process the broadcast stream and is resistant to packet-loss. We evaluated the computational cost of our method by computer simulation and theoretical estimation, and we show here that our method achieved good properties for authenticating data streams broadcast through lossy channels, e.g. wireless channels. Furthermore, we developed a mobile phone that can authenticate One-Seg broadcast streams with our method, and we report the effectiveness of our scheme here.
  • Yuto Nakano, Jun Kurihara, Shinsaku Kiyomoto, Toshiaki Tanaka
    SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography, Athens, Greece, July 26-28, 2010, SECRYPT is part of ICETE - The International Joint Conference on e-Business and Telecommunications, 334-343, Jul, 2010  Peer-reviewed
  • Yuto Nakano, Jun Kurihara, Shinsaku Kiyomoto, Toshiaki Tanaka
    e-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Athens, Greece, July 26-28, 2010, Revised Selected Papers, 222 CCIS 188-202, Feb, 2010  Peer-reviewed
  • Carlos Cid, Shinsaku Kiyomoto, Jun Kurihara
    INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 5927 32-+, Dec, 2009  Peer-reviewed
    In this paper, we introduce the RAKAPOSHI stream cipher The algorithm is based On Dynamic Linear Feedback Shift, Registers, with a simple and potentially scalable design, mid is particularly suitable for hardware applications with restricted resources The RAKAPOSHI stream cipher offers 128-bit security, and aims to complement, the current eSTREAM portfolio of hardware-oriented stream ciphers
  • KURIHARA Jun, KIYOMOTO Shinsaku, FUKUSHIMA Kazuhide, TANAKA Toshiaki
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 92(8) 1808-1821, Aug 1, 2009  Peer-reviewed
    Shamir's (k, n)-threshold secret sharing scheme (threshold scheme) has two problems: a heavy computational cost is required to make shares and recover the secret, and a large storage capacity is needed to retain all the shares. As a solution to the heavy computational cost problem, several fast threshold schemes have been proposed. On the other hand, threshold ramp secret sharing schemes (ramp scheme) have been proposed in order to reduce each bit-size of shares in Shamir's scheme. However, there is no fast ramp scheme which has both low computational cost and low storage requirements. This paper proposes a new (k, L, n)-threshold ramp secret sharing scheme which uses just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret at a low computational cost. Moreover, by proving that the fast (k, n)-threshold scheme in conjunction with a method to reduce the number of random numbers is an ideal secret sharing scheme, we show that our fast ramp scheme is able to reduce each bit-size of shares by allowing some degradation of security similar to the existing ramp schemes based on Shamir's threshold scheme.
  • Jun Kurihara, Shinsaku Kiyomoto, Kazuhide Fukushima, Toshiaki Tanaka
    INFORMATION SECURITY, PROCEEDINGS, 5222 455-470, Sep, 2008  Peer-reviewed
    In Shamir&apos;s (k, n)-threshold secret sharing scheme (threshold scheme), a heavy computational cost is required to make n shares and recover the secret. As a solution to this problem, several fast threshold schemes have been proposed. This paper proposes a new (k,n)-threshold scheme. For the purpose to realize high performance, the proposed scheme uses just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret. We prove that the proposed scheme is a perfect secret sharing scheme, every combination of k or more participants can recover the secret, but every group of less than k participants cannot obtain any information about the secret. Moreover, we show that the proposed scheme is an ideal secret sharing scheme similar to Shamir&apos;s scheme, which is a perfect scheme such that every bit-size of shares equals that of the secret. We also evaluate the efficiency of the scheme, and show that our scheme realizes operations that are much faster than Shamir&apos;s. Furthermore, from the aspect of both computational cost and storage usage, we also introduce how to extend the proposed scheme to a new (k, L, n)-threshold ramp scheme similar to the existing ramp scheme based on Shamir&apos;s scheme.
  • KURIHARA Jun, KIYOMOTO Shinsaku, FUKUSHIMA Kazuhide, TANAKA Toshiaki
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 91(9) 2365-2378, Sep, 2008  Peer-reviewed
    In Shamir's (k,n)-threshold secret sharing scheme (threshold scheme) [1], a heavy computational cost is required to make n shares and recover the secret from k shares. As a solution to this problem, several fast threshold schemes have been proposed. However, there is no fast ideal (k,n)-threshold scheme, where k and n are arbitrary. This paper proposes a new fast (k,n)-threshold scheme which uses just EXCLUSIVE-OR (XOR) operations to make n shares and recover the secret from k shares. We prove that every combination of k or more participants can recover the secret, but every group of less than k participants cannot obtain any information about the secret in the proposed scheme. Moreover, the proposed scheme is an ideal secret sharing scheme similar to Shamir's scheme, in which every bitsize of shares equals that of the secret. We also evaluate the efficiency of the scheme, and show that our scheme realizes operations that are much faster than Shamir's.
  • KURIHARA Jun, KIYOMOTO Shinsaku, FUKUSHIMA Kazuhide, TANAKA Toshiaki
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 91(1) 127-138, Jan 1, 2008  Peer-reviewed
    In Shamir's (k, n)-threshold secret sharing scheme [1], a heavy computational cost is required to make n shares and recover the secret from k shares. As a solution to this problem, several fast threshold schemes have been proposed. However, there is no fast ideal (k, n)-threshold scheme, where k&ge;3 and n is arbitrary. This paper proposes a new fast (3, n)-threshold scheme by using just EXCLUSIVE-OR (XOR) operations to make shares and recover the secret, which is an ideal secret sharing scheme similar to Shamir's scheme. Furthermore, we evaluate the efficiency of the scheme, and show that it is more efficient than Shamir's in terms of computational cost. Moreover, we suggest a fast (k, n)-threshold scheme can be constructed in a similar way by increasing the sets of random numbers constructing pieces of shares.

Misc.

 38
  • 栗原頂, 栗原淳, 田中俊昭
    電子情報通信学会 総合大会 2023, (A-2-2), Mar 10, 2023  
  • Jun Kurihara, Takeshi Kubo
    Apr 28, 2021  
    The traditional Domain Name System (DNS) lacks fundamental features of security and privacy in its design. As concerns of privacy increased on the Internet, security and privacy enhancements of DNS have been actively investigated and deployed. Specially for user's privacy in DNS queries, several relay-based anonymization schemes have been recently introduced, however, they are vulnerable to the collusion of a relay with a full-service resolver, i.e., identities of users cannot be hidden to the resolver. This paper introduces a new concept of a multiple-relay-based DNS for user anonymity in DNS queries, called the mutualized oblivious DNS ($\mu$ODNS), by extending the concept of existing relay-based schemes. The $\mu$ODNS introduces a small and reasonable assumption that each user has at least one trusted/dedicated relay in a network and mutually shares the dedicated one with others. The user just sets the dedicated one as his next-hop, first relay, conveying his queries to the resolver, and randomly chooses its $0$ or more subsequent relays shared by other entities. Under this small assumption, the user's identity is concealed to a target resolver in the $\mu$ODNS even if a certain (unknown) subset of relays collude with the resolver. That is, in $\mu$ODNS, users can preserve their privacy and anonymity just by paying a small cost of sharing its resource. Moreover, we present a PoC implementation of $\mu$ODNS that is publicly available on the Internet. We also show that by measurement of round-trip-time for queries, and our PoC implementation of $\mu$ODNS achieves the performance comparable to existing relay-based schemes.
  • 渡辺 龍, 窪田 歩, 栗原 淳
    信学技報 IN2020-68, 120(414) 85-90, Mar, 2021  
  • KURIHARA Jun, KUBO Takeshi
    電子情報通信学会技術研究報告(Web), 121(102(NS2021 32-56)), 2021  

Presentations

 3

Research Projects

 8