{"title":"非交互不可否认签名加密的通用结构","authors":"Jia Fan, Lijun Zhang","doi":"10.1109/CSMA.2015.10","DOIUrl":null,"url":null,"abstract":"Non-interactive non-repudiation is a very important property of signcryption which enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we construct the generic \"Sign-then-Encrypt\" and \"Encrypt-then-Sign\" compositions for signcryption with non-interactive non-repudiation by making use of a normal digital signature primitive as well as a primitive called public key encryption with non-interactive opening. We then analyze the security of both types of compositions.","PeriodicalId":205396,"journal":{"name":"2015 International Conference on Computer Science and Mechanical Automation (CSMA)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generic Constructions for Signcryption with Non-interactive Non-repudiation\",\"authors\":\"Jia Fan, Lijun Zhang\",\"doi\":\"10.1109/CSMA.2015.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Non-interactive non-repudiation is a very important property of signcryption which enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we construct the generic \\\"Sign-then-Encrypt\\\" and \\\"Encrypt-then-Sign\\\" compositions for signcryption with non-interactive non-repudiation by making use of a normal digital signature primitive as well as a primitive called public key encryption with non-interactive opening. We then analyze the security of both types of compositions.\",\"PeriodicalId\":205396,\"journal\":{\"name\":\"2015 International Conference on Computer Science and Mechanical Automation (CSMA)\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Computer Science and Mechanical Automation (CSMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSMA.2015.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Computer Science and Mechanical Automation (CSMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSMA.2015.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generic Constructions for Signcryption with Non-interactive Non-repudiation
Non-interactive non-repudiation is a very important property of signcryption which enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we construct the generic "Sign-then-Encrypt" and "Encrypt-then-Sign" compositions for signcryption with non-interactive non-repudiation by making use of a normal digital signature primitive as well as a primitive called public key encryption with non-interactive opening. We then analyze the security of both types of compositions.