Faculty Profiles - GU YUJIE

Information

写真a

GU YUJIE

Organization

Faculty of Information Science and Electrical Engineering Department of Informatics Associate Professor
School of Engineering Department of Electrical Engineering and Computer Science（Concurrent）
Graduate School of Information Science and Electrical Engineering Department of Information Science and Technology（Concurrent）

Profile

テルアビブ大学, Department of Electrical Engineering - Systems, Post-Doctoral Fellow (2018年4月 - 2020年9月) テルアビブ大学, Academic Visitor (2020年10月 - 2020年10月)

Homepage

https://researchmap.jp/yujiegu

External link

Research Areas

Informatics / Mathematical informatics
Informatics / Information security
Natural Science / Applied mathematics and statistics

Degree

Ph.D.

Research History

Emory University Department of Computer Science

2024.2 - 2024.5

　 More details

researchmap
Kyushu University Faculty of Information Science and Electrical Engineering Assistant Professor

2020.10 - Present

　 More details

Country：Japan

researchmap
2018-2020 Tel Aviv University, Israel

Research Interests・Research Keywords

Research theme： Copyright and Privacy Protection in AI

Keyword： Copyright Protection, Privacy Protection

Research period： 2024.1 - 2026.12
Research theme： Traitor Tracing Schemes for Broadcast Encryption

Keyword： Traitor tracing, probabilistic inference

Research period： 2021.4 - 2022.3
Research theme： Mathematical Study of Copyright and Privacy Protection

Keyword： Copyright Protection, Privacy Protection

Research period： 2021.1 - 2023.12

Awards

船井研究奨励賞

2023.3 船井情報科学振興財団

　More details

著作権・プライバシー保護の数理的研究
Funai Information Technology Award for Young Researchers

2023.3 Funai Information Science Promotion Foundation

Yujie Gu

　More details

researchmap
伊藤早苗賞

2022.10 九州大学
Sanae-I. Itoh Award

2022.10 Kyushu University

Yujie Gu

　More details

researchmap
Kirkman Medal

2022.3 The Institute of Combinatorics and its Applications

　More details

Yujie Gu has made significant contributions to combinatorial methods for information security, coding theory, and information theory. Her notable research achievements include combinatorial traitor tracing, zero- error two-way communications, private information retrieval and compressed sensing, by ingeniously utilizing techniques in extremal and additive combinatorics, graph theory, algebraic methods, probabilistic methods, and information theory. The breadth and depth of her research are quite remarkable.
Kirkman Medal

2022.3 The Institute of Combinatorics and its Applications

Yujie Gu

　More details

Award type：International academic award (Japan or overseas)

researchmap
研究科長表彰

2018.3 筑波大学, 大学院システム情報工学研究科

▼display all

Papers

Enhanced Privacy Bound for Shuffle Model with Personalized Privacy Reviewed

Yixuan Liu, Yuhan Liu, Li Xiong, Yujie Gu, Hong Chen

33rd ACM International Conference on Information and Knowledge Management (CIKM) 2024.10

　More details

Language：English

researchmap
Secure codes with list decoding Reviewed International journal

Yujie Gu, Ilya Vorobyev, and Ying Miao

IEEE Transactions on Information Theory 2024.4

　More details

Language：English Publishing type：Research paper (scientific journal)
Secure Codes With List Decoding Reviewed

Yujie Gu, Ilya Vorobyev, Ying Miao

IEEE Transactions on Information Theory 70 ( 4 ) 2430 - 2442 2024.4 （ ISSN:0018-9448 eISSN:1557-9654 ）

　More details

Language：English Publishing type：Research paper (scientific journal) Publisher：Institute of Electrical and Electronics Engineers (IEEE)

In this paper we consider combinatorial secure codes in traitor tracing for protecting copyright of multimedia content. First, we introduce a new notion of secure codes with list decoding (SCLDs) for collusion-resistant multimedia fingerprinting, which includes many existing types of fingerprinting codes as special cases. Next, we build efficient identifying algorithms for SCLDs with complete traceability and establish bounds on its largest possible code rate. In comparison with the existing fingerprinting codes, it is shown that SCLDs have not only much more efficient traceability than separable codes but also a much larger code rate than frameproof codes. As a byproduct, new bounds on the largest code rate of binary separable codes are established as well. Furthermore, a two-stage dynamic traitor tracing framework is proposed for multimedia fingerprinting in the dynamic scenario, which could not only efficiently achieve the complete traceability but also provide a much larger capacity than the static scenario.

DOI： 10.1109/TIT.2023.3301037

Web of Science

Scopus

researchmap
The Impact of Prompts on Zero-Shot Detection of AI-Generated Text Reviewed

Kaito Taguchi, Yujie Gu, Kouichi Sakurai

AISafety@IJCAI 2024

　More details

Language：English

researchmap
Privacy-Preserving Heterogeneous Federated Learning for Sensitive Healthcare Data Reviewed

