{"title":"Realistic Threats to Self-Enforcing Privacy","authors":"G. Bella, F. Librizzi, S. Riccobene","doi":"10.1109/IAS.2008.23","DOIUrl":"https://doi.org/10.1109/IAS.2008.23","url":null,"abstract":"A recent privacy protocol for secure e-polls aims at ensuring the submitting individuals that the pollster will preserve the privacy of their submitted preferences. Otherwise the individuals can indict the pollster, provided that the pollster participates actively in this phase. The analysis of the protocol in a realistic threat model denounces that a malicious pollster that abuses the private preferences by disclosure will arguably not help out during its own indictment. Therefore, the protocol ensures insufficient fairness among their participants because it gives the pollster some advantage over the individuals. Two variant protocols are introduced and analysed in the same threat model - one is found to move the advantage over the individuals, the other is found to achieve a satisfactory level of fairness.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116836462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"COTraSE: Connection Oriented Traceback in Switched Ethernet","authors":"M. Andreou, A. Moorsel","doi":"10.1109/IAS.2008.25","DOIUrl":"https://doi.org/10.1109/IAS.2008.25","url":null,"abstract":"Layer 2 traceback is an important component of end-to-end packet traceback. Whilst IP traceback identifies the origin network, L2 traceback extends the process to provide a more fine-grained result. Other known proposals have exposed the difficulties of L2 traceback in switched Ethernet. We build on our earlier work and improve in a number of dimensions. Memory requirements are decreased by maintaining 'connection records' rather than logging all frames. Our switchport resolution algorithm provides error detection by correlating MAC address table values from two adjacent switches. Our solution also takes stock of potential transformations to packet data as this leaves the local network. We have implemented the core algorithm and used data from available WAN traces to demonstrate the potential memory efficiency of our approach.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132460095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure Hybrid Group Key Management for Hierarchical Self-Organizing Sensor Network","authors":"S. Lim, Meng-Hui Lim, Sanggon Lee, Hoonjae Lee","doi":"10.1109/IAS.2008.16","DOIUrl":"https://doi.org/10.1109/IAS.2008.16","url":null,"abstract":"Key management is deemed as the fundamental essential part of any secure communication. A secure sensor network communication protocol relies on the substantial secure, robust and efficient key management system. We put forward a new hybrid group key management scheme for hierarchical self organizing wireless sensor network architecture. By using this approach, multi-level security can be achieved to secure groups of sensors at different levels. We place the cryptographic burden where the resources are less constrained, at the forwarding nodes and the access points. In our proposed scheme, access points and forwarding nodes initially perform a key agreement protocol and each sensor node in a cluster later on establishes a group key with the forwarding node using a key transport scheme dynamically after deployment.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134403368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Matrix Factorization Approach for Feature Deduction and Design of Intrusion Detection Systems","authors":"V. Snás̃el, J. Platoš, P. Krömer, A. Abraham","doi":"10.1109/IAS.2008.53","DOIUrl":"https://doi.org/10.1109/IAS.2008.53","url":null,"abstract":"Current Intrusion Detection Systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything) to the detection process. The purpose of this research is to identify important input features in building an IDS that is computationally efficient and effective. This paper propose a novel matrix factorization approach for feature deduction and design of intrusion detection systems. Experiment results indicate that the proposed method is efficient.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132375581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Chaotic Quantum Cryptography","authors":"S. Kartalopoulos","doi":"10.1109/IAS.2008.32","DOIUrl":"https://doi.org/10.1109/IAS.2008.32","url":null,"abstract":"Quantum cryptographic systems use quantum mechanical concepts that are based on qubit superposition of states, and on the no cloning or no copying theorem to establish unbreakable cipher keys. Using optical communications the most commonly quantum mechanical property used is the polarization state of photon. However, in most quantum cryptographic algorithms a random polarization state is required. In this case, the random number generator should not be publically known, and it should be preferably reproducible. A naturally reproducible RNG can be produced using chaos functions. In this paper we review a quantum key distribution algorithm and chaos functions as RNGs. We then describe how chaos functions can be used in quantum key establishment and also a method that requires substantially fewer bits in the stream to establish the key and also a faster method.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127465107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Efficient Approach to Minimum-Cost Network Hardening Using Attack Graphs","authors":"Feng Chen, Lingyu Wang, Jinshu Su","doi":"10.1109/IAS.2008.38","DOIUrl":"https://doi.org/10.1109/IAS.2008.38","url":null,"abstract":"Attack graphs can reveal the threat of sophisticated multi-step attacks by enumerating possible sequences of exploits leading to the compromise of given critical resources. Finding a solution to remove such threats by hands is tedious and error prone, particularly for larger and poorly secured networks. Existing automated approaches for hardening a network has an exponential complexity and is not scalable to large networks. This paper proposes a novel approach of applying the Reduced Ordered Binary Decision Diagram (ROBDD) method to network hardening. Existing mature optimization techniques in ROBDD makes the proposed approach an efficient solution that can potentially be applied to large networks.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128701079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integrating Delegation with the Formal Core RBAC Model","authors":"A. Abdallah, Hassan Takabi","doi":"10.1109/IAS.2008.66","DOIUrl":"https://doi.org/10.1109/IAS.2008.66","url":null,"abstract":"Role-based access control (RBAC) models are a powerful tool for describing and managing authorization, particularly, in large organizations. The benefits of using formal methods to describe RBAC models in a clear, consistent and rigorous manner have been recognized. Notable exemplars, that have been formulated in the formal specification notation Z, include NIST's reference RBAC model and the minimalist Core RBAC model. These models, however, do not support delegation, an important authorization feature which is often deployed in real access control systems. In RBAC, delegation empowers a user in a certain role to authorize another user to perform the tasks permissible to that role. This paper aims at integrating a version of role delegation, known as grant independent delegation, with the Core RBAC model. The paper introduces a state based model in which grant independent delegation and revocation operations are formally specified in Z. Integration with the Core RBAC model is achieved by simply combining the two models using the standard Z schema conjunction operator.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121821022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic Substitution Model","authors":"M. El-Fotouh, K. Diepold","doi":"10.1109/IAS.2008.20","DOIUrl":"https://doi.org/10.1109/IAS.2008.20","url":null,"abstract":"In this paper, we present the Dynamic Substitution Model (DSM) and its variant the Static Substitution Model (SSM). In DSM and SSM, the secret encryption key is divided into a primary key and a secondary key. DSM is a model that allows any block cipher to accept a variable length secondary key, this is achieved by substituting some bits of the cipher's expanded key with the secondary key. SSM is a variant of DSM, where the secondary key length and the positions of the replaced bits of the subkeys are determined in the design time. We used the Advanced Encryption Standard (AES) to demonstrate the usage of DSM and SSM models.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125140040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Secure Binding Management Protocol for Mobile IPv6 Networks","authors":"Osama A. Elshakankiry, A. Carpenter, Ning Zhang","doi":"10.1109/IAS.2008.41","DOIUrl":"https://doi.org/10.1109/IAS.2008.41","url":null,"abstract":"This paper proposes a novel secure binding management protocol for mobile IPv6 networks for use in the implementation of routing optimization. The idea uses the public key of the home network of a mobile node to cryptographically generate the mobile node's home address and the associated private key to sign the mobile node's authentication requests. In addition, the proposed protocol performs reachability tests for both the home address and the care-of address. The proposed protocol offloads all expensive cryptographic operations from a mobile node to its home agent. The security of the protocol is informally analysed and an initially evaluation of its performance given.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113980682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Formal Comparison of the Bell & LaPadula and RBAC Models","authors":"L. Habib, M. Jaume, C. Morisset","doi":"10.1109/IAS.2008.18","DOIUrl":"https://doi.org/10.1109/IAS.2008.18","url":null,"abstract":"In this paper we address the problem of comparing access control models. Indeed, many access control models can be found in the literature and in order to choose one model for a particular context, some tools helping such a choice are needed. We develop here a complete example allowing to compare (in a formal way) the Bell and LaPadula (BLP) model and the role-based (RBAC) model. In order to achieve this goal, we first express these models in a uniform way, then we introduce concepts (mostly based on simulations) allowing to compare access control models.","PeriodicalId":103328,"journal":{"name":"2008 The Fourth International Conference on Information Assurance and Security","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122623888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}