通用可组合安全计算的信任模型研究

计算机应用 ›› 2012, Vol. 32 ›› Issue (05): 1371-1374.

通用可组合安全计算的信任模型研究

张妤¹,阴建强²,胡杰³

1. 信息工程大学电子技术学院，郑州 450004
2. 郑州电子信息中等专业学校电子信息系，郑州450100
3. 装甲兵工程学院院办公室，北京 100072

收稿日期:2011-11-07 修回日期:2011-12-26 发布日期:2012-05-01 出版日期:2012-05-01
通讯作者: 张妤
作者简介:张妤(1982-)，女，吉林长春人，博士研究生，主要研究方向：密码协议安全性证明；阴建强(1974-)，男，河南荥阳人，讲师，主要研究方向：嵌入式系统；胡杰(1982-)，男，天津蓟县人，工程师，主要研究方向：信息安全。
基金资助:
国家863计划项目（2008AA01Z404）

Research on trust model of universally composable security computation

ZHANG Yu¹,YIN Jian-qiang²,HU Jie³

1. Institute of Electronic Technology, Information Engineering University, Zhengzhou Henan 450004, China
2. Department of Electronic Information, Zhengzhou Electronic Information Specialized Secondary School, Zhengzhou Henan 450100, China
3. Academic Office, Academy of Armored Forces Engineering, Beijing 100072, China

Received:2011-11-07 Revised:2011-12-26 Online:2012-05-01 Published:2012-05-01
Contact: ZHANG Yu

摘要/Abstract

摘要： 通用可组合（UC）安全计算的存在性需要刻画某种基础假定的信任模型的支持。针对国内对于UC安全计算的信任模型研究甚少的现状，研究了UC安全性的本质要求及其对UC安全计算的限制，得出了使用这些信任模型的根本原因，进而分析了国外用来刻画这些基础假定的信任模型的设计原理，比较了它们的异同和优缺点，并展望了未来的研究方向。

关键词: 密码协议, 通用可组合, 安全计算, 基础假定, 信任模型

Abstract: A trust model capturing some set-up assumptions is necessary to guarantee the existence of Universally Composable (UC) security computation. Little domestic research on the trust model of UC security computation has been made. In this paper, the essential requirement of UC security and its limitation on UC security computation were researched to find out why these set-up assumptions were used. And then overseas representative trust models were analyzed and their merits and demerits were compared respectively. Finally, the research trend in future was pointed out.

Key words: cryptographic protocol, Universally Composable (UC), security computation, set-up assumption, trust model

中图分类号:

张妤阴建强胡杰. 通用可组合安全计算的信任模型研究[J]. 计算机应用, 2012, 32(05): 1371-1374.

ZHANG Yu YIN Jian-qiang HU Jie. Research on trust model of universally composable security computation[J]. Journal of Computer Applications, 2012, 32(05): 1371-1374.

参考文献

［1］CANETTI R. Universally composable security: A new paradigm for cryptographic protocols ［C］ // Proceedings of the 42nd Annual Symposium on Foundations of Computer Science. Washington, DC: IEEE Computer Society, 2001: 136-145.

［2］TROLIN M. A universally composable scheme for electronic cash ［C］ // Progress in Cryptology-INDOCRYPT 2005, LNCS 3797. Berlin: Springer, 2005: 347-360.

［3］KIAYIAS A, ZHOU H. Trading static for adaptive security in universally composable zero-knowledge ［C］ // Proceedings of the 34th International Colloquium on Automata, Languages and Programming, LNCS 4596. Berlin: Springer, 2007: 316-327.

［4］GREEN M, HOHENBERGER S. Universally composable adaptive oblivious transfer ［C］ // Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology. Berlin:Springer, 2008: 179-197.

［5］BURMESTER M, LE T V, MEDRIROS B D, et al.Universally composable RFID identification and authentication protocols ［J］. ACM Transactions on Information and System Security, 2009, 12(4): 1-33.

［6］GORANTLA M C, BOYD C, NIETO J M G. Universally composable contributory group key exchange ［C］ // Proceedings of ACM Conference on Computer and Communications Security. New York: ACM, 2009:146-156.

［7］雷飞宇.UC安全多方计算模型及其典型应用研究［D］.上海:上海交通大学,2007.

［8］洪璇.通用可组合数字签名模型及其关键问题研究［D］.上海:上海交通大学,2008.