Yukai Xu, Jingfeng Zhang, Yujie Gu

IEEE Conference on Artificial Intelligence (CAI) 2024

　More details

Language：English

researchmap
List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group Testing Reviewed

Jinping Fan, Yujie Gu, Ying Miao, Zhebin Yu

IEEE International Symposium on Information Theory (ISIT) 2024

　More details

Language：English

researchmap
Bounds for binary multimedia codes with the identifiable parent property Reviewed International journal

Hongna Yang, Yujie Gu, and Yiwei Zhang

Proceedings of 2023 IEEE International Symposium on Information Theory 2023.6

　More details

Language：English Publishing type：Research paper (international conference proceedings)
Bounds for Binary Multimedia Codes with the Identifiable Parent Property Reviewed

Hongna Yang, Yujie Gu, Yiwei Zhang

IEEE International Symposium on Information Theory (ISIT) 2023-June 2434 - 2439 2023.6 （ ISSN:21578095 ISBN:9781665475549 ）

　More details

Language：English Publishing type：Research paper (international conference proceedings) Publisher：IEEE

Multimedia codes with the identifiable parent property (MIPPCs) were proposed to resist collusion attacks for multimedia fingerprinting. However, the largest possible code rate of binary MIPPCs is far from being understood yet. In this paper, we aim to establish lower and upper bounds for the largest code rate of binary MIPPCs. To that end, we introduce a new concept of locally thin and fat families (LTFFs) and establish relationships between LTFFs and binary MIPPCs. Accordingly, new lower and upper bounds for binary MIPPCs and LTFFs are derived by means of the probabilistic method and combinatorial techniques. In particular, the order of magnitude for the largest rate of binary MIPPCs is determined. It is shown that the code rate of binary MIPPCs outperforms other existing binary fingerprinting codes (e.g. binary separable codes) as well.

DOI： 10.1109/isit54713.2023.10206524

Scopus

researchmap
Bounds on the capacity of private information retrieval over graphs Reviewed International journal

Bar Sadeh, Yujie Gu, and Itzhak Tamo

IEEE Transactions on Information Forensics and Security 2023.5

　More details

Language：English Publishing type：Research paper (scientific journal)

情報セキュリティにおいて, private information retrieval (PIR)は, 数多くのファイルを保有するサーバから, ユーザが, プライバシーが保護された状況でファイルを取得するプロトコルである. 特に, 最もベーシックなモデルとして知られるgraph-based storage system (GSS)上においても, PIRの最大通信容量の解明は, 当該分野の未解決問題である. 本論文、グラフ理論と情報理論的な分析をもとに, 線形計画法を用いて, GSS上のPIRの最大通信容量の限界式を初めて証明した. 特にハイパーグラフ上の辺彩色と, PIRの最大通信容量の解析を関係づける斬新な着想がこの証明の中核をなす。
Cayley sum graphs and their applications to codebooks Reviewed International journal

Shohei Satake and Yujie Gu

Designs, Codes and Cryptography 2023.4

　More details

Language：English Publishing type：Research paper (scientific journal)
Combinatorial secure codes for copyright protection and related problems Invited Reviewed International journal

Jinping Fan, Yujie Gu, and Ying Miao

Scientia Sinica Mathematica 2023.2

　More details

Language：English Publishing type：Research paper (scientific journal)
Explicit non-malleable codes from bipartite graphs Reviewed International journal

Shohei Satake, Yujie Gu, and Kouichi Sakurai

Lecture Notes in Computer Science (WAIFI 2022: Arithmetic of Finite Fields) 2023.1

　More details

Language：English Publishing type：Research paper (international conference proceedings)
Explicit Non-malleable Codes from Bipartite Graphs Reviewed

Shohei Satake, Yujie Gu, Kouichi Sakurai

Arithmetic of Finite Fields 13638 221 - 236 2023 （ ISSN:0302-9743 ISBN:978-3-031-22943-5 eISSN:1611-3349 ）

　More details

Language：English Publishing type：Part of collection (book) Publisher：Springer International Publishing

Non-malleable codes are introduced to protect the communication against adversarial tampering of data, as a relaxation of the error-correcting codes and error-detecting codes. To explicitly construct non-malleable codes is a central and challenging problem which has drawn considerable attention and been extensively studied in the past few years. Recently, Rasmussen and Sahai built an interesting connection between non-malleable codes and (non-bipartite) expander graphs, which is the first explicit construction of non-malleable codes based on graph theory other than the typically exploited extractors. So far, there is no other graph-based construction for non-malleable codes yet. In this paper, we aim to explore more connections between non-malleable codes and graph theory. Specifically, we first extend the Rasmussen-Sahai construction to bipartite expander graphs. Accordingly, we establish several explicit constructions for non-malleable codes based on Lubotzky-Phillips-Sarnak Ramanujan graphs and generalized quadrangles, respectively. It is shown that the resulting codes can either work for a more flexible split-state model or have better code rate in comparison with the existing results.

