首先概述了现有两种主要的信任模型以及其存在的问题，然后结合不确定概率理论和普适计算的特点，提出了普适环境下一种新的信任模型——基于属性凭证的信任模型。最后给出了它在实际中的应用。
124 计算机应用研究 2006年 根据客户的信任等级和位置信息,为不同地区不同等级的客户[9] R Campbel,JA- Muhtadi, P Naldurg et a. Towards Security and 提供个性化的服务。 Privacy for pervasive Computing C]. Japan: Tokyo, Proc. of Inter national Symposi um on Software Security 2002. 8-10 4结束语 [10] Robinson, Beg. Tnust Context Spaces: An Infrastructure for Perve- sive Security in Context-Aware Environments[ C]. Germany: Bop- 近来,普适计算成为矿究的热点。而安全对普适计算的研 pard, Proc. of the 1st Intemational Conference on Security in Perva- 究乂具有重要的意义。本文在现有两个主要信任模型的某础 sive Computing, 2003. 23-24. 上,针对它们所存在的问题以及普适计算的特点,结合不确定111 an-Marc seigneur, tephen Farrell e a, nd-to-End I nust in per vasive Computing starts with Recognition[ C]. Germany Bppard, 概率理论,提出了基于属性凭证的信模型。该模型适用于访 Proc. of the ls internaional Canference on Secunity in Pervasi ve 问控制、定位服务和电∫商务等领域中。在以后的工作中,我 Computing, 2003. 17-18 们将深入研究信任模型中属性凭让的属性构成,进一步完蓉模[12] Laland Kagal, Tim Finin, Anupam Joshi. Trust-based Security in 型,使其更广泛地应用」普适计算环境中。 Pervasive Camputing Environments[ J]. IEEE Computer 2001, 34 参考文献 (12):154-157 [13] S Mendes, C Huitema. A New A pproach to the X 509 Framework [1] Saha, A Mukherjee. Pervasive Computing: A Paradigm for the 21st Century[ J]. Computer, 2003, 36(3): 25-31 Allowing Globa Authentication without a Global Trust Model[ C] USA: Washington, DC, Proc. of SDSS, 1995. 36-38 [2] D Tennenhouse. Proactive computing[ J]. Communications of the ACM,2000,43(5):43-50 14] A Abdul-R ahman. The PGP Trust Mode[ c]. CA: Long Beach the Joumal of electronic Commerce 1997.27-31 [3] GD Abowd E d mynatt. Charting Past, Present, and Future Re- search in Ubiqui tous Computing[ J]. ACM Transactions n Computer [15ExplanainoftheWebofTrustofPgplEb/oL].http://www.ru bin. ch/pgp/webo trust. en html, 2004-12-28 Human Inberadi n, 2000,7(1):29-5 [4 F stajano. Security for Ubiqui taus Computing M]. New York Hal- [ 16] Joe Valacich. Ubiquitous Trust: Evdvng Trust into Ubiqu tous Comr puting Envirnments[ C]. USA: Clevelar sted press, 2002. 56-96 and, Workshop on Ubiquitous [5] Anthony D Joseph. Security Privacy, and Heath[ J]. IEEE Perva- Computing Environments, 2003. 22-25. [17 M Carbone, M Nielsen, V Sassone. A Calcul us far Trust Managemer sive Computing, 2003, 2(1): 96-97 [6] M Weiser. Ubiquitous Computing[ J]. IEEE Computer, 1993, 26 [C]. Chenna India: Pra. of FSTTCS 2004. [18] A JOsang. A Logc for Uncertain Probabilities[ J]. Fuzziness and (1):71-72 Knowl edge-based Systems, 2001, 9(3): 12-30 [7] M Satyanarayanan. Pervasi ve Computing: Vision and Challenges[ ]] IEEE Personal Communications, 2001,8(8): 10-17 作者简介: [8] M Carnet, E Hara, C Mattos, FreeIcP,ORG; Free Trusted certifi-王益涵(1981-),男;上海市人,硕士生,主要研究方向为普适计算、网 cates by Combining the x.509 and PGP Hierarchy Through a Collabo--络安全、嵌入式系统;陶莉(1982-),女,江苏靖江人,硕士生,主要研究 naive trust scoring Systen[C]. Gai thersburg,∪sA:2 nd annual方向为普适计算中的安全性、嵌入式系统开发;曹奇英(1960-),男,教 PKI Research Workshop Proceedings, 2003. 13-29 授,博士生导师,博士后,主要研究方向为普适计算、嵌入式系统开发。 上接第121页) 1990.27-35 [5 A Menezes, P van Oarscho, Svan Svanstone. Handbook of Applied Cl 3总结 tography M]. London CRC Press, 1996.[6 M Naor, A shamir. Visual Cryptography C]. Advances in Cryptology-Eurocrypt 94 不文提出了一种新的彩色可视秘共享方案,它的主要思 LNCs950,1995.1-12 想是基于线性方程组求解。在新方案中,任意k个或多于k个[列 C Lin, W Tsai. al Cryptography for Gray-level Images by Dithe- 用户联合起来能够恢复秘密图像,而少于k个却不能。另外, ring Techniques[ J]. Pattern Recognition, 2003, 24: 349-358 共亨图像与秘密图像大小相同,而恢复图像与原始图像完全 [8 Thien, J Lin. Secret Image Sharing ]]. Computers and graphics 2002,26:765-770. 一样,没有任何失真因此该方案是一种理想、完备的(km)[9] ER Verheul,HCA 刁限方案,适用于把黑白、灰度、彩色图像作为秘密进行共芓 Out of n Visua Secret Sharing schemes J. Des. Codes Cryptogr 有着良好的应用前景。 1997,11:1为9-196. 参考文献 [10] CC Chang, C S Tsai, T S Chen. A Techni que for sharing a Secret Color Imagel C]. Proc. 9th National Conf. on Informati on Security [1 R Blakley. Safeguarding Cryptographic Keys[ C]. Proc. of the taichung,1999.63-72 1979 AFIPS National Computer Conference, AF IPS Press, 1979 [11]Y Ha. Visual Cryptography for Color Images[ J]. Pattern Recogni 313-317. ton;2003,36:1619-1629 [2] A Shamir. How to Share a Secret Commun[ ]]. The ACM, 1979, 22: 12]V Rijmen, B Preneel. Efficient Colour Visua Encryption or'Shared 612-613. colours of Benetton[ C]. Rump Session of Euracrypt,1996 [3] M Ito, A Saito, T Nishizaki. Secret Sharing Scheme Realizing Gene- [13] G Alvarez Maranon, L Hemandez Encinas, A Martin del rey. Sha- ral Access Structure[ C]. Proc. of ieee Global Te ecommunication ring Secret Color Images Using Celular Automata with Memory[ EB/ Conf. Globecom 87, 1987. 99-102 Ol].http://arxiv.org/pdf/cs.Cr/0312034,2003 [4] JC Benaiah,] Leichter. Generalized Secret sharing and Monotone作者简介 F undine C]. Advances in Cryptolagy-CRY PTO88,LNCS403,石润华(1974-),男,安徽安庆人,讲师,硕士,研究方向为网络安全