Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models
From MaRDI portal
Publication:2977280
DOI10.1109/TIT.2015.2450729zbMATH Open1359.94961MaRDI QIDQ2977280FDOQ2977280
Authors: Lifeng Lai, Siu-Wai Ho
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- Secret Key Generation for a Pairwise Independent Network Model
- scientific article; zbMATH DE number 219244
- Graph-theoretic design and analysis of key predistribution schemes
- Graphanalytical model of key distribution in networks with dynamic architecture
- Secret-Key Generation in Many-to-One Networks: An Integrated Game-Theoretic and Information-Theoretic Approach
- Secret Key Generation for Minimally Connected Hypergraphical Sources
- About secure independence in graphs
- On some properties of graph based public keys
- A graph theoretic method for securing key fobs
Cited In (2)
This page was built for publication: Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977280)