DOI： 10.1007/978-3-031-22944-2_14

Web of Science

Scopus

researchmap
Bounds on the Capacity of Private Information Retrieval Over Graphs Reviewed

Bar Sadeh, Yujie Gu, Itzhak Tamo

IEEE Transactions on Information Forensics and Security 18 261 - 273 2023 （ ISSN:1556-6013 eISSN:1556-6021 ）

　More details

Language：English Publishing type：Research paper (scientific journal) Publisher：Institute of Electrical and Electronics Engineers (IEEE)

In the private information retrieval (PIR) problem, a user wants to retrieve a file from a database without revealing any information about the desired file's identity to the servers that store the database. In this paper, we study the PIR capacity of a graph-based replication system, in which each file is stored on two distinct servers according to an underlying graph. This paper aims to provide upper and lower bounds to the PIR capacity of graphs via various graph properties. In particular, we provide several upper bounds on the PIR capacity that apply to all graphs. We further improve the bounds for specific graph families (which turn out to be tight in certain cases) by utilizing the underlying graph structure. For the lower bounds, we establish optimal rate PIR schemes for star graphs via edge-coloring techniques. Lastly, we provide an improved PIR scheme for complete graphs, implying an improved general lower bound on all graphs' PIR capacity.

DOI： 10.1109/TIFS.2022.3220034

Web of Science

Scopus

researchmap

Other Link： http://xplorestaging.ieee.org/ielx7/10206/9970396/09940306.pdf?arnumber=9940306
Cayley sum graphs and their applications to codebooks Reviewed

Shohei Satake, Yujie Gu

Designs, Codes and Cryptography 91 ( 4 ) 1315 - 1333 2022.11 （ ISSN:0925-1022 eISSN:1573-7586 ）

　More details

Language：English Publishing type：Research paper (scientific journal) Publisher：Springer Science and Business Media LLC

In this paper we first provide two new constructions for Cayley sum graphs, namely, norm-coset graphs and trace-coset graphs, and determine their second largest eigenvalues using Gaussian sums. Next, a connection between Cayley sum graphs and complex codebooks is established. Based on this, infinite families of asymptotically optimal complex codebooks are explicitly constructed. The derived Cayley sum graphs and codebooks either include some known constructions as special cases or provide flexible new parameters.

DOI： 10.1007/s10623-022-01152-x

Web of Science

Scopus

researchmap

Other Link： https://link.springer.com/article/10.1007/s10623-022-01152-x/fulltext.html
On the information-theoretic security of combinatorial all-or-nothing transforms Reviewed International journal

Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, and Kouichi Sakurai

IEEE Transactions on Information Theory 2022.10

　More details

Language：English Publishing type：Research paper (scientific journal)
On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms Reviewed

Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai

IEEE Transactions on Information Theory 68 ( 10 ) 6904 - 6914 2022.10 （ ISSN:0018-9448 eISSN:1557-9654 ）

　More details

Language：English Publishing type：Research paper (scientific journal) Publisher：Institute of Electrical and Electronics Engineers (IEEE)

All-or-nothing transforms (AONTs) were proposed by Rivest as a message preprocessing technique for encrypting data to protect against brute-force attacks, and have numerous applications in cryptography and information security. Later the unconditionally secure AONTs and their combinatorial characterization were introduced by Stinson. Informally, a combinatorial AONT is an array with the unbiased requirements and its security properties in general depend on the prior probability distribution on the inputs s-tuples. Recently, it was shown by Esfahani and Stinson that a combinatorial AONT has perfect security provided that all the inputs s-tuples are equiprobable, and has weak security provided that all the inputs s-tuples are with non-zero probability. This paper aims to explore on the gap between perfect security and weak security for combinatorial (t,s,v)-AONTs. Concretely, we consider the typical scenario that all the s inputs take values independently (but not necessarily identically) and quantify the amount of information H(X|Y) about any t inputs X that is not revealed by any s-t outputs Y. In particular, we establish the general lower and upper bounds on H(X|Y) for combinatorial AONTs using information-theoretic techniques, and also show that the derived bounds can be attained in certain cases. Furthermore, the discussions are extended for the security properties of combinatorial asymmetric AONTs.

DOI： 10.1109/TIT.2022.3174008

Web of Science

Scopus

researchmap
Secure codes with list decoding Reviewed International journal

Yujie Gu, Ilya Vorobyev, and Ying Miao

Proceedings of 2022 IEEE International Symposium on Information Theory 2022.6

　More details

Language：English Publishing type：Research paper (international conference proceedings)
On the security properties of combinatorial all-or-nothing transforms Reviewed

Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, and Kouichi Sakurai

Proceedings of 2022 IEEE International Symposium on Information Theory 2022.6

　More details

Language：English Publishing type：Research paper (other academic)
On the Security Properties of Combinatorial All-or-nothing Transforms Reviewed

Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai

