Abstract
Automated Trust Negotiation(ATN) has been proposed as a mechanism to establish mutual trust among strangers. Protocols and strategies to be used during ATN have also been studied. When considering the real world usage of ATN, there are many factors to be considered. One of the factors that has not been addressed by previous studies is the memory complexity of negotiation strategies. This paper analyses the memory complexities of previously proposed negotiation strategies and evaluates the average memory consumption through simulations using an ATN framework for web services. The experimental results revealed that memory complexity of Parsimonious strategy grows exponentially as the number of credentials increases, which is consistent with the theoretical analysis. As a solution, a method to reduce the memory consumption by exploiting the knowledge each entity has about the negotiation is presented. In addition, the paper presents a new criterion that enables the truncation of the negotiation to reduce the memory consumption in situations where the negotiation fails. Experiment results, which show the effectiveness of above methods in reducing the memory consumption, negotiation length are also presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Winsborough, W.H., Seamons, K.E., Jones, V.E.: Automated trust negotiation. In: DARPA Information Survivability Conference and Exposition, vol. I, pp. 88–102. IEEE Press, Los Alamitos (2000)
Winsborough, W.H., Jones, V.E.: Negotiating disclosure of sensitive credentials (1999)
Yu, T., Winslett, M., Seamons, K.E.: Supporting structured credentials and sensitive policies through interoperable strategies for automated trust negotiation. ACM Transactions on Information and System Security 6, 1–42 (2003)
Winsborough, W.H., Li, N.: Towards practical automated trust negotiation. In: Proceedings of the Third International Workshop on Policies for Distributed Systems and Networks, pp. 92–103. IEEE Computer Society, Los Alamitos (2002)
Winslett, M., Yu, T., Seamons, K., Hess, A., Jacobson, J., Jarvis, R., Smith, B., Yu, L.: Negotiating trust in the web. IEEE Internet Computing 6(6), 30–37 (2002)
Yu, T., Ma, X., Winslett, M.: Prunes: An efficient and complete strategy for automated trust negotiation over the internet (2000)
Yu, T.: Interoperable strategies in automated trust negotiation. In: Proceedings of the 8th ACM conference on Computer and Communications Security, pp. 146–155. ACM Press, New York (2001)
Baselice, S., Bonatti, P.A., Faella, M.: On interoperable trust negotiation strategies. In: Eighth International Workshop on Policies for Distributed Systems and Networks, pp. 39–50. IEEE Computer Society Press, Los Alamitos (2007)
Yamaki, H., Fujii, M., Nakatsuka, K., Ishida, T.: A dynamic programming approach to automated trust negotiation for multiagent systems. In: Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems, pp. 55–66 (2005)
Yamaki, H., Furuta, T., Katugampala, I.: Platforms for evaluating automated trust negotiation protocols and strategies (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katugampala, I.H., Yamaki, H., Yamaguchi, Y. (2009). Memory Complexity of Automated Trust Negotiation Strategies. In: Yang, JJ., Yokoo, M., Ito, T., Jin, Z., Scerri, P. (eds) Principles of Practice in Multi-Agent Systems. PRIMA 2009. Lecture Notes in Computer Science(), vol 5925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11161-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-11161-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11160-0
Online ISBN: 978-3-642-11161-7
eBook Packages: Computer ScienceComputer Science (R0)