Volume 33 Issue 12
Dec.  2007
Turn off MathJax
Article Contents
Jiang Zhengtao, Huai Jinpeng, Wang Yuminet al. Disclosing method for protecting sensitive certificate[J]. Journal of Beijing University of Aeronautics and Astronautics, 2007, 33(12): 1477-1480. (in Chinese)
Citation: Jiang Zhengtao, Huai Jinpeng, Wang Yuminet al. Disclosing method for protecting sensitive certificate[J]. Journal of Beijing University of Aeronautics and Astronautics, 2007, 33(12): 1477-1480. (in Chinese)

Disclosing method for protecting sensitive certificate

  • Received Date: 26 Dec 2006
  • Publish Date: 31 Dec 2007
  • Further investigations on the problem of disclosing sensitive attribute certificate were provided. To enhance its security assurance, cryptographic mechanisms were utilized and a certificate disclosure scheme based on which was proposed, which realized the following characteristics: At last resource demander submits part of all of her attribute certificates to the resource provider; Resource provider can receive that part of attribute certificates and he cannot get any information of the rest; Resource demander cannot get any information on which attribute certificates does the provider really get or interest; With this scheme and according to their realized agreements, they can arrange a set of different bounds for the different attribute. For any attribute, the condition that the attribute certificate can be obtained or validated only when the number of the provider participant (or limit) exceed or equal to the corresponding bound, which can protect part of right and privacy of both sides.

     

  • loading
  • [1] Metcalfe B. The next-generation Internet[J]. IEEE Internet Computing, 2000, 4(1): 58-59 [2] Baroody R, Rashid A, Al-Holou N, et al. Next generation vehicle network (NGVN): Internet access utilizing dynamic discovery protocols Proceedings—The IEEE/ACS International Conference on Pervasive Services, ICPS 2004. Beirut: IEEE, 2004:81-88 [3] Oppliger R. Internet security enters the middle ages[J]. Computer, 1995, 28(10): 100-101 [4] Zhu Y, Han J, Liu Y, et al. TruGrid: A self-sustaining trustworthy grid Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops. Beirut: IEEE, 2005: 815-821 [5] Teacy W T L, Patel J, Jennings N R, et al. TRAVOS: Trust and reputation in the context of inaccurate information sources[J]. Autonomous Agents and Multi-Agent Systems, 2006, 12(2): 183-198 [6] Winslett M, Yu T, Seamons K E, et al. Negotiating trust on the web[J]. IEEE Internet Computing, 2002, 6(6):30-37 [7] Yu T, Winslett M, Seamons K E. Supporting structured credentials and sensitive policies through interoperable strategies for automated trust negotiation[J]. ACM Transactions on Information and System Security, 2003, 1(6):1-42 [8] Blaze M, Feigenbaum J, Lacy J. Decentralized trust management Dale J, Dinoh G.Internet Computing. Washington: IEEE Computer Society Press, 1996:164-173 [9] Damiani E, Vimercati S, paraboschi S, et al. A reputation-based approach for choosing reliable resources in peer-to-peer networks Atluri V. Computer and Communications Security. Washington: ACM Press, 2002: 207-216 [10] Dellarocas C. Sanctioning reputation mechanisms in online trading environment with pure moral hazard[J]. Information Systems Research, 2005, 16(2), 209-230 [11] Huai J P, Zhang Y, Li X X, et al. Distributed access control in CROWN groups Feng W C. Parallel Processing. Washington: IEEE Computer Society, 2005: 435-442 [12] Li N, Du W, Boneh D. Oblivious signature based envelope Manku G S. ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 2003:182-189
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(2757) PDF downloads(956) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return