A Proposed Architecture For Mobile Government Transactions

Abstract: As testified by the established penetration of mobile devices world-wide, as well as the emergent enrichment of both informational and transactional mobile service content via protocols such as i-mode, mobile services may constitute the next technological leap in the advancement of electronic service delivery. The integration of mobile technology with electronic government services, in particular, presents substantial promise to bring the “anywhere-anytime-anybody ” egovernment service vision one step closer. This paper presents an architecture that integrates workflow-based one-stop government service delivery with secure mobile transactions, offering support not only to “passive ” informational services, but also to transactional services realized through mobile triggering of e-government service workflows. Such an integration further enhances the established benefits of electronic government service delivery whereas it additionally creates a co-operative “win-win ” situation for service end-users, administrative employees, egovernment service providers and mobile operators alike. Keywords: Mobile government, system architecture, G2C, G2E, G2G. 1

Trust Management Issues for Ad Hoc and Selforganized Networks

Abstract. Self-organized and ad hoc communications have many fundamental principles in common and also face similar problems in the domains of security and Quality of Service. Trust management, although still in its first steps, seems capable of dealing with such problems. In this paper we present an integrated trust management framework for self-organized networks. In addition, starting from our experience with the presented framework, we indicate and discuss important research challenges (among them interoperability and integration issues) for the future evolution of the trust-based autonomic computing paradigm. We argue that ontologies can address many of these issues through the semantics they convey

Analysis of the effect of InfoRanking on content pollution in peer-to-peer systems

Content pollution is one of the most common attacks against peer-to-peer file-sharing systems. As such, systems are usually open to users, and the deployed security mechanisms merely examine the sanity of the downloaded files—content pollution attacks can be easily launched. InfoRanking is a mechanism that tries to mitigate this security risk by ranking content items. In this paper, we show through analysis, fluid modeling, and simulation that when InfoRanking is used, attackers can deceive users only when they share corrupted copies of legitimate file versions. Nevertheless, as corrupted files can be immediately detected after being downloaded, this attack is only effective when users enter the system at very low rate and leave relatively fast