2022 IEEE International Symposium on Information Theory (ISIT) 2022-June 1447 - 1452 2022.6 （ ISSN:21578095 ISBN:9781665421591 ）

　More details

Language：English Publishing type：Research paper (international conference proceedings) Publisher：IEEE

All-or-nothing transforms (AONT) were proposed by Rivest as a message preprocessing technique for encrypting data to protect against brute-force attacks, and have many applications in cryptography and information security. Later the unconditionally secure AONT and their combinatorial characterization were introduced by Stinson. Informally, a combinatorial AONT is an array with the unbiased requirements and its security properties in general depend on the prior probability distribution on the inputs s-tuples. Recently, it was shown by Esfahani and Stinson that a combinatorial AONT has perfect security provided that all the inputs s-tuples are equiprobable, and has weak security provided that all the inputs s-tuples are with non-zero probability. This paper aims to explore on the gap between perfect security and weak security for combinatorial (t, s, v)-AONTs. Concretely, we consider the typical scenario that all the s inputs take values independently (but not necessarily identically) and quantify the amount of information H(X|Y) about any t inputs X that is not revealed by any s-t outputs Y. In particular, we establish the general lower and upper bounds on H(X|Y) for combinatorial AONTs using information-theoretic techniques, and also show that the derived bounds can be attained in certain cases.

DOI： 10.1109/isit50566.2022.9834366

Scopus

researchmap
Secure codes with list decoding Reviewed

Yujie Gu, Ilya Vorobyev, Ying Miao

2022 IEEE International Symposium on Information Theory (ISIT) 2022-June 2350 - 2355 2022.6 （ ISSN:21578095 ISBN:9781665421591 ）

　More details

Language：English Publishing type：Research paper (international conference proceedings) Publisher：IEEE

Traitor tracing is a mathematical approach of protecting copyright of multimedia content. In this paper we propose a new concept of secure codes with list decoding (SCLD) for collusion-resistant multimedia fingerprinting, which could include many existing classes of fingerprinting codes as special cases. Furthermore, we build an efficient identifying algorithm for SCLD and establish bounds on its largest asymptotic code rate. In comparison with the existing fingerprinting codes, it is shown that SCLD has not only much more efficient traceability than separable codes but also a much larger code rate than frameproof codes.

DOI： 10.1109/isit50566.2022.9834783

Scopus

researchmap
Combinatorial secure codes for copyright protection and related problems Reviewed

Jinping Fan, Yujie Gu, Ying Miao

SCIENTIA SINICA Mathematica 53 ( 2 ) 123 - 150 2022 （ ISSN:1674-7216 ）

　More details

Publishing type：Research paper (scientific journal) Publisher：Science China Press., Co. Ltd.

The rapid development of modern science and technology not only provides convenience for data communication, but also poses a tremendous threat to the copyright of digital content. This paper focuses on the mathematical theory of traitor-tracing for copyright protection and its latest progress. First, for applications in different scenarios, such as broadcast encryption and multimedia fingerprinting, we introduce unified models to characterize the (key/fingerprint) distribution schemes with traceability property and frameproof property, respectively. Next, we review several classes of combinatorial secure codes with the traceability property and frameproof property, and the combinatorial methods used to investigate the bounds on the maximum code size and the explicit constructions, as well as the latest results and the open problems. The relationships between the combinatorial problems in copyright protection and the related problems in group testing and multiple access communication are discussed as well.

DOI： 10.1360/ssm-2022-0079

Scopus

researchmap

Other Link： https://engine.scichina.com/doi/10.1360/SSM-2022-0079
On the non-adaptive zero-error capacity of the discrete memoryless two-way channel Reviewed International journal

Yujie Gu and Ofer Shayevitz

Entropy 2021.11

　More details

Language：English Publishing type：Research paper (scientific journal)
Bounds on the Capacity of PIR over Graphs Reviewed International journal

Bar Sadeh, Yujie Gu, Itzhak Tamo

IEEE International Symposium on Information Theory 2021.7

　More details

Language：English Publishing type：Research paper (international conference proceedings)
On Compressed Sensing Matrices Breaking the Square-Root Bottleneck Reviewed International journal

Shohei Satake, Yujie Gu

IEEE Information Theory Workshop 2021.4

　More details

Language：English Publishing type：Research paper (international conference proceedings)
Strongly separable matrices for nonadaptive combinatorial group testing Reviewed International journal

Jinping Fan, Hung-Lin Fu, Yujie Gu, Ying Miao, Maiko Shigeno

Discrete Applied Mathematics 2021.3

　More details

Language：English Publishing type：Research paper (scientific journal)
Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting Reviewed International journal

Jinping Fan, Yujie Gu, Masahiro Hachimori, Ying Miao

IEEE Transactions on Information Theory 2021.1

　More details

Language：English Publishing type：Research paper (scientific journal)
On 2-parent-identifying set systems of block size 4 Reviewed International journal

