{"title":"椭圆曲线上使用公钥和随机消息的零知识密码认证协议","authors":"A. Onatskiy","doi":"10.33243/2313-7010-26-22-28","DOIUrl":null,"url":null,"abstract":"We propose a cryptographic protocol with zero-knowledge proof (ZKP) on elliptic curves (EC) using public keys and random messages, allowing to establish the truth of a statement not conveying any additional information about the statement itself. The cryptographic protocols based on zero-knowledge proof allow identification, key exchange and other cryptographic operations to be performed without leakage of sensitive information during the information exchange. The implementation of the cryptographic protocol of the zero-knowledge proof on the basis of the mathematical apparatus of elliptic curves allows to significantly reduce the size of the protocol parameters and increase its cryptographic strength (computational complexity of the breaking). The security of cryptosystems involving elliptic curves is based on the difficulty of solving the elliptic curve discrete logarithm problem. We determine the completeness and correctness of the protocol and give an example of the calculation is given. The cryptographic protocol was modeled in the High-Level Protocol Specification Language, the model validation and verification of the protocol were also performed. The software verification of the cryptographic protocol was performed using the software modules On the Fly Model Checker and Constraint Logic based Attack Searcher. In order to validate the cryptographic protocol resistance to intruder attacks, we used the Security Protocol Animator package for Automated Validation of Internet Security Protocols and Applications. The security of the proposed cryptographic protocol ZKP EC is based on the difficulty of solving the elliptic curve discrete logarithm problem). The recommended elliptical curves according to DSTU 4145-2002 may be used to implement such cryptographic protocol.","PeriodicalId":13026,"journal":{"name":"Historical research in the context of data science: Information resources, analytical methods and digital technologies","volume":"32 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CRYPTOGRAPHIC AUTHENTICATION PROTOCOL ZERO-KNOWLEDGE SECRET ON ELLIPTIC CURVES USING PUBLIC KEYS AND RANDOM MESSAGES\",\"authors\":\"A. Onatskiy\",\"doi\":\"10.33243/2313-7010-26-22-28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a cryptographic protocol with zero-knowledge proof (ZKP) on elliptic curves (EC) using public keys and random messages, allowing to establish the truth of a statement not conveying any additional information about the statement itself. The cryptographic protocols based on zero-knowledge proof allow identification, key exchange and other cryptographic operations to be performed without leakage of sensitive information during the information exchange. The implementation of the cryptographic protocol of the zero-knowledge proof on the basis of the mathematical apparatus of elliptic curves allows to significantly reduce the size of the protocol parameters and increase its cryptographic strength (computational complexity of the breaking). The security of cryptosystems involving elliptic curves is based on the difficulty of solving the elliptic curve discrete logarithm problem. We determine the completeness and correctness of the protocol and give an example of the calculation is given. The cryptographic protocol was modeled in the High-Level Protocol Specification Language, the model validation and verification of the protocol were also performed. The software verification of the cryptographic protocol was performed using the software modules On the Fly Model Checker and Constraint Logic based Attack Searcher. In order to validate the cryptographic protocol resistance to intruder attacks, we used the Security Protocol Animator package for Automated Validation of Internet Security Protocols and Applications. The security of the proposed cryptographic protocol ZKP EC is based on the difficulty of solving the elliptic curve discrete logarithm problem). The recommended elliptical curves according to DSTU 4145-2002 may be used to implement such cryptographic protocol.\",\"PeriodicalId\":13026,\"journal\":{\"name\":\"Historical research in the context of data science: Information resources, analytical methods and digital technologies\",\"volume\":\"32 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Historical research in the context of data science: Information resources, analytical methods and digital technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33243/2313-7010-26-22-28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Historical research in the context of data science: Information resources, analytical methods and digital technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33243/2313-7010-26-22-28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
我们提出了一种使用公钥和随机消息在椭圆曲线(EC)上具有零知识证明(ZKP)的加密协议,允许在不传递任何关于陈述本身的额外信息的情况下建立陈述的真实性。基于零知识证明的密码协议允许在信息交换过程中不泄露敏感信息的情况下进行身份识别、密钥交换等密码操作。基于椭圆曲线的数学装置实现零知识证明的密码协议,可以显著减小协议参数的大小,提高其密码强度(破解的计算复杂度)。椭圆曲线离散对数问题求解的难易程度决定了椭圆曲线密码系统的安全性。我们确定了协议的完备性和正确性,并给出了计算实例。采用高级协议规范语言对加密协议进行了建模,并对协议进行了模型验证和验证。利用On The Fly模型检查器和基于约束逻辑的攻击搜索器软件模块对加密协议进行了软件验证。为了验证加密协议对入侵者攻击的抵抗力,我们使用了安全协议动画器包来自动验证互联网安全协议和应用程序。所提出的加密协议ZKP - EC的安全性基于求解椭圆曲线离散对数问题的难易程度。根据DSTU 4145-2002推荐的椭圆曲线可以用来实现这种加密协议。
CRYPTOGRAPHIC AUTHENTICATION PROTOCOL ZERO-KNOWLEDGE SECRET ON ELLIPTIC CURVES USING PUBLIC KEYS AND RANDOM MESSAGES
We propose a cryptographic protocol with zero-knowledge proof (ZKP) on elliptic curves (EC) using public keys and random messages, allowing to establish the truth of a statement not conveying any additional information about the statement itself. The cryptographic protocols based on zero-knowledge proof allow identification, key exchange and other cryptographic operations to be performed without leakage of sensitive information during the information exchange. The implementation of the cryptographic protocol of the zero-knowledge proof on the basis of the mathematical apparatus of elliptic curves allows to significantly reduce the size of the protocol parameters and increase its cryptographic strength (computational complexity of the breaking). The security of cryptosystems involving elliptic curves is based on the difficulty of solving the elliptic curve discrete logarithm problem. We determine the completeness and correctness of the protocol and give an example of the calculation is given. The cryptographic protocol was modeled in the High-Level Protocol Specification Language, the model validation and verification of the protocol were also performed. The software verification of the cryptographic protocol was performed using the software modules On the Fly Model Checker and Constraint Logic based Attack Searcher. In order to validate the cryptographic protocol resistance to intruder attacks, we used the Security Protocol Animator package for Automated Validation of Internet Security Protocols and Applications. The security of the proposed cryptographic protocol ZKP EC is based on the difficulty of solving the elliptic curve discrete logarithm problem). The recommended elliptical curves according to DSTU 4145-2002 may be used to implement such cryptographic protocol.