About Me

CONTACT ME

• Southeast University, Nanjing, China (Post Code: 210096)
• National Mobile Communications Research Laboratory, Room 5319
• Born in Bozhou, China, on Nov. 17th, 1999
• Tel: (+86)158-5069-8678
  
• Email: jlcheng AT seu DOT edu DOT cn (jlcheng@seu.edu.cn)
• Personal Website: jaylencheng.github.io

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
• Relevant Coursework: Introduction to Information Transmission, Principle of Communication, Optimization Methods for Communications and Signal Processing
• Honors: Honored Graduate of Chien-Shiung Wu Honored College, National Endeavour Fellowship
• Cumulative GPA: 3.29/4.00

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

• 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
• Courses: Network Coding, Network Information Theory, Detection & Estimation, Random Process
• Estimated GPA: 3.9/4.0

JOURNAL PUBLICATIONS

1. 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, doi: 10.1109/TIFS.2022.3201375.

• 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

2. J. Cheng, N. Liu, W. Kang, "On the Asymptotic Capacity of Information Theoretical Privacy-preserving Epidemiological Data Collection", to be submitted to Entropy.

• 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 coefficients of the linear combination. Our goal is to find the optimal download cost which is defined 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.
• To be submitted to Entropy Special Issue “Advances in Information and Coding Theory”
• 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)

EXTRACURRICULAR ACTIVITY

Jiangsu Blood Center, Nanjing, China, 10/2017-09/2018

• Served as a volunteer in Jiangsu Blood Center to offer assistance for the blood donors
• Enrolled as a registered volunteer of the Red Cross Society of China

HONORS & AWARDS

• 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

About the Website

Website column

1. In Hom, there are generally some technical blogs written by myself, and some contact information on the sidebar and bottom
2. SRC contains some private items shared by myself. Including some of my project addresses and brief introductions, as well as my usual thoughts caused by some trivial matters, some classical song reviews, and commemorations of important days, etc.
3. ABOUT are some websites that I found helpful for daily learning, including blog websites of domestic and foreign masters, useful MOOC addresses, and practical Small program website, etc.
4. TAGS is the classification of blogs written by myself. Readers can view all the content I published on this field through tags to avoid cumbersome searches .

Part of the way of using this site

1. This site is an open source website. For the source code of the website project, see Cata project address. You may modify and redistribute the code under the terms of the GNU General Public License, Version 3, as published by the Free Software Foundation, or (at your option) with any later version. Source code is released in the hope that it will be useful, but without any warranty. There is not even an implied warranty of fitness for a particular purpose. See “GNU General Public License” for more details. The blog content is original content, see [Copyright Statement] (https://jaylencheng.github.io/2099/01/01/About-Me-(Set-As-Top)/#%E7%89%88 %E6%9D%83%E5%A3%B0%E6%98%8E) must be marked.
2. This site uses kramdown in MathJax for formula rendering. You can right-click on the formula to view the content of the formula, change the size and language, and extract the html and latex codes corresponding to the formula.
3. The picture bed in this site is based on CSDN and GitHub picture bed, the latter may be available in China In the case that it cannot be opened or opened slowly, the frequency of this phenomenon can be reduced by scientifically surfing the Internet. (Therefore, this site will also try to move the picture bed to the site in the future to reduce the possibility of such phenomena.)
4. There are still links of bloggers on other platforms on this site. There will be other links in the sidebar introduction of the main page or at the bottom of each page, hoping to discover more common interests.
5. Suggestions on this site, understanding of the content and doubts are welcome to leave a message below each blog post (GitHub account is required), or click on the mailbox on the homepage to automatically pop up an email and write to me directly.
6. For the development log, see Development Log
7. This site is a non-profit website based on my own interests. I do not accept any advertisements or publicity, and I will not consider accepting any form of rewards and donations on the grounds of this site. All in all, the help I have received, the support of all readers, my desire to write and my desire to share have contributed to this website. If you like this site, you can go to Github to order a star, I will be very happy

Android app

At present, an Android app has been developed, and the download link is as follows: > Stable version (the version that can be used normally, the size is small, recommended): the current version number is 2.0.4

Download link: https://share.weiyun.com/6Ds7tXsi

Or scan the QR code

HD version (for Android tablets, the screen will always be horizontal when used on mobile phones): version number 2.0.4

Download link: https://share.weiyun.com/sfaxcpDt

Or scan the QR code

Beta version (beta version) (version for development or new functions, larger in size, various new plug-ins will appear first in this version, but it may also be prone to bugs): current version number 1.0.1

Download link: https://share.weiyun.com/l983XeaV

Or scan the QR code

In the existing Android version, in order to display as much content as possible on the mobile phone screen, the directory plug-in for blog browsing is castrated, and the column appears in the upper right corner in the form of a small task bar.

Due to the strict review mechanism for app development on iOS devices, the development of iOS devices will not be carried out for the time being. iOS users can use the safari browser to open the URL https://jaylencheng.github.io, and then operate as shown below:

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.