Yujie Gu, Shohei Satake

Designs, Codes and Cryptography 2020.10

　More details

Language：English Publishing type：Research paper (scientific journal)
Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach Reviewed International journal

Shohei Satake, Yujie Gu

IEEE International Symposium on Information Theory 2020.6

　More details

Language：English Publishing type：Research paper (international conference proceedings)
Multimedia IPP codes with efficient tracing Reviewed International journal

Jing Jiang, Yujie Gu, Minquan Cheng

Designs, Codes and Cryptography 2020.5

　More details

Language：English Publishing type：Research paper (scientific journal)
Improved Bounds for Separable Codes and B2 Codes Reviewed International journal

Yujie Gu, Jinping Fan, Ying Miao

IEEE Communications Letters 2020.1

　More details

Language：English Publishing type：Research paper (scientific journal)
Probabilistic Existence Results for Parent-Identifying Schemes Reviewed International journal

Yujie Gu, Minquan Cheng, Grigory Kabatiansky, Ying Miao

IEEE Transactions on Information Theory 2019.10

　More details

Language：English Publishing type：Research paper (scientific journal)
Union–intersection-bounded families and their applications Reviewed International journal

Yujie Gu, Ying Miao

Discrete Applied Mathematics 2019.8

　More details

Language：English Publishing type：Research paper (scientific journal)
On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel Reviewed International journal

Yujie Gu, Ofer Shayevitz

IEEE International Symposium on Information Theory 2019.7

　More details

Language：English Publishing type：Research paper (international conference proceedings)
Bounds on Traceability Schemes Reviewed International journal

Yujie Gu, Ying Miao

IEEE Transactions on Information Theory 2018.5

　More details

Language：English Publishing type：Research paper (scientific journal)

▼display all

Presentations

著作権保護のための組合せ論

Yujie Gu

実験計画法と関連する組合せ構造および統計教育 2023.11

　More details

Event date： 2023.11

Language：Japanese

Country：Japan
Bounds for Binary Multimedia Codes with the Identifiable Parent Property International conference

Hongna Yang, Yujie Gu, Yiwei Zhang

IEEE International Symposium on Information Theory 2023.6

　More details

Event date： 2023.7

Language：English

Country：Taiwan, Province of China
Bounds on the capacity of PIR over graphs International conference

Bar Sadeh, Yujie Gu, and Itzhak Tamo

IEEE International Symposium on Information Theory 2021.7

　More details

Event date： 2023.7

Language：English

Country：Australia
On the security properties of combinatorial all-or-nothing transforms International conference

Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, and Kouichi Sakurai

IEEE International Symposium on Information Theory 2022.6

　More details

Event date： 2023.7

Language：Japanese

Country：Japan
Explicit non-malleable codes from bipartite graphs International conference

Shohei Satake, Yujie Gu, and Kouichi Sakurai

International Workshop on the Arithmetic of Finite Fields 2022.9

　More details

Event date： 2023.7

Language：English

Country：China
Private information retrieval over graphs

Yujie Gu

第21回情報科学技術フォーラム（FIT2022） 2022.9

　More details

Event date： 2023.7

Language：English

Country：Japan
A mathematical study of copyright protection International conference

Yujie Gu

Asian Deans' Forum 2022 - The Rising Stars Women in Engineering Workshop 2022.11

　More details

Event date： 2023.7

Language：English

Country：Australia
Combinatorial secure codes for traitor tracing International conference

Yujie Gu

The ninth Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM) 2023.6

　More details

Event date： 2023.6

Language：English

Country：Canada
Combinatorial secure codes for traitor tracing Invited

Yujie Gu

The ninth Canadian Discrete and Algorithmic Mathematics Conference, University of Manitoba and University of Winnipeg, Canada 2023.6

　More details

Event date： 2023.6

Language：English

researchmap
Secure codes with list decoding International conference

Yujie Gu, Ilya Vorobyev, and Ying Miao

IEEE International Symposium on Information Theory 2022.6

　More details

Event date： 2022.6

Language：English Presentation type：Oral presentation (general)

Country：Finland
On compressed sensing matrices breaking the square-root bottleneck International conference

Shohei Satake, Yujie Gu

IEEE Information Theory Workshop 2021.4

　More details

Event date： 2021.4

Language：English

Country：Italy
On private information retrieval with graph-based storage system

Bar Sadeh, Yujie Gu, Itzhak Tamo

電子情報通信学会研究会 2020.12

　More details

Event date： 2020.12

Language：English

Country：Japan
Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach International conference

Shohei Satake, Yujie Gu

IEEE International Symposium on Information Theory 2020.6

　More details

Event date： 2020.6

Language：English

Country：Italy
On the non-adaptive zero-error capacity of the discrete memoryless two-way channel International conference

Yujie Gu, Ofer Shayevitz

IEEE International Symposium on Information Theory 2019.7

　More details

Event date： 2019.7

Language：English