［9］冯涛.通用可复合密码协议理论及其应用研究［D］.西安:西安电子科技大学,2008.

［10］张俊伟.密码协议的可组合安全［D］.西安:西安电子科技大学,2010.

［11］郭渊博. UC安全的空间网络双向认证与密钥协商协议［J］.电子学报,2010,38(10):2358-2364.

［12］贾洪勇,卿斯汉,谷利泽,等.通用可组合的组密钥交换协议［J］.电子与信息学报,2009,31(7):1571-1575.

［13］CHAUM D, CREPEAU C, DAMGARD I. Multi-party unconditionally secure protocols ［C］ // Proceedings of the 20th Annual ACM Symposium on Theory of Computing. New York: ACM, 1988: 11-19.

［14］CANETTI R, KUSHILEVITZ E, LINDELL Y. On the limitations of universally composable two-party computation without set-up assumptions ［C］ // Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2003: 68-86.

［15］CANETTI R, LINDELL Y, OSTROVSKY R, et al. Universally composable two-party and multi-party computation ［C］ // Proceedings of the 34th Annual ACM Symposium on Theory of Computing. New York: ACM, 2002: 494-503.

［16］BARAK B, CANETTI R, NIELSEN J B, et al. Universally composable protocols with relaxed set-up assumptions ［C］ // Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. Washington， DC: IEEE Computer Society, 2004: 186-195.

［17］KATZ J. Universally composable multi-party computation using tamper-proof hardware ［C］ // Proceedings of the 26th Annual International Conference on the Theory and Application of Cryptology Techniques. Berlin: Springer, 2007:115-128.

［18］CANETTI R. Obtaining universally composable security: towards the bare bones of trust ［C］ // Proceedings of the 13th International Conference on the Theory and Application of Cryptology and Information Security. Berlin: Springer, 2007: 88-112.

[1]	朱玉娜, 张玉涛, 闫少阁, 范钰丹, 陈韩托. 基于半监督子空间聚类的协议识别方法[J]. 计算机应用, 2021, 41(10): 2900-2904.
[2]	谢洪安, 李栋, 苏旸, 杨凯. 基于聚类分析的可信网络管理模型[J]. 计算机应用, 2016, 36(9): 2447-2451.
[3]	陈振国, 田立勤. 信任模型在雾霾感知源评价中的应用[J]. 计算机应用, 2016, 36(2): 472-477.
[4]	刘大福, 苏旸, 谢洪安, 杨凯. 电子商务中客户评价策略选择的演化博弈分析[J]. 计算机应用, 2016, 36(12): 3269-3273.
[5]	阮闪闪, 王小平, 薛小平. 基于证据理论信任模型的众包质量监控[J]. 计算机应用, 2015, 35(8): 2380-2385.
[6]	陈迪, 周鸣争. 基于灰色理论的无线传感器网络信任模型[J]. 计算机应用, 2015, 35(6): 1693-1697.
[7]	徐军, 钟元生. 基于消费者风险态度的主观信任模型[J]. 计算机应用, 2015, 35(11): 3166-3171.
[8]	李璐瑶戴明王青龙. 可证明安全k-out-of-n不经意传输方案的安全分析与改进[J]. 计算机应用, 2014, 34(5): 1296-1299.
[9]	曹晓梅沈何阳朱海涛. 基于模糊预测的无线传感器网络信任模型[J]. 计算机应用, 2014, 34(3): 700-703.
[10]	邓攀钟将. 基于推荐的抗攻击电子商务信任模型[J]. 计算机应用, 2013, 33(12): 3490-3493.
[11]	饶屾王勇. 基于P2P网络的动态模糊综合信任模型[J]. 计算机应用, 2011, 31(01): 139-142.
[12]	王泽成. 基于身份数字签名方案的通用可组合安全性[J]. 计算机应用, 2011, 31(01): 118-122.
[13]	周彦伟吴振强. TA-ONS——新型的物联网查询机制[J]. 计算机应用, 2010, 30(8): 2202-2206.
[14]	黄开枝贺晓珺张鹏罗兴国. 异构无线网络中基于模糊集合的动态信任模型[J]. 计算机应用, 2010, 30(8): 2111-2113.
[15]	周毅郑雪峰于义科. 基于进化理论的层信任模型研究与实现[J]. 计算机应用, 2010, 30(8): 2114-2119.