Raju Gangishetti, M. C. Gorantla, M. Das, A. Saxena, V. Gulati
{"title":"基于id的密码系统中有效的安全密钥发布协议","authors":"Raju Gangishetti, M. C. Gorantla, M. Das, A. Saxena, V. Gulati","doi":"10.1109/ITCC.2005.75","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient and secure protocol for key issuing in ID-based cryptosystems using bilinear pairings. We use a simple blinding technique to eliminate the need of secure channel and multiple authorities approach to avoid the key escrow problem. We show that our protocol overcomes the disadvantages of other pairing based schemes and is efficient compared to the existing key issuing protocol.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":"{\"title\":\"An efficient secure key issuing protocol in ID-based cryptosystems\",\"authors\":\"Raju Gangishetti, M. C. Gorantla, M. Das, A. Saxena, V. Gulati\",\"doi\":\"10.1109/ITCC.2005.75\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an efficient and secure protocol for key issuing in ID-based cryptosystems using bilinear pairings. We use a simple blinding technique to eliminate the need of secure channel and multiple authorities approach to avoid the key escrow problem. We show that our protocol overcomes the disadvantages of other pairing based schemes and is efficient compared to the existing key issuing protocol.\",\"PeriodicalId\":326887,\"journal\":{\"name\":\"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"39\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCC.2005.75\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2005.75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient secure key issuing protocol in ID-based cryptosystems
This paper presents an efficient and secure protocol for key issuing in ID-based cryptosystems using bilinear pairings. We use a simple blinding technique to eliminate the need of secure channel and multiple authorities approach to avoid the key escrow problem. We show that our protocol overcomes the disadvantages of other pairing based schemes and is efficient compared to the existing key issuing protocol.