由密钥预分配方案-小密钥池引起的随机图中的连通性

2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-05-13 DOI:10.1109/CISS.2010.5464934

Osman Yağan, A. Makowski

{"title":"由密钥预分配方案-小密钥池引起的随机图中的连通性","authors":"Osman Yağan, A. Makowski","doi":"10.1109/CISS.2010.5464934","DOIUrl":null,"url":null,"abstract":"We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity, and provide simple proofs for small key pools.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Connectivity in random graphs induced by a key predistribution scheme - small key pools\",\"authors\":\"Osman Yağan, A. Makowski\",\"doi\":\"10.1109/CISS.2010.5464934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity, and provide simple proofs for small key pools.\",\"PeriodicalId\":118872,\"journal\":{\"name\":\"2010 44th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 44th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2010.5464934\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2010.5464934","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

摘要

研究了Eschenauer和Gligor的随机密钥预分配方案在完全可见性假设下的随机图。我们报告了最近关于图连通性的一个推测的0 - 1定律的结果，并提供了小密钥池的简单证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Connectivity in random graphs induced by a key predistribution scheme - small key pools

We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity, and provide simple proofs for small key pools.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 44th Annual Conference on Information Sciences and Systems (CISS)

自引率

0.00%

发文量