CIF

The project aims at quantifying a general network's inner potential for supporting various forms of security by achieving secret common randomness between pairs or groups of its nodes. Statistical and computational secrecy measures are being considered against a general passive adversary. Common-randomness-achieving protocols are classified into two groups: culture-building and crowd-shielding. The former achieves common randomness between nodes situated in close proximity of each other, from correlated observations of specific (natural or induced) network phenomena.

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.