Country：France
On codes with the identifiable parent property for multimedia fingerprinting International conference

Yujie Gu

The 5th Taiwan-Japan Conference on Combinatorics and its Applications 2018.3

　More details

Event date： 2018.3

Language：English

Country：Taiwan, Province of China
New upper bounds for anti-collusion schemes: A graph theoretical approach

Yujie Gu

第14回数学総合若手研究集会〜数学の交叉点〜 2018.2

　More details

Event date： 2018.2

Language：English

Country：Japan
Digital fingerprinting: tracing back to traitors from pirates

Yujie Gu

離散数学とその応用研究集会 2017.8

　More details

Event date： 2017.8

Language：English

Country：Japan
Bounds on traceability schemes International conference

Yujie Gu, Ying Miao

The 26th British Combinatorial Conference 2017.7

　More details

Event date： 2017.7

Language：English

Country：United Kingdom
Parent-identifying set systems International conference

Yujie Gu

The Second Malta Conference in Graph Theory and Combinatorics 2017.6

　More details

Event date： 2017.6

Language：English

Country：Malta
著作権保護のための組合せ論 Invited

顧玉杰

実験計画法と関連する組合せ構造および統計教育 2023.11

　More details

Language：Japanese Presentation type：Oral presentation (invited, special)

researchmap
Secure codes with two-stage traitor tracing

Yujie Gu

2022 Symposium on Cryptography and Information Security 2022.1

　More details

Presentation type：Oral presentation (general)

researchmap
Secure codes with list decoding Invited

Yujie Gu

IEICE Technical Committee on Information Theory & Enriched MultiMedia 2022.5

　More details

researchmap
Private information retrieval over graphs Invited

Yujie Gu

Forum on Information Technology 2022, Keio University 2022.9

　More details

researchmap
Private Information Retrieval Meets Graph Based Replication Systems Invited

Yujie Gu

Nagoya Combinatorial Bi-monthly Seminar 2022.9

　More details

researchmap
Privacy Protection in Information Retrieval via Graph Edge Colorings Invited

Yujie Gu

Data Science Institute, Shandong University 2022.10

　More details

researchmap
On the security properties of combinatorial all-or-nothing transforms

Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai

2022 IEEE International Symposium on Information Theory (ISIT), Aalto University, Espoo, Finland 2022.6

　More details

researchmap
A mathematical study of copyright protection

Yujie Gu

Asian Deans' Forum 2022 - The Rising Stars Women in Engineering Workshop, University of New South Wales, Sydney, Australia 2022.11

　More details

Country：Australia

researchmap

▼display all

MISC

Empirical Evaluation of a Likelihood-based Zero-shot Detector for AI-generated Text Using Prompts

田口魁人, 顧玉杰, 櫻井幸一

IPSJ Technical Report 2024 ( DPS-198 ) No.43,1-7 2024.3

　More details

Language：Japanese

researchmap
Empirical Approach to Fine-Tuning Using Forgetting in Large Language Models Reviewed

Kaito Taguchi, Yujie Gu, Kouichi Sakurai

Smart Innovation, Systems and Technologies 2024

　More details

Language：English

researchmap
Empirical evaluation of a fine-tuning method using forgetting in large language models

田口魁人, 顧玉杰, 櫻井幸一

コンピュータセキュリティシンポジウム2023論文集 1574 - 1580 2023.10

　More details

Language：Japanese

researchmap
Experimental Accuracy Evaluation of Reconstructed Images in Model Inversion Attacks

村田壱生, 田口魁人, 顧玉杰, 櫻井幸一

コンピュータセキュリティシンポジウム2023論文集 1181 - 1186 2023.10

　More details

Language：Japanese

researchmap
Towards Evaluating the Security of Human Computable Passwords Using Neural Networks Reviewed

Issei Murata, Pengju He, Yujie Gu, Kouichi Sakurai

Information Security Applications 13720 LNCS 303 - 312 2023 （ ISSN:0302-9743 ISBN:9783031256585, 9783031256592 eISSN:1611-3349 ）

　More details

Language：English Publisher：Springer Nature Switzerland

Passwords are playing a major role for authentication in our daily life. However contemporary passwords are typically either difficult to remember or vulnerable to various attacks. In 2017, Blocki, Blum, Datta and Vempala introduced the concept of human computable passwords as a promising authentication method. The fundamental concerns for designing human computable passwords are their usability and security. So far, the security evaluation on human computable passwords authentication schemes is mainly based on complexity-theoretic analysis. In this paper, we initially investigate the security of human computable passwords against neural network-based adversarial attacks. Specifically, we employ the typical multilayer perceptron (MLP) model to attempt to attack the human computable passwords authentication scheme proposed by Blocki-Blum-Datta-Vempala. We present implementation results and the corresponding analysis as well. Our results imply that it is possible for an MLP to learn a simple function, but is difficult for an MLP to learn piecewise functions well.

DOI： 10.1007/978-3-031-25659-2_22

