高效的t-of-n无关传输方案

2008 International Conference on Security Technology Pub Date : 2008-12-13 DOI:10.1109/SECTECH.2008.19

Chinchen Chang, Y. Lai

{"title":"高效的t-of-n无关传输方案","authors":"Chinchen Chang, Y. Lai","doi":"10.1109/SECTECH.2008.19","DOIUrl":null,"url":null,"abstract":"In this paper, we shall bring up two efficient t-out-of-n oblivious transfer schemes. The first comes out handy for communication and computation. However, it has a shortcoming in revealing combined information of secrets. To solve this problem, we have developed it into the second scheme.","PeriodicalId":377461,"journal":{"name":"2008 International Conference on Security Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Efficient t-out-of-n Oblivious Transfer Schemes\",\"authors\":\"Chinchen Chang, Y. Lai\",\"doi\":\"10.1109/SECTECH.2008.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we shall bring up two efficient t-out-of-n oblivious transfer schemes. The first comes out handy for communication and computation. However, it has a shortcoming in revealing combined information of secrets. To solve this problem, we have developed it into the second scheme.\",\"PeriodicalId\":377461,\"journal\":{\"name\":\"2008 International Conference on Security Technology\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Security Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECTECH.2008.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Security Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECTECH.2008.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

在本文中，我们将提出两种有效的t / n无关转移方案。第一个用于通信和计算。然而，它在揭示秘密的组合信息方面存在不足。为了解决这个问题，我们把它发展成第二个方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Efficient t-out-of-n Oblivious Transfer Schemes

In this paper, we shall bring up two efficient t-out-of-n oblivious transfer schemes. The first comes out handy for communication and computation. However, it has a shortcoming in revealing combined information of secrets. To solve this problem, we have developed it into the second scheme.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 International Conference on Security Technology

自引率

0.00%

发文量