{"title":"Broadcast Authentication Protocol with Time Synchronization and Quadratic Residues Chain","authors":"B. Groza","doi":"10.1109/ARES.2007.52","DOIUrl":null,"url":null,"abstract":"Assuring information authenticity is an important issue in the field of information security. A new broadcast authentication protocol is proposed. The protocol is based on time synchronization and uses chains constructed with the squaring function. The proposed solution is efficient for transmissions over long periods of time since the chains have an unbounded length. The protocol assures information authenticity at the reduced cost of almost one modular multiplication for each broadcasted packet. Time synchronization issues are discussed and the security of the protocol is equivalent to factoring since the squaring function is used. A failure mode analysis of the protocol is done; this is also an aspect of novelty and applies to other protocols based on time synchronization as well","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"65 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Second International Conference on Availability, Reliability and Security (ARES'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARES.2007.52","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
Assuring information authenticity is an important issue in the field of information security. A new broadcast authentication protocol is proposed. The protocol is based on time synchronization and uses chains constructed with the squaring function. The proposed solution is efficient for transmissions over long periods of time since the chains have an unbounded length. The protocol assures information authenticity at the reduced cost of almost one modular multiplication for each broadcasted packet. Time synchronization issues are discussed and the security of the protocol is equivalent to factoring since the squaring function is used. A failure mode analysis of the protocol is done; this is also an aspect of novelty and applies to other protocols based on time synchronization as well