Digital signature is a foundational cryptographic primitive in modern information systems. Identity-based signatures are advantageous over signatures in the conventional public key infrastructure setting. Observing that most information systems are implemented in a multi-user setting in which some users might be corrupted, this paper proposes a new identity-based signature scheme. The new scheme is proven to be existentially unforgeable against chosen-principle and chosen-message (CP-CM) attackers who are the strongest attackers so far defined for identity-based signatures. The security of our scheme relies on the standard computational Diffie-Hellman (CDH) assumption. The proof is given in the random oracle model where a hash function modeled as random oracle. Analysis shows that our scheme is also more efficient than the state of the art in terms of computation and communication. This implies that our proposal is practical to realize efficient and secure authentication in multi-user settings.
{"title":"An Efficient Probably CP-CM-Secure Identity-Based Signature Scheme Applicable to Authentication in Multiuser Settings","authors":"Xi Sun, Zhengtao Jiang, Meirong Zhou, Yumin Wang","doi":"10.1109/iNCoS.2012.87","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.87","url":null,"abstract":"Digital signature is a foundational cryptographic primitive in modern information systems. Identity-based signatures are advantageous over signatures in the conventional public key infrastructure setting. Observing that most information systems are implemented in a multi-user setting in which some users might be corrupted, this paper proposes a new identity-based signature scheme. The new scheme is proven to be existentially unforgeable against chosen-principle and chosen-message (CP-CM) attackers who are the strongest attackers so far defined for identity-based signatures. The security of our scheme relies on the standard computational Diffie-Hellman (CDH) assumption. The proof is given in the random oracle model where a hash function modeled as random oracle. Analysis shows that our scheme is also more efficient than the state of the art in terms of computation and communication. This implies that our proposal is practical to realize efficient and secure authentication in multi-user settings.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115141656","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}
Vehicular networks are gaining popularity because vehicular communications are able to help minimize accidents, improve traffic conditions, etc. To avoid malicious attacks and potential abuse, employing digital signatures is widely recognized as the most efficient approach for vehicular networks. However, when the number of signatures received by a roadside unit (RSU) becomes large, a scalability problem emerges immediately: it can be difficult for the RSU to sequentially verify every received signature within 100-300ms as required by the current Dedicated Short Range Communications (DSRC) broadcast protocol. Jiang et al. proposed a robust and efficient signature scheme for vehicular-to-infrastructure communications, called binary authentication tree. In this paper, we show that their binary authentication algorithm is insecure to at least two attacks. The first attack shows that the original binary authentication algorithm is universally forgeable under chosen-message attacks, i.e., the attacker can forge other vehicles' authentication on any message under chosen-message attack. The second attack shows that the original binary authentication algorithm is universally forgeable, i.e., the attacker can forge other vehicles' authentication on any message at will. Although Jiang et al.'s scheme is insecure, it can be repaired. Using the binary authentication tree model, we repair their scheme in order to make it provably secure and efficient.
{"title":"An Improved Binary Authentication Tree Algorithm for Vehicular Networks","authors":"Huaqun Wang, Bo Qin, J. Domingo-Ferrer","doi":"10.1109/iNCoS.2012.27","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.27","url":null,"abstract":"Vehicular networks are gaining popularity because vehicular communications are able to help minimize accidents, improve traffic conditions, etc. To avoid malicious attacks and potential abuse, employing digital signatures is widely recognized as the most efficient approach for vehicular networks. However, when the number of signatures received by a roadside unit (RSU) becomes large, a scalability problem emerges immediately: it can be difficult for the RSU to sequentially verify every received signature within 100-300ms as required by the current Dedicated Short Range Communications (DSRC) broadcast protocol. Jiang et al. proposed a robust and efficient signature scheme for vehicular-to-infrastructure communications, called binary authentication tree. In this paper, we show that their binary authentication algorithm is insecure to at least two attacks. The first attack shows that the original binary authentication algorithm is universally forgeable under chosen-message attacks, i.e., the attacker can forge other vehicles' authentication on any message under chosen-message attack. The second attack shows that the original binary authentication algorithm is universally forgeable, i.e., the attacker can forge other vehicles' authentication on any message at will. Although Jiang et al.'s scheme is insecure, it can be repaired. Using the binary authentication tree model, we repair their scheme in order to make it provably secure and efficient.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127451114","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}
In this work we consider the problem of allocating tasks to fire brigade roles when facing major incidents like conflagrations or natural disasters. Due to missing experience with major incidents, a balanced workload of the different roles cannot be guaranteed, as task allocation is usually done manually by operations managers based on their empirical knowledge. Concerning this, we will introduce a new concept of role specific penalty functions that assign a stress level to every role depending on its working time. As the resulting problem is NP-complete, we will use an optimization strategy that combines a greedy approach with a modified version of the simulated annealing algorithm to approximatively solve this optimization problem. In our experimental study we will see that the assignment of tasks to roles computed by this algorithm on an empirical data set leads to a smaller total processing time and to a more balanced workload of roles compared to action plan recommendations given by six operations managers from the fire brigade.
{"title":"Optimizing Task Allocation on Fire Fighting","authors":"Frank-Gerrit Poggenpohl, Dennis Güttinger","doi":"10.1109/iNCoS.2012.14","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.14","url":null,"abstract":"In this work we consider the problem of allocating tasks to fire brigade roles when facing major incidents like conflagrations or natural disasters. Due to missing experience with major incidents, a balanced workload of the different roles cannot be guaranteed, as task allocation is usually done manually by operations managers based on their empirical knowledge. Concerning this, we will introduce a new concept of role specific penalty functions that assign a stress level to every role depending on its working time. As the resulting problem is NP-complete, we will use an optimization strategy that combines a greedy approach with a modified version of the simulated annealing algorithm to approximatively solve this optimization problem. In our experimental study we will see that the assignment of tasks to roles computed by this algorithm on an empirical data set leads to a smaller total processing time and to a more balanced workload of roles compared to action plan recommendations given by six operations managers from the fire brigade.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125383566","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}
This paper addresses the implementation of interference alignment (IA) in cognitive networks, where the unlicensed secondary transmitter-receiver pairs modeled as a K-user multiple-input and multiple-output (MIMO) interference channel coexist with the licensed multi-antenna primary user. Starting from investigating the constraint conditions of IA scheme in MIMO cognitive networks, a practical IA algorithm is developed based on the minor subspace tracking that utilizes the fast data projection method (FDPM), which requires no channel knowledge of secondary network. In the proposed algorithm, each secondary transmitter first aligns their transmitted signal into the null space of the channel matrix from itself to the primary user without causing any interference to the primary. Then secondary transmitters and receivers alternately design the precoding and post processing matrices through a training period which exploits the complex FDPM-based subspace tracking, thus eliminating interference among secondary users. Simulation results show that the proposed algorithm can achieve a high sum rate performance while requiring low computational complexity.
{"title":"Interference Alignment with Complex FDPM-Based Subspace Tracking in MIMO Cognitive Networks","authors":"Bin Zhu, J. Ge, Xiaoye Shi, Yunxia Huang","doi":"10.1109/iNCoS.2012.35","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.35","url":null,"abstract":"This paper addresses the implementation of interference alignment (IA) in cognitive networks, where the unlicensed secondary transmitter-receiver pairs modeled as a K-user multiple-input and multiple-output (MIMO) interference channel coexist with the licensed multi-antenna primary user. Starting from investigating the constraint conditions of IA scheme in MIMO cognitive networks, a practical IA algorithm is developed based on the minor subspace tracking that utilizes the fast data projection method (FDPM), which requires no channel knowledge of secondary network. In the proposed algorithm, each secondary transmitter first aligns their transmitted signal into the null space of the channel matrix from itself to the primary user without causing any interference to the primary. Then secondary transmitters and receivers alternately design the precoding and post processing matrices through a training period which exploits the complex FDPM-based subspace tracking, thus eliminating interference among secondary users. Simulation results show that the proposed algorithm can achieve a high sum rate performance while requiring low computational complexity.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"707 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122988835","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}
Cloud computing is becoming concerned both in academia and industry and one of the most important applications is outsourced computation. A computationally weak client out sources tasks to one or more workers in cloud, and this is called outsourced computation. This paper presents an outsourced protocol based on Kamara's scheme [19], and it allows the client to outsource their computation to more than one workers while keeping privacy and correctness. Kamara proposed security definitions, while regretfully, didn't show the description of the protocol. This paper presents a specific scheme in which the workers computes directly on shares that client send to them, so the workers don't have to interactive with each other. This protocol has these advantages: the protocol keeps privacy of the original input, the workers have no interactivity with each other during the execution, the protocol keeps the threshold unchanged.
{"title":"A Non-interactive Secure Outsourced Computation Scheme in Multi-party Cloud","authors":"Shu Guo, Haixia Xu","doi":"10.1109/iNCoS.2012.50","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.50","url":null,"abstract":"Cloud computing is becoming concerned both in academia and industry and one of the most important applications is outsourced computation. A computationally weak client out sources tasks to one or more workers in cloud, and this is called outsourced computation. This paper presents an outsourced protocol based on Kamara's scheme [19], and it allows the client to outsource their computation to more than one workers while keeping privacy and correctness. Kamara proposed security definitions, while regretfully, didn't show the description of the protocol. This paper presents a specific scheme in which the workers computes directly on shares that client send to them, so the workers don't have to interactive with each other. This protocol has these advantages: the protocol keeps privacy of the original input, the workers have no interactivity with each other during the execution, the protocol keeps the threshold unchanged.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129345094","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}
Holman Bolívar Barón, Mario Martínez Rojas, R. G. Crespo, Oscar Sanjuán Martínez
Design of scheduling algorithms for a heterogeneous computing system interconnected with an arbitrary communication network is one of the actual concerns in distributed systems research, due to the heterogeneous nature of resource, computing capacity, memory, devices, internet and institutional policies. Multi-agent systems have been a nice option of solution because of its distributed nature, autonomy, solidarity and proactivity. Though, in works related, is ignored the lack of control that the scheduler has the resources. We show the process of designing of a scheduler based on multi-agent systems. We used for the development, approach is proposed by Telecom Italia Lab, because the system was developed using the Java Agent Development Framework (JADE) because it meets all the standard of Intelligent Physical Agents Foundation. For the matchmaker process, we propose to use hidden Markov models because it facilitates the prediction of availability of the grid's resources and can evolve over time.
{"title":"A Multi-agent Matchmaker Based on Hidden Markov Model for Decentralized Grid Scheduling","authors":"Holman Bolívar Barón, Mario Martínez Rojas, R. G. Crespo, Oscar Sanjuán Martínez","doi":"10.1109/iNCoS.2012.102","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.102","url":null,"abstract":"Design of scheduling algorithms for a heterogeneous computing system interconnected with an arbitrary communication network is one of the actual concerns in distributed systems research, due to the heterogeneous nature of resource, computing capacity, memory, devices, internet and institutional policies. Multi-agent systems have been a nice option of solution because of its distributed nature, autonomy, solidarity and proactivity. Though, in works related, is ignored the lack of control that the scheduler has the resources. We show the process of designing of a scheduler based on multi-agent systems. We used for the development, approach is proposed by Telecom Italia Lab, because the system was developed using the Java Agent Development Framework (JADE) because it meets all the standard of Intelligent Physical Agents Foundation. For the matchmaker process, we propose to use hidden Markov models because it facilitates the prediction of availability of the grid's resources and can evolve over time.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130543645","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}
This paper has presented acquiring method for agents' actions using Ant Colony Optimization (ACO) in multi-agent system. ACO is one of powerful meta-heuristics algorithms and some researchers have reported the effectiveness of some applications with the algorithm [1-4]. I have developed fire brigade agents using proposed method in Robo Cup rescue simulation system. The final goal of this research is an achievement of co-operations for hetero-agent in multi-agent systems. Then this research for implementation for fire brigade agents in my team is the first step of this goal.
{"title":"Evaluation for Acquiring Method for Agents' Actions with Ant Colony Optimization in Robo Cup Rescue Simulation System","authors":"Hisayuki Sasaoka","doi":"10.1109/iNCoS.2012.104","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.104","url":null,"abstract":"This paper has presented acquiring method for agents' actions using Ant Colony Optimization (ACO) in multi-agent system. ACO is one of powerful meta-heuristics algorithms and some researchers have reported the effectiveness of some applications with the algorithm [1-4]. I have developed fire brigade agents using proposed method in Robo Cup rescue simulation system. The final goal of this research is an achievement of co-operations for hetero-agent in multi-agent systems. Then this research for implementation for fire brigade agents in my team is the first step of this goal.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114614697","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}
Certificateless public key cryptography (CL-PKC) is an important type of public key cryptography, which effectively solves the inherent key escrow problem in identity based public key cryptography while keeps its certificate-free property. As the adversarial models in CL-PKC are relatively complex, designing efficient and secure certificate less encryption schemes in the standard model has been an interesting and challenging research topic. In this paper, we give cryptanalysis to an existing certificate less encryption scheme in the standard model. We show its insecurity by demonstrating two kinds of attacks.
{"title":"Cryptanalysis of a Certificateless Encryption Scheme in the Standard Model","authors":"Limin Shen, Futai Zhang, Yinxia Sun, Sujuan Li","doi":"10.1109/iNCoS.2012.68","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.68","url":null,"abstract":"Certificateless public key cryptography (CL-PKC) is an important type of public key cryptography, which effectively solves the inherent key escrow problem in identity based public key cryptography while keeps its certificate-free property. As the adversarial models in CL-PKC are relatively complex, designing efficient and secure certificate less encryption schemes in the standard model has been an interesting and challenging research topic. In this paper, we give cryptanalysis to an existing certificate less encryption scheme in the standard model. We show its insecurity by demonstrating two kinds of attacks.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130089015","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}
The Semantic Web, or the Web of meaning, is the second stage of the Web. Its objective is to make a better cooperation between computers and people. Encoding data in forms that make web contents (semantics, meaning) understandable by computer means is a real problem in pervasive environments. In this article I present a metadata design used in implementation of the Mobile services framework presented in our previous paper: "Web services applied to mobile environments". After examining existing solutions for representing metadata, we present a model that best suits mobile environments in terms of adaptability to context modeling and extensibility.
{"title":"A Practical Metadata Model for Access Control Modules","authors":"Alexandru Petculescu","doi":"10.1109/iNCoS.2012.59","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.59","url":null,"abstract":"The Semantic Web, or the Web of meaning, is the second stage of the Web. Its objective is to make a better cooperation between computers and people. Encoding data in forms that make web contents (semantics, meaning) understandable by computer means is a real problem in pervasive environments. In this article I present a metadata design used in implementation of the Mobile services framework presented in our previous paper: \"Web services applied to mobile environments\". After examining existing solutions for representing metadata, we present a model that best suits mobile environments in terms of adaptability to context modeling and extensibility.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132032022","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}
In this fast growing world, rapid alterations in technologies result in having a huge influence on humans' standard of living, increase global opportunities and globalize shareholders' activities. Executives all over the world are expected to utilize the right technology in order to gain the high level of success for their organizations. These executives require sustainable knowledge, techniques and tools that will allow them to continue to advance and remain ahead of the competition in the business environment. In this paper, we consider the techniques that will give a clear analysis of how social capital can be created within virtual teams or organizations and what value is created with the help of social capital. It will help organizations to examine the type of value they already created with social capital and its reflection in the future.
{"title":"Social Capital in Virtual Organizations","authors":"Saad Alqithami, H. Hexmoor","doi":"10.1109/iNCoS.2012.124","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.124","url":null,"abstract":"In this fast growing world, rapid alterations in technologies result in having a huge influence on humans' standard of living, increase global opportunities and globalize shareholders' activities. Executives all over the world are expected to utilize the right technology in order to gain the high level of success for their organizations. These executives require sustainable knowledge, techniques and tools that will allow them to continue to advance and remain ahead of the competition in the business environment. In this paper, we consider the techniques that will give a clear analysis of how social capital can be created within virtual teams or organizations and what value is created with the help of social capital. It will help organizations to examine the type of value they already created with social capital and its reflection in the future.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126914455","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：