独立的不经意传输(英文)  

Independent Oblivious Transfer

作　　者：黄琼[1] 赵一鸣[1] 

机构地区：[1]复旦大学计算机科学与工程系,上海200433

出　　处：《软件学报》2007年第4期1015-1025,共11页Journal of Software

基　　金：SupportedbytheNationalNaturalScienceFoundationofChinaunderGrantNo.60573054(国家自然科学基金)

摘　　要：针对DeSantis给出的开放问题,提出了公开密钥公开随机性模型下的独立的不经意传输(简称PKPRIOT).首先,给出了IOT的一个非交互式实现,它能够独立地不经意传输多项式条消息.该实现是基于二次剩余假设.由于它受限于多项式次,所以又给出了IOT的另一个非交互式实现,它能够独立地传输任意次消息.但是这个实现要求发送者是诚实的,并且接收者不能独立地选择接收哪条消息.因此给出了第三个交互式的实现.它基于Rivest的BBCS不经意传输,并且比上面两个非交互式实现的效率高得多.这3种实现对于具有无限计算能力的接收者都是安全的.This paper presents a flavor of OT named Independent Oblivious Transfer in the Public-Key Public-Randomness Model （PKPR IOT, in short）, with respect to the open problem given by De Santis. First it gives a non-interactive implementation of IOT, which can independently and obliviously transfer polynomial messages. The implementation is based on Quadratic Residuosity Assumption. Since it is limited to pre-fixed times, then another non-interactive implementation of IOT is presented, which can independently transfer messages for any times. The second implementation requires the sender to be honest and the receiver couldn＇t make his choice independently. So, the third interactive implementation is given. It is based on the BBCS oblivious transfer scheme of Rivest, and is rather more efficient than the above two non-interactive counterparts. All the three implementations presented are secure against receivers with unlimited computational power.

关 键 词：不经意传输 零知识证明 二次剩余假设 公开密钥公开随机性模型 GM加密 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]