Goichiro Hanaoka, Satsuya Ohata, Takahiro Matsuda, K. Nuida, Nuttapong Attrapadung
{"title":"基于模块化方法设计具有高级功能的密码系统的方法学","authors":"Goichiro Hanaoka, Satsuya Ohata, Takahiro Matsuda, K. Nuida, Nuttapong Attrapadung","doi":"10.5571/SYNTHENG.7.92","DOIUrl":null,"url":null,"abstract":"−92− Synthesiology English edition Vol.7 No.2 pp.92-104 (Sep. 2014) on average 34 pages long of which on average 24 pages were devoted to security definitions and security proofs. The contents are lists of difficult-to-understand mathematical formulas, and it is not easy to understand the correlation between these formulas and actual security. This is thought to be the major barrier in introducing highly functional cryptographic schemes to the real world. Particularly, even specialized researchers find it difficult to be convinced of the security, and a general user cannot be expected to use these schemes with full confidence. In fact, error in proof is often discovered later, even with cryptographic schemes that the designers have claimed that their security has been mathematically proven. Hereinafter, this problem will be called the security verification problem in cryptographic schemes.","PeriodicalId":39206,"journal":{"name":"Synthesiology","volume":"172 1","pages":"92-104"},"PeriodicalIF":0.0000,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Methodology for designing cryptographic systems with advanced functionality based on a modular approach\",\"authors\":\"Goichiro Hanaoka, Satsuya Ohata, Takahiro Matsuda, K. Nuida, Nuttapong Attrapadung\",\"doi\":\"10.5571/SYNTHENG.7.92\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"−92− Synthesiology English edition Vol.7 No.2 pp.92-104 (Sep. 2014) on average 34 pages long of which on average 24 pages were devoted to security definitions and security proofs. The contents are lists of difficult-to-understand mathematical formulas, and it is not easy to understand the correlation between these formulas and actual security. This is thought to be the major barrier in introducing highly functional cryptographic schemes to the real world. Particularly, even specialized researchers find it difficult to be convinced of the security, and a general user cannot be expected to use these schemes with full confidence. In fact, error in proof is often discovered later, even with cryptographic schemes that the designers have claimed that their security has been mathematically proven. Hereinafter, this problem will be called the security verification problem in cryptographic schemes.\",\"PeriodicalId\":39206,\"journal\":{\"name\":\"Synthesiology\",\"volume\":\"172 1\",\"pages\":\"92-104\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Synthesiology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5571/SYNTHENG.7.92\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Social Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Synthesiology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5571/SYNTHENG.7.92","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Social Sciences","Score":null,"Total":0}
引用次数: 4
摘要
−92−synthesis edition英文版Vol.7 no . pp.92-104(2014年9月),平均34页,其中平均24页为安全定义和安全证明。内容是一些难以理解的数学公式列表,要理解这些公式与实际安全性之间的相关性并不容易。这被认为是将高功能加密方案引入现实世界的主要障碍。特别是,即使是专业的研究人员也很难确信其安全性,并且不能期望普通用户完全放心地使用这些方案。事实上,证明中的错误往往是后来才发现的,即使是设计人员声称其安全性已经得到数学证明的加密方案。以下将此问题称为密码方案中的安全验证问题。
Methodology for designing cryptographic systems with advanced functionality based on a modular approach
−92− Synthesiology English edition Vol.7 No.2 pp.92-104 (Sep. 2014) on average 34 pages long of which on average 24 pages were devoted to security definitions and security proofs. The contents are lists of difficult-to-understand mathematical formulas, and it is not easy to understand the correlation between these formulas and actual security. This is thought to be the major barrier in introducing highly functional cryptographic schemes to the real world. Particularly, even specialized researchers find it difficult to be convinced of the security, and a general user cannot be expected to use these schemes with full confidence. In fact, error in proof is often discovered later, even with cryptographic schemes that the designers have claimed that their security has been mathematically proven. Hereinafter, this problem will be called the security verification problem in cryptographic schemes.