About Me

Edited: February 11, 2023

CONTACT ME

Name: Jiale Cheng (ORCiD:0000-0003-1379-4324)
Southeast University, Nanjing, China (Post Code: 210096)
National Mobile Communications Research Laboratory, Room 5319
Email: jlcheng AT umich DOT edu (jlcheng@umich.edu) or click the mailbox.
Personal Website: jiale-cheng.github.io
My CV (last update: 2023-5-15).

BASIC INFORMATION

Jiale Cheng (Student Member, IEEE) received the B.S. degree (Hons.) in information engineering from the Chien-Shiung Wu Honored College, Southeast University, China, in 2020, where he is currently pursuing the M.S. degree with the School of Information Science and Engineering. His research interests includes information theory and computation security. In 2021, he served as an Invited Reviewer for the IEEE International Symposium on Information Theory (ISIT).

CURRENT RESESARCH INTEREST

Information Theory, Network Coding and its applications

EDUCATION

Southeast University (SEU), Chien-Shiung Wu Honored College, Nanjing, China, 09/2016- 06/2020

Bachelor of Engineering in InformationEngineering
Honors: Honored Graduate of Chien-Shiung Wu Honored College, National Endeavour Fellowship

Southeast University (SEU), School of Information Science and Engineering, Nanjing, China, 09/2020-06/2023

Master of Engineering (Pursuing) in Communications
Supervisor: Nan Liu, Wei Kang
Research Fields: Information Theory, Network Coding, Private Information Retrieval, Coded Caching, Secure Multiparty Computation

University of Michigan, Ann Arbor, U.S., Doctor of Philosophy (pursuing) in Electrical and Computer Engineering(ECE), 08/2023-Present

Supervisor: Hessam Mahdavifar
Track: Network, Communication, and Information Systems
Research Fields: information theory, network coding, coding theory

JOURNAL PUBLICATIONS

J. Cheng, N. Liu, W. Kang and Y. Li, “The Capacity of Symmetric Private Information Retrieval Under Arbitrary Collusion and Eavesdropping Patterns,” in IEEE Transactions on Information Forensics and Security, vol. 17, pp. 3037-3050, 2022.

Abstract: We study the symmetric private information retrieval (SPIR) problem under arbitrary collusion and eavesdropping patterns for replicated databases. We find its capacity, which is the same as the capacity of the original SPIR problem with the number of servers N replaced by a number $ F^* $ . The number $ F^* $ is the optimal solution to a linear programming problem, and it is a function of the joint pattern, which is the union of the collusion and eavesdropping pattern. This is the first result that shows how two arbitrary patterns collectively affect the capacity of the SPIR problem. We draw the conclusion that for SPIR problems, the collusion and eavesdropping constraints are interchangeable in terms of capacity, i.e., the two patterns play the same role in the SPIR problem and the capacity remains unchanged if we exchange the colluding and eavesdropping patterns. As corollaries of our result, the capacity of the SPIR problem under arbitrary collusion patterns, and the capacity of the PIR problem where each colluding set is included in some eavesdropping set, are also found. Some extensions with restrictions to finite message lengths are provided, and in this case, upper and lower bounds on the capacity are given. The lower bound is described with a solution to an integer linear programming problem.
Date of Publication: 24 August 2022
DOI: 10.1109/TIFS.2022.3201375
Get Paper

J. Cheng, N. Liu, W. Kang, “On the Asymptotic Capacity of Information Theoretical Privacy-preserving Epidemiological Data Collection,” in Entropy (Special Issue: Advances in Information and Coding Theory), vol. 25, no. 4:625, 2023, . (Featured Paper)

Abstract: We formulate a new secure distributed computation problem, where a simulation center can require any linear combination of K workers’ data through a caching layer consisted of $N$ servers. The workers, servers and the simulation center do not trust each other. For workers, any worker’s data is required to be protected from up to $E$ servers; for the server, any more information than the desired linear combination cannot be leaked; and for the simulation center, any single server know nothing about the coefﬁcients of the linear combination. Our goal is to ﬁnd the optimal download cost which is deﬁned as the size of message uploaded to the simulation center by the servers, to the size of desired linear combination. We proposed a scheme with the optimal download cost when $E < N − 1$. We also prove that when $E ≥ N − 1$, the scheme is not feasible.
Date of Publication: 26 March 2023
DOI: 10.3390/e25040625
Get Paper

CONFERENCE PARTICIPATION

2022 IEEE East Asian School of Information Theory (EASIT2022), Shenzhen, China 08/2022

