{"title":"选择前缀冲突攻击研究综述","authors":"M.M.J. Stevens","doi":"10.1017/9781108854207.009","DOIUrl":null,"url":null,"abstract":"Cryptographic hash functions are the swiss army knives within cryptography. They are used in many applications including digital signature schemes, message authentication codes, password hashing, cryptocurrencies and content-addressable storage. The security or even the proper functioning of these applications relies on the security property that is the main focus of this chapter: collision resistance. For instance, all major digital signature schemes rely on the hash-then-sign paradigm. This implies that for any colliding pair x , y with H(x) = H(y), any signature for x is also an unwanted valid signature for y, and vice versa. When finding meaningful collision pairs (x, y) is practical, this can have grave implications as will become clear below.","PeriodicalId":274354,"journal":{"name":"Computational Cryptography","volume":"100 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Survey of Chosen-Prefix Collision Attacks\",\"authors\":\"M.M.J. Stevens\",\"doi\":\"10.1017/9781108854207.009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cryptographic hash functions are the swiss army knives within cryptography. They are used in many applications including digital signature schemes, message authentication codes, password hashing, cryptocurrencies and content-addressable storage. The security or even the proper functioning of these applications relies on the security property that is the main focus of this chapter: collision resistance. For instance, all major digital signature schemes rely on the hash-then-sign paradigm. This implies that for any colliding pair x , y with H(x) = H(y), any signature for x is also an unwanted valid signature for y, and vice versa. When finding meaningful collision pairs (x, y) is practical, this can have grave implications as will become clear below.\",\"PeriodicalId\":274354,\"journal\":{\"name\":\"Computational Cryptography\",\"volume\":\"100 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Cryptography\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/9781108854207.009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Cryptography","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/9781108854207.009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cryptographic hash functions are the swiss army knives within cryptography. They are used in many applications including digital signature schemes, message authentication codes, password hashing, cryptocurrencies and content-addressable storage. The security or even the proper functioning of these applications relies on the security property that is the main focus of this chapter: collision resistance. For instance, all major digital signature schemes rely on the hash-then-sign paradigm. This implies that for any colliding pair x , y with H(x) = H(y), any signature for x is also an unwanted valid signature for y, and vice versa. When finding meaningful collision pairs (x, y) is practical, this can have grave implications as will become clear below.