On oblivious transfer capacity
Information Theory, Combinatorics, and Search Theory（2013）
摘要
Upper and lower bounds to the oblivious transfer (OT) capacity of discrete memoryless channels and multiple sources are obtained, for 1 of 2 strings OT with honest but curious participants. The upper bounds hold also for one-string OT. The results provide the exact value of OT capacity for a specified class of models, and the necessary and sufficient condition of its positivity, in general.
更多查看译文
关键词
oblivious transfer,discrete memoryless channel,ot capacity,oblivious transfer capacity,one-string ot,curious participant,specified class,lower bound,multiple source,exact value,upper bound,protocols,mutual information,yttrium,cryptography,cryptographic protocols,random variables
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要