Statistical security conditions for two-party secure function evaluation

被引:0
作者
Crepeau, Claude [1 ]
Wullschleger, Juerg [2 ]
机构
[1] McGill Univ, Montreal, PQ, Canada
[2] Univ Bristol, Bristol, RI USA
来源
INFORMATION THEORETIC SECURITY, PROCEEDINGS | 2008年 / 5155卷
关键词
secure function evaluation; information-theoretic security; security definition; oblivious transfer;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
To simplify proofs in information-theoretic security, the standard security definition of two-party secure function evaluation based on the real/ideal model paradigm is often replaced by an information-theoretic security definition. At EUROCRYPT 2006, we showed that most of these definitions had some weaknesses, and presented new information-theoretic conditions that were equivalent to a simulation-based definition in the real/ideal model. However, there we only considered the perfect case, where the protocol is not allowed to make any error, which has only limited applications. We generalize these results to the statistical case, where the protocol is allowed to make errors with a small probability. Our results are based on a new measure of information that we call the statistical information, which may be of independent interest.
引用
收藏
页码:86 / +
页数:4
相关论文
共 26 条
[1]  
BACKES M, 2003, UNIVERSALLY COMPOSAB
[2]  
BEAVER D, 1992, LECT NOTES COMPUT SC, V576, P377
[3]  
Ben-Or Michael, 1988, P 20 ANN ACM S THEOR, P1, DOI DOI 10.1145/62212.62213
[4]   Universally composable security: A new paradigm for cryptographic protocols [J].
Canetti, R .
42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, :136-145
[5]   Security and composition of multiparty cryptographic protocols [J].
Canetti, R .
JOURNAL OF CRYPTOLOGY, 2000, 13 (01) :143-202
[6]  
Chaum D., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P11, DOI 10.1145/62212.62214
[7]  
Cover TM, 2006, Elements of Information Theory
[8]  
Crepeau C, 1995, LECT NOTES COMPUT SC, V963, P110
[9]  
CREPEAU C, 1990, LNCS, V434, P181
[10]  
Crépeau C, 2006, LECT NOTES COMPUT SC, V4004, P538