Participated as a student member
Student Poster Session: “The Capacity of Symmetric Private Information Retrieval Under Arbitrary Collusion and Eavesdropping Patterns”

2021 IEEE East Asian School of Information Theory (EASIT2021), Online 08/2021

Participated as a student member

2021 IEEE International Symposium on Information Theory (ISIT2021), Melbourne, Australia 07/2021

Served as an invited reviewer of paper

2019 IEEE International Workshop on Signal Processing Systems (SiPS2019), Nanjing, China 10/2019

Student Poster Session & Oral Presentation: “The Design and Simulation of Phased Array Focus in Ultrasonic Wireless Power Transmission”

American Association of Physics Teachers (AAPT) Summer Meeting, Cincinnati, OH 07/2017

Student Poster Session: “On the falling of a rigid body”

RESEARCH EXPERIENCE

National Engineering Research Center for Optical Sensor and Communication Integrated Network (OSCC) Nanjing, China, 09/2018-02/2020

Using the Phased Array Focus to study the Ultrasonic Wireless Power Transmission;
Responsible for the simulation of a proposed design before physical implementation;
Participated in SiPS2019

National Mobile Communications Research Laboratory (NCRL) Nanjing, China, 09/2020-Present

Interests in information theory and network coding;
Participate in the National Key Research and Development Project
Filed a patent in China (Publication No. CN 114567488 A)

HONORS & AWARDS

The Rackham Ph.D. Student Fellowship, 2023
National Endeavour Fellowship of China, SEU, 2017
Honor Mentioned in Mathematical Contest of Modeling (MCM), 2019
IEEE Student Member,2021
IEEE Information Theory Society Membership, 2021

SKILLS & INTERESTS

Language Skills: Chinese (native), English (fluent), Japanese (elementary knowledge)
Computer Skills: MATLAB, C/C++, Microsoft Office Tools, LaTeX, Mathematica, Photoshop
Interests: Reading, Piano, Table Tennis

This Site

When I started writing on this website, I wanted to share notes on what I have learned. I benefited a lot from many insightful blogs and now I have something to give back. Watching my notes published on websites also gives me motivation and a strange consolation.

I also realized that this website can be used as a billboard of my professional backgrounds. This is a great proof for what I have learned.

Posts

The posts are at different status.

Status	Meaning
Completed	This post is considered completed, but I might edit it when I came up with something new.
Writing	This post is being actively edited.
Paused	This post is considered of low priority. I will come back to this post later.
Archived	This post is outdated and probably won’t receive any update.

Sources

This website (source code here) uses these sources:

Module	Mainly used in	License/ TOS
Particle.js	Homepage	MIT
Visitor map	Homepage, footer	TOS
Homepage and color scheme	Layout @ homepage, color scheme @ all pages	MIT
List of recent post	Homepage, Post index	MIT
Search	Post index, Tags index	MIT
Side bar	Post, all pages with these elements	MIT
Table of content	Post	BSD-3 or MIT
Markdown vue theme and color scheme	Markdown theme @ Post, color scheme @ all pages	Apache-2.0
Tags, Tag cloud, Tag page	Post, Post index, Tags index	MIT, repo here. Tag page inspired by haixing-hu
Font size adjustment	Post	MIT
comment	Post	APGL-3.0
404 T-rex game	404 page	fromChromium source code, license
Encryption	Secret Pages	MIT

Additional licensing information can be found here.

I mainly use Typora to write my post.

Copyright Notice

All articles on this site that do not indicate the source are original articles, following the CC 4.0 BY-SA copyright agreement.

When reposting articles on this site, you can add HTML codes to allow each article to automatically add a “reprint statement”. The code is as follows:

<div style="background:#ff6a00; color:#0; font-size:small;">
    <p>
            author: 
            <a href="http://jaylencheng.github.io/">Jaylen Cheng</a>
    </p>
    <p>
            source:
            <a href="http://jaylencheng.github.io/">http://www.github.com/jaylencheng/></a>
    </p>
    <p>
            About the author: A theoretical communication dog, please give me more advice!
    </p>

    <p>
             The copyright of this article belongs to the author, welcome to reprint, but without the author's consent, this statement must be kept, and it is given in a prominent position on the article page,
             <a href="#" onclick="Curgo()" style="background:#b6ff00; color:#0; font-size:medium;">Original link</a>
             If you have any questions, please email (jaylencheng@outlook.com) for consultation.
    </p>


    <script type="text/javascript">
     function Curgo()
     {
         window.open(window.location.href);
     }
    </script>
</div>

Thanks for being here.

Hope you will like my article and gain something from it.