JKJun Kurihara

Jun Kurihara

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jun Kurihara has a total of 68 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Distributed Authorization in IoT and Edge Cybersecurity: A Standards-Informed Analytical Framework and Taxonomy

    by Ryu Watanabe, Toshiaki Tanaka, Jun Kurihara, Toru Nakamura, Ayumu Kubota, Kouichi Sakurai

    Authorization is a core function of access control in distributed systems, where decisions and enforcement may span heterogeneous components and administrative domains. This paper presents a standards-informed taxonomy and applies it in a systematic mapping study of 90 studies on distributed authorization in IoT, edge/fog, sensor/WSN, and vehicular/V2X environments, available from 2020 through June 2026. The studies are classified according to six dimensions: policy governance, decision basis, identity and attribute management, PDP–PEP architecture, trust establishment, and operational assurance and auditability. We also examine their correspondence with authorization-relevant Zero Trust Architecture tenets and analyze the functional roles of distributed ledger technologies and smart contracts. The mapping shows that Distributed PDP/Local PEP is the dominant architectural pattern, while architectural distribution does not necessarily imply decentralized policy governance, identity and attribute management, or trust establishment. Within the mapped corpus, DLTs and/or smart contracts are widely used, but their use alone does not establish decentralization or complete authorization-lifecycle control. Overall, the results support treating distributed authorization as a combination of related but distinct design dimensions and highlight remaining challenges in lifecycle control, interoperability, delegation-oriented authorization, and operational evaluation.

  • Open Access

    Extensive Study on the Security of Private Information Delivery from Coded Storage

    by Koki Nakano, Jun Kurihara, Toshiaki Tanaka

    Private information delivery (PID) from coded storage is a problem in delivering a message to a receiver without revealing the locations of servers storing encoded pieces of the message. Vaidya et al. introduced an explicit PID scheme based on maximum distance separable (MDS) codes. However, their scheme still has the limitation of the maximum possible number of servers due to the use of MDS codes. Moreover, it has no security against external adversaries who corrupt and eavesdrop on the data stored on servers. In this paper, we focus on the following two topics to solve the above problems: (1) performance characterization of a PID scheme with an arbitrary linear code; and (2) security of stored messages against the Byzantine servers and the eavesdropping servers. For (1), we first reformulate a PID scheme from coded storage based on a linear code. We also formally define two properties of PID from coded storage: the correctness and the privacy, where the correctness means the recoverability of the original message at the receiver, and the privacy means the confidentiality of locations of servers storing the message. Furthermore, we characterize the conditions of a PID scheme attaining the correctness and privacy in terms of the Hamming weight of the linear code employed in the scheme. For (2), we define new security properties against Byzantine and eavesdropping servers in PID: the t-Byzantine resistance and the μ-message confidentiality, where t and μ are the maximum capable numbers of Byzantine servers and eavesdropping servers, respectively. Moreover, we also introduce an explicit scheme guaranteeing these properties with no deterioration of the correctness and privacy.

  • Open Access

    A New Security Measure in Secret Sharing Schemes and Secure Network Coding

    by Itaru Kurihara, Jun Kurihara, Toshiaki Tanaka

    Linear secret sharing schemes protect secret information from leakage and destruction by encoding secret information into multiple shares, where the secret information can be reconstructed by collecting a certain subsets of shares. Perfect Security, $\alpha $ -strong Security, and Individual Security (IS) have been given as security measures of linear secret sharing schemes. Consider the threshold for each security measure, which is defined as the maximum allowable size of the set of leaked shares. Kurihara et al. have revealed that thresholds for Perfect Security and $\alpha $ -strong Security are characterized in terms of a relative code parameter Relative Generalized Hamming Weight (RGHW). However, the threshold for IS is not yet characterized. In this paper, we focus on individual elements of secret information and give the threshold for IS (Individual Security Threshold IST) as a new security measure, where each element of secret information cannot be uniquely determined from subsets of shares with size less than or equal to the IST. We show that the IST can be characterized in terms of RGHW as well as Perfect Security and $\alpha $ -strong Security. We also give a precoding method for secret information that can guarantee IST above a certain value in any existing linear secret sharing schemes. Moreover, we extend the notion of the IST to universal secure network coding (USNC) and present the Universal IST. We also show that the Universal IST can be represented by the code parameter Relative Generalized Rank Weight (RGRW) similarly to the IST of the linear secret sharing schemes.


  • Private Information Retrieval from Coded Storage in the Presence of Omniscient and Limited-Knowledge Byzantine Adversaries

    by Jun Kurihara, Toru Nakamura, Ryu Watanabe

    Japan's largest platform for academic e-journals: J-STAGE is a full text database for reviewed academic papers published by Japanese societies


  • Open Access

    Mutualized oblivious DNS ($μ$ODNS): Hiding a tree in the wild forest

    by Jun Kurihara, Takeshi Kubo

    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.

  • Open Access

    On the resistance to Byzantine and unresponsive servers in code-based PIR schemes

    by Jun Kurihara, Toru Nakamura

    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.


  • Two-Level Named Packet Forwarding for Enhancing the Performance of Virtualized ICN Router

    by Kazuaki Ueda, Kenji Yokota, Jun Kurihara, Atsushi Tagami

    Information-Centric Networking (ICN) can offer rich functionalities to the network, e.g, in-network caching, and name-based forwarding. Incremental deployment of ICN is a key challenge that enable smooth migration from current IP network to ICN. We can say that Network Function Virtualization (NFV) must be one of the key technologies to achieve this deployment because of its flexibility to support new network functions. However, when we consider the ICN deployment with NFV, there exist two performance issues, processing delay of name-based forwarding and computational overhead of virtual machine. In this paper we proposed a NFV infrastructure-assisted ICN packet forwarding by integrating the name look-up to the Open vSwitch. The contributions are twofold: 1) First, we provide the novel name look-up scheme that can forward ICN packets without costly longest prefix match searching. 2) Second, we design the ICN packet forwarding scheme that integrates the partial name look-up into the virtualization infrastructure to mitigate computation overhead.