{"title":"基于椭圆曲线的通信高效无关传输","authors":"Abhishek Parakh","doi":"10.1109/HASE.2012.14","DOIUrl":null,"url":null,"abstract":"This paper presents communication efficient protocols for oblivious transfer (OT) using elliptic curve cryptography (ECC). ECC provides better security than RSA for the same key length and is known to have faster implementations. We provide protocols for 1-out-of-2 and 1-out-of-n oblivious transfer in which the latter requires the sender to send only n+2 elements over the network and the receiver sends only one messages over the network.","PeriodicalId":214862,"journal":{"name":"2012 IEEE 14th International Symposium on High-Assurance Systems Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Communication Efficient Oblivious Transfer Using Elliptic Curves\",\"authors\":\"Abhishek Parakh\",\"doi\":\"10.1109/HASE.2012.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents communication efficient protocols for oblivious transfer (OT) using elliptic curve cryptography (ECC). ECC provides better security than RSA for the same key length and is known to have faster implementations. We provide protocols for 1-out-of-2 and 1-out-of-n oblivious transfer in which the latter requires the sender to send only n+2 elements over the network and the receiver sends only one messages over the network.\",\"PeriodicalId\":214862,\"journal\":{\"name\":\"2012 IEEE 14th International Symposium on High-Assurance Systems Engineering\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 14th International Symposium on High-Assurance Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HASE.2012.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 14th International Symposium on High-Assurance Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HASE.2012.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Communication Efficient Oblivious Transfer Using Elliptic Curves
This paper presents communication efficient protocols for oblivious transfer (OT) using elliptic curve cryptography (ECC). ECC provides better security than RSA for the same key length and is known to have faster implementations. We provide protocols for 1-out-of-2 and 1-out-of-n oblivious transfer in which the latter requires the sender to send only n+2 elements over the network and the receiver sends only one messages over the network.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
