Skip directly to content

Minimize RSR Award Detail

Research Spending & Results

Award Detail

Doing Business As Name:Ohio State University
  • Yingbin Liang
  • (609) 658-1330
Award Date:11/30/2017
Estimated Total Award Amount: $ 169,683
Funds Obligated to Date: $ 169,682
  • FY 2016=$169,682
Start Date:10/01/2017
End Date:07/31/2019
Transaction Type:Grant
Awarding Agency Code:4900
Funding Agency Code:4900
CFDA Number:47.070
Primary Program Source:040100 NSF RESEARCH & RELATED ACTIVIT
Award Title or Description:CIF: Small: Collaborative Research: Secret Key Generation Under Resource Constraints
Federal Award ID Number:1801846
DUNS ID:832127323
Parent DUNS ID:001964634
Program Officer:
  • Phillip Regalia
  • (703) 292-8910

Awardee Location

Street:Office of Sponsored Programs
Awardee Cong. District:03

Primary Place of Performance

Organization Name:Ohio State University
Street:Dreese Lab
Cong. District:03

Abstract at Time of Award

Common shared keys, which can be used for encryption/decryption, authentication and various other security primitives, plays a fundamental role in securing modern digital systems. Due to such significant importance, there has been a tremendous amount of work on the design of key generation/distribution schemes. Despite of these efforts, significant challenges, such as scalability and availability, remain to be fully addressed. This project investigates information theoretic approaches for secret key generation with focuses on fundamental and challenging issues under more realistic models. The resulting schemes are anticipated to be more easily applied to the design of practical wireless networks. The project will leverage collaboration with industries and will actively involve students with various backgrounds. In particular, the project will develop key generation schemes under the framework of key generation via public discussion. The standard scheme under this framework is a so-called "omniscience" scheme. However, such a scheme requires all nodes in the network to transmit, assumes the public discussion is heard noiselessly by all nodes in the network, and does not take the implementation complexity into consideration. While these assumptions enable the tractability of the problems and facilitate to obtain crucial insights, in order for such studies to provide useful and accurate guidance in practice, realistic constraints must be taken into consideration, which pose three fundamental directions that this project will explore. In this project, thrust 1 focuses on key generation with vocality constraints that addresses the following fundamental question: for a general source network, is it possible to design schemes that involve only a subset of nodes to talk but still achieve the key capacity? Thrust 2 focuses on key generation with physical channel constraints. In particular, motivated by constraints associated with physical channels, the project will design key generation scheme for scenarios when the public discussion of each node can only be received by nodes in its transmission range and the simultaneous transmission of multiple nodes will interfere with each other. Thrust 3 focuses on key generation with complexity constraints and investigates how to minimize the complexity in the design of key generation schemes and how to reduce computational resource consumption required for key generation schemes.

Publications Produced as a Result of this Research

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

C. Li, Y. Liang, H. V. Poor, S. Shamai (Shitz) "A coding theorem for colored Gaussian wiretap channels with feedback" Proc. IEEE International Symposium on Information Theory (ISIT), v., 2018, p..

M. Dikshtein, R. Duan, Y. Liang and S. Shamai (Shitz) "State-dependent parallel Gaussian channels with a state-cognitive Helper" Proc. International Zurich Seminar on Information and Communication (IZS), v., 2018, p..

S. Zou and Y. Liang and L. Lai and H. V. Poor and S. Shamai (Shitz) "Degraded broadcast channel with secrecy outside a bounded range" IEEE Trans. Inf. Theory, v.64, 2018, p.2104.

For specific questions or comments about this information including the NSF Project Outcomes Report, contact us.