Scopus

researchmap
Entropy Analysis on Security of Combinatorial AONT

Akao Sonata, Yujie Gu, Kouichi Sakurai

Symposium on Cryptography and Information Security 3A3-4 2022.1

　More details

Language：Japanese

researchmap
Secure codes with two-stage traitor tracing

Yujie Gu

Symposium on Cryptography and Information Security 3F3-4 2022.1

　More details

researchmap

▼display all

Professional Memberships

IEEE
The Institute of Combinatorics and its Applications
The Japanese Society for Artificial Intelligence
The Mathematical Society of Japan
The Mathematical Society of Japan

　 More details

researchmap
The Japanese Society for Artificial Intelligence

　 More details

researchmap
The Institute of Combinatorics and its Applications

　 More details

researchmap
IEEE Information Theory Society

　 More details

researchmap

▼display all

Committee Memberships

Journal of Combinatorial Designs Editorial Board

2024 - Present

　 More details

researchmap
IEEE East Asian School of Information Theory (EASIT) 2024 Organizing Committee

2023 - Present

　 More details

researchmap
ACM Transactions on Probabilistic Machine Learning Senior Associate Editor

2023 - Present

　 More details

researchmap
The 19th International Workshop on Security (IWSEC) 2024 Organizing Committee

2023 - Present

　 More details

researchmap
The 18th International Workshop on Security (IWSEC) 2023 Organizing Committee

2022 - 2023

　 More details

researchmap

Academic Activities

Organizing Committee International contribution

The 19th International Workshop on Security (IWSEC) （ Kyoto Japan ） 2024.9

　More details

Type：Competition, symposium, etc.
Organizing Committee International contribution

IEEE East Asian School of Information Theory 2024 （ Shonan Village Center Japan ） 2024.7 - 2024.8

　More details

Type：Competition, symposium, etc.
Journal of Combinatorial Designs International contribution

2024.1 - Present

　More details

Type：Academic society, research group, etc.
離散数学とその応用研究集会2024・ミニシンポジウム「符号・暗号・人工知能」

Role(s)： Planning, management, etc.

2024 - 2024.8

　More details

Type：Academic society, research group, etc.

researchmap
Japanese Conference on Combinatorics and its Applications (JCCA)・Mini-Symposium "Codes, Cryptography & Artificial Intelligence"

Role(s)： Planning, management, etc.

2023.8

　More details

Type：Academic society, research group, etc.

researchmap
主催者

離散数学とその応用研究集会2023・ミニシンポジウム「符号・暗号・人工知能」（ Japan ） 2023.8 - Present

　More details

Type：Competition, symposium, etc.
Organizing Committee International contribution

The 18th International Workshop on Security (IWSEC) （ Japan ） 2023.8

　More details

Type：Competition, symposium, etc.
ACM Transactions on Probabilistic Machine Learning International contribution

2023.3 - Present

　More details

Type：Academic society, research group, etc.
Screening of academic papers

Role(s)： Peer review

2023

　More details

Type：Peer review

Number of peer-reviewed articles in foreign language journals：12

Proceedings of International Conference Number of peer-reviewed papers：10
Workshop "Combinatorial Approach to Machine Learning"

Role(s)： Planning, management, etc.

2022.9

　More details

Type：Academic society, research group, etc.

researchmap
組織委員

講演会「機械学習への組合せ論的アプローチ」（ Japan ） 2022.9 - Present

　More details

Type：Competition, symposium, etc.
Japanese Conference on Combinatorics and its Applications (JCCA)・Mini-Symposium "Codes, Cryptography & Artificial Intelligence"

Role(s)： Planning, management, etc.

2022.8

　More details

Type：Academic society, research group, etc.

researchmap
主催者

離散数学とその応用研究集会2022・ミニシンポジウム「符号・暗号・人工知能」（ Japan ） 2022.8 - Present

　More details

Type：Competition, symposium, etc.
IEEE International Symposium on Information Theory - List Decoding I

Role(s)： Panel moderator, session chair, etc.

2022.6 - 2022.7

　More details

Type：Competition, symposium, etc.

researchmap
Screening of academic papers

Role(s)： Peer review

2022

　More details

Type：Peer review

Number of peer-reviewed articles in foreign language journals：8

Proceedings of International Conference Number of peer-reviewed papers：2
組織委員・「符号・暗号・人工知能」ミニシンポジウムの世話人

離散数学とその応用研究集会（ Japan ） 2021.8 - Present

　More details

Type：Competition, symposium, etc.
Screening of academic papers

Role(s)： Peer review

2021

　More details

Type：Peer review

Number of peer-reviewed articles in foreign language journals：2

Proceedings of International Conference Number of peer-reviewed papers：3

▼display all

Research Projects

A Study on Secure Codes and Traitor Tracing Algorithms for Copyright Protection

2024.4 - 2027.3

日本学術振興会科学研究費助成事業

　 More details

Authorship：Principal investigator
A Study on Combinatorial Traitor Tracing Schemes for Broadcast Encryption

2021.4 - 2024.3

日本学術振興会科学研究費助成事業

　 More details

Authorship：Principal investigator

Educational Activities

サイバーセキュリティ基礎論　（基幹教育）
ソフトウェア実験 I (電気情報工学実験II, 電気情報工学実験III)

Class subject

ソフトウェア実験 I (電気情報工学実験II, 電気情報工学実験III)

2024.10 - 2025.3 Second semester
ソフトウェア実験 I (電気情報工学実験II, 電気情報工学実験III)

2023.10 - 2024.3 Second semester
ソフトウェア実験 I (電気情報工学実験II, 電気情報工学実験III)

2022.10 - 2023.3 Second semester
サイバーセキュリティ基礎論

2022.4 - 2022.6 Spring quarter
ソフトウェア実験 I (電気情報工学実験II, 電気情報工学実験III)

2021.10 - 2022.3 Second semester

FD Participation

2023.7 Role：Participation Title：シス情FD: 若手教員による研究紹介

Organizer：[Undergraduate school/graduate school/graduate faculty]
2023.6 Role：Participation Title：シス情FD: SBRC、QRECの活動ご紹介

Organizer：[Undergraduate school/graduate school/graduate faculty]
2023.4 Role：Participation Title：シス情FD: 若手教員による研究紹介

Organizer：[Undergraduate school/graduate school/graduate faculty]
2023.3 Role：Speech Title：ダイバーシティ研究環境実現イニシアティブ調査分析事業報告シンポジウム「女性活躍指標に基づく女性研究者活躍促進に関する国際調査」・九州大学先端型事業SENTAN-Q中間報告: SENTAN-Q Mid-Term Report

Organizer：University-wide
2023.1 Role：Participation Title：シス情FD: 若手教員による研究紹介

Organizer：[Undergraduate school/graduate school/graduate faculty]
2022.10 Role：Participation Title：シス情FD: 若手教員による研究紹介

Organizer：[Undergraduate school/graduate school/graduate faculty]
2022.7 Role：Speech Title：シス情FD: 若手教員による研究紹介: On Copyright and Privacy Protection

Organizer：[Undergraduate school/graduate school/graduate faculty]
2022.5 Role：Participation Title：シス情FD: 若手教員による研究紹介

Organizer：[Undergraduate school/graduate school/graduate faculty]
2022.4 Role：Participation Title：シス情FD: 第4期中期目標・中期計画等について

Organizer：[Undergraduate school/graduate school/graduate faculty]
2021.12 Role：Participation Title：シス情FD: 企業出身教員から見た大学

Organizer：[Undergraduate school/graduate school/graduate faculty]
2021.11 Role：Participation Title：シス情FD: 若手教員による研究紹介

Organizer：[Undergraduate school/graduate school/graduate faculty]
2021.6 Role：Participation Title：シス情FD: 若手教員による研究紹介

Organizer：[Undergraduate school/graduate school/graduate faculty]

▼display all

Other educational activity and Special note

2023 Coaching of Students' Association 研究室見学会チューリング祭卒業研究説明会オープンキャンパス研究室公開　九大女子高生インターンシップ
2022 Coaching of Students' Association 研究室見学会チューリング祭卒業研究説明会オープンキャンパス研究室公開　九大女子高生インターンシップ
2021 Coaching of Students' Association 研究室見学会チューリング祭卒業研究説明会オープンキャンパス研究室公開　九大女子高生インターンシップ

Social Activities

QURIESプログラム

2023.8

　More details

Audience：Infants,　Schoolchildren,　Junior students,　High school students
中学生の科学実験教室

2023.8

　More details

Audience：Infants,　Schoolchildren,　Junior students,　High school students
QURIESプログラム

2022.8

　More details

Audience：Infants,　Schoolchildren,　Junior students,　High school students
中学生の科学実験教室

2022.8

　More details

Audience：Infants,　Schoolchildren,　Junior students,　High school students
オープンキャンパス

2022

　More details

オープンキャンパス
QURIESプログラム

2021.8

　More details

Audience：Infants,　Schoolchildren,　Junior students,　High school students
中学生の科学実験教室

2021.8

　More details

Audience：Infants,　Schoolchildren,　Junior students,　High school students

Type：Seminar, workshop
オープンキャンパス

2021

　More details

オープンキャンパス

▼display all

Travel Abroad

2023.6

Staying countory name 1：Canada Staying institution name 1：The University of Winnipeg
2022.10 - 2022.11

Staying countory name 1：Australia Staying institution name 1：University of New South Wales
2022.6 - 2022.7

Staying countory name 1：Finland Staying institution name 1：Aalto University
2022.6

Staying countory name 1：Germany Staying institution name 1：IOTA Foundation
2020.10

Staying countory name 1：Israel Staying institution name 1：Tel Aviv University