We propose a scheme for non-delegatable strong designated verifier signature. The scheme is based on pairings, and utilizes an OR proof technique and a method of ensuring the integrity of a signature. In a standard model, the unforgeability property of the scheme is reducible to a computational Co-Diffie-Hellman problem. The scheme is perfect non-transferable, and its properties of privacy of signer's identity and non-delegatability are reducible to the correctness of two variants of a knowledge of exponent assumption.
{"title":"A Non-delegatable Strong Designated Verifier Signature without Random Oracles","authors":"Haibo Tian, Zhengtao Jiang, Yi Liu, Baodian Wei","doi":"10.1109/iNCoS.2012.85","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.85","url":null,"abstract":"We propose a scheme for non-delegatable strong designated verifier signature. The scheme is based on pairings, and utilizes an OR proof technique and a method of ensuring the integrity of a signature. In a standard model, the unforgeability property of the scheme is reducible to a computational Co-Diffie-Hellman problem. The scheme is perfect non-transferable, and its properties of privacy of signer's identity and non-delegatability are reducible to the correctness of two variants of a knowledge of exponent assumption.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"55 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":"126448604","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 an emerging computing paradigm in which IT resources and capacities are provided as services over the Internet. Promising as it is, this paradigm also brings forth new challenges for security when users want to securely outsource the computation of cryptographic operations to the untrusted cloud servers. As we know, modular exponentiation is one of basic operations among most of current cryptosystems. In this paper, we present two generic secure outsourcing schemes enabling users to securely outsource the computations of exponentiations to cloud servers. The first one is a secure outsourcing scheme for fixed base-variable exponent exponentiation, while the second is for fixed exponent-variable base exponentiation. With our techniques, a batch of exponentiations (eg. t exponentiations) can be efficiently computed by the user with only (n+t) multiplications, where n is the number of bits of the exponent. Furthermore, there is not any pre-computation on the user side. The schemes are proved to be secure under the Hidden Subset Sum Problem.
{"title":"Efficient and Secure Batch Exponentiations Outsourcing in Cloud Computing","authors":"Xu Ma, Jin Li, Fangguo Zhang","doi":"10.1109/iNCoS.2012.31","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.31","url":null,"abstract":"Cloud computing is an emerging computing paradigm in which IT resources and capacities are provided as services over the Internet. Promising as it is, this paradigm also brings forth new challenges for security when users want to securely outsource the computation of cryptographic operations to the untrusted cloud servers. As we know, modular exponentiation is one of basic operations among most of current cryptosystems. In this paper, we present two generic secure outsourcing schemes enabling users to securely outsource the computations of exponentiations to cloud servers. The first one is a secure outsourcing scheme for fixed base-variable exponent exponentiation, while the second is for fixed exponent-variable base exponentiation. With our techniques, a batch of exponentiations (eg. t exponentiations) can be efficiently computed by the user with only (n+t) multiplications, where n is the number of bits of the exponent. Furthermore, there is not any pre-computation on the user side. The schemes are proved to be secure under the Hidden Subset Sum Problem.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"18 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":"115269689","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 paper, we propose a novel cooperative transmission strategy with broadcasting and cellular communication in a hybrid network system. With the help of cellular base station (CBS), two cooperative schemes are analyzed to improve broadcast performance. We define two thresholds in this paper. For users whose channel quality information (CQI) is less than the low threshold, e.g., the users near the edge of the broadcast cell, we deploy cooperative diversity transmission. Meanwhile, cooperative multiplexing transmission is exploited for users whose CQI is greater than the high threshold, such as those near the broadcasting base station (BBS). Our simulation results validate the effectiveness of our proposed cooperative schemes.
{"title":"Cooperative Transmission with Broadcasting and Communication","authors":"Dongdong Wei, Yun Rui, Yinhui Luo, Mingqi Li, Fang Wang, Yingguan Wang","doi":"10.1504/IJES.2013.057086","DOIUrl":"https://doi.org/10.1504/IJES.2013.057086","url":null,"abstract":"In this paper, we propose a novel cooperative transmission strategy with broadcasting and cellular communication in a hybrid network system. With the help of cellular base station (CBS), two cooperative schemes are analyzed to improve broadcast performance. We define two thresholds in this paper. For users whose channel quality information (CQI) is less than the low threshold, e.g., the users near the edge of the broadcast cell, we deploy cooperative diversity transmission. Meanwhile, cooperative multiplexing transmission is exploited for users whose CQI is greater than the high threshold, such as those near the broadcasting base station (BBS). Our simulation results validate the effectiveness of our proposed cooperative schemes.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"37 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":"124993854","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}
A community of interest is helpful to professionals to assemble around a common interest and exchange information and experiences. However, the most used communities are too general for some specific areas and they are unable to store and classify relevant information for the community users. In this paper, we propose an approach that can be integrated with existent communities of practice. Moreover, it allows to specify and share the information relevant to the community of practice of orthopaedic based on a wiki. Instead of using a generic wiki where the knowledge is stored in textual format, a semantic wiki is used. This semantic tool, combined with an ontology description of the domain, stores the information in a computer readable format that could provide in the future additional advanced services to the community professionals.
{"title":"Towards an Ontological Approach to Enrich a Community of Interest in Orthopaedic Specialty","authors":"M. E. Riu, David Bañeres, J. Conesa","doi":"10.1109/iNCoS.2012.81","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.81","url":null,"abstract":"A community of interest is helpful to professionals to assemble around a common interest and exchange information and experiences. However, the most used communities are too general for some specific areas and they are unable to store and classify relevant information for the community users. In this paper, we propose an approach that can be integrated with existent communities of practice. Moreover, it allows to specify and share the information relevant to the community of practice of orthopaedic based on a wiki. Instead of using a generic wiki where the knowledge is stored in textual format, a semantic wiki is used. This semantic tool, combined with an ontology description of the domain, stores the information in a computer readable format that could provide in the future additional advanced services to the community professionals.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"37 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":"125006609","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}
Asta Zelenkauskaite, N. Bessis, Stelios Sotiriadis, E. Asimakopoulou
This visionary paper presents the Internet of Things paradigm in terms of interdependent dynamic dimensions of objects and their properties. Given that in its current state Internet of Things (IoT) has been viewed as a paradigm based on hierarchical distribution of objects, evaluation of the dynamic nature of the hierarchical structures faces challenges in its evaluation and analysis. Within this in mind, our focus is on the area of complex social networks and the dynamic social network construction within the context of IoT. This is by highlighting and addressing the tagging issues of the objects to the real-world domain such as in disaster management, these are in relation to their hierarchies and interrelation within the context of social network analysis. Specifically, we suggest to investigate and deepen the understanding of the IoT paradigm through the application of social network analysis as a method for interlinking objects -- and thus, propose ways in which IoT could be subsequently interlinked and analyzed through social network analysis approach - which provides possibilities for linking of the objects, while extends it into real-world domain. With this in mind, we present few applications and key characteristics of disaster management and the social networking analysis approach, as well as, foreseen benefits of its application in the IoT domain.
{"title":"Interconnectedness of Complex Systems of Internet of Things through Social Network Analysis for Disaster Management","authors":"Asta Zelenkauskaite, N. Bessis, Stelios Sotiriadis, E. Asimakopoulou","doi":"10.1109/iNCoS.2012.25","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.25","url":null,"abstract":"This visionary paper presents the Internet of Things paradigm in terms of interdependent dynamic dimensions of objects and their properties. Given that in its current state Internet of Things (IoT) has been viewed as a paradigm based on hierarchical distribution of objects, evaluation of the dynamic nature of the hierarchical structures faces challenges in its evaluation and analysis. Within this in mind, our focus is on the area of complex social networks and the dynamic social network construction within the context of IoT. This is by highlighting and addressing the tagging issues of the objects to the real-world domain such as in disaster management, these are in relation to their hierarchies and interrelation within the context of social network analysis. Specifically, we suggest to investigate and deepen the understanding of the IoT paradigm through the application of social network analysis as a method for interlinking objects -- and thus, propose ways in which IoT could be subsequently interlinked and analyzed through social network analysis approach - which provides possibilities for linking of the objects, while extends it into real-world domain. With this in mind, we present few applications and key characteristics of disaster management and the social networking analysis approach, as well as, foreseen benefits of its application in the IoT domain.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"7 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":"125370661","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 position paper we present a new networking framework -- SdNET - that integrates software driven features with the management features of modern autonomic network management, and many service features from the world of Services. This framework is under development and validation.
{"title":"Management of Software Driven Networks - Research Challenges","authors":"A. Galis, S. Clayman","doi":"10.1109/iNCoS.2012.122","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.122","url":null,"abstract":"In this position paper we present a new networking framework -- SdNET - that integrates software driven features with the management features of modern autonomic network management, and many service features from the world of Services. This framework is under development and validation.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"37 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":"114690520","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 lack of available and practical analysis about some regular knowledge of mobility models has limit their applications to mobile ad hoc networks. As the mobility models have the great significance effects on the network performance, and meanwhile, existing in-depth researches are mostly based on the i.i.d. mobility model which is a way of globe move, the desire for the effective and reasonable applications of the two-hop relay algorithms to other more realistic mobility models contributes to this paper. We focus on a time-slotted finite network system in order to simplify the complex probabilistic description process of the non-i.i.d. mobility models and we develop some general probability analysis under various mobility solutions. We further put forward some conditions that can make the behaviors of the special mobility models approximately equivalent to that of the i.i.d mobility model. Related simulation studies are also conducted to demonstrate that the different mobility models might have similar influences on the capacity and delay of a mobile ad hoc network.
{"title":"The Analysis of Mobility Models in MANETs with Two-Hop Relay Algorithm","authors":"Ying Cai, Xiaofei Wang, Yuqing Zhang","doi":"10.1109/iNCoS.2012.12","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.12","url":null,"abstract":"The lack of available and practical analysis about some regular knowledge of mobility models has limit their applications to mobile ad hoc networks. As the mobility models have the great significance effects on the network performance, and meanwhile, existing in-depth researches are mostly based on the i.i.d. mobility model which is a way of globe move, the desire for the effective and reasonable applications of the two-hop relay algorithms to other more realistic mobility models contributes to this paper. We focus on a time-slotted finite network system in order to simplify the complex probabilistic description process of the non-i.i.d. mobility models and we develop some general probability analysis under various mobility solutions. We further put forward some conditions that can make the behaviors of the special mobility models approximately equivalent to that of the i.i.d mobility model. Related simulation studies are also conducted to demonstrate that the different mobility models might have similar influences on the capacity and delay of a mobile ad hoc network.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"25 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":"127378480","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}
Learning management systems (LMSs) provide their users with the appropriate environments and tools to author, monitor and engage in collaborative learning activities. The unstructured collaboration spaces and the domain-independent interfaces of those platforms, pose restrictions to the analysis and the evaluation of the collaboration learning process. In this work is presented the design of an advising system, which aims to guide the users of the collaborative activities in a lesson in a LMS, by issuing recommendations and advices on the collaborative learning process. The system uses a fuzzy model to evaluate the learning behaviors of the learners and groups in the collaborative activities across several dimensions. An intelligent agent issues advices and recommendations to the learners and groups of the lesson based on their learning behaviors. The system aims to facilitate management of the collaborative activities in a LMS, by advising the instructors on the design of the collaborative learning experiences and also the learners on self-regulating their learning behaviors. The intelligent system has been partially developed using the Java Agent Development Framework (JADE) for the collaborative activities of Learning Activity Management System (LAMS).
{"title":"An Advising System for Supporting Users of Collaborative Activities in LMSs","authors":"T. Chronopoulos, I. Hatzilygeroudis","doi":"10.1109/iNCoS.2012.73","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.73","url":null,"abstract":"Learning management systems (LMSs) provide their users with the appropriate environments and tools to author, monitor and engage in collaborative learning activities. The unstructured collaboration spaces and the domain-independent interfaces of those platforms, pose restrictions to the analysis and the evaluation of the collaboration learning process. In this work is presented the design of an advising system, which aims to guide the users of the collaborative activities in a lesson in a LMS, by issuing recommendations and advices on the collaborative learning process. The system uses a fuzzy model to evaluate the learning behaviors of the learners and groups in the collaborative activities across several dimensions. An intelligent agent issues advices and recommendations to the learners and groups of the lesson based on their learning behaviors. The system aims to facilitate management of the collaborative activities in a LMS, by advising the instructors on the design of the collaborative learning experiences and also the learners on self-regulating their learning behaviors. The intelligent system has been partially developed using the Java Agent Development Framework (JADE) for the collaborative activities of Learning Activity Management System (LAMS).","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"13 4 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":"126889402","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}
Femtocells will be widely employed in the next generation wireless networks since they improve indoor capacity and coverage with low cost and low power characteristics. However since macro cells may have to share the same spectrum with femtocells, resource allocation schemes have been a key challenge to manage interference. In this paper, we propose a novel resource allocation scheme based on cognitive technologies and cooperative game theory. The competition among the Femtocell Access Points (FAPs) for spectrum resource and power resource is formulated as a game-theoretic problem. We solve the problem by integrating Dynamic Sub carrier Allocation (DSA) algorithm and Adaptive Power Allocation (APA) algorithm implemented by the cognitive macro cell Base Station, so that the interference is reduced and the transmitting rate is increased. Simulation results show that compared with the max-rate algorithm and max-min fairness algorithm, the scheme we proposed achieves a better trade-off between the transmitting rate and the fairness.
{"title":"Game-Theoretic Resource Allocation of the Cognitive Base Station in Two-Tie Co-existing Femtocell Networks","authors":"Jing Song, J. Ge, Jing Li, L. Cong","doi":"10.1109/iNCoS.2012.49","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.49","url":null,"abstract":"Femtocells will be widely employed in the next generation wireless networks since they improve indoor capacity and coverage with low cost and low power characteristics. However since macro cells may have to share the same spectrum with femtocells, resource allocation schemes have been a key challenge to manage interference. In this paper, we propose a novel resource allocation scheme based on cognitive technologies and cooperative game theory. The competition among the Femtocell Access Points (FAPs) for spectrum resource and power resource is formulated as a game-theoretic problem. We solve the problem by integrating Dynamic Sub carrier Allocation (DSA) algorithm and Adaptive Power Allocation (APA) algorithm implemented by the cognitive macro cell Base Station, so that the interference is reduced and the transmitting rate is increased. Simulation results show that compared with the max-rate algorithm and max-min fairness algorithm, the scheme we proposed achieves a better trade-off between the transmitting rate and the fairness.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"103 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":"126690538","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 Ground Station Scheduling is one of the most important problems in the field of Satellite-Scheduling. This problem consists in planning feasible planning of communications between satellites or spacecraft (SC) and operations teams of Ground Station (GS). The information received in these communications is usually basic information such as telemetry, tracking information or tasks to perform, so usually the time required for communication is usually quite smaller than the window of visibility. Typically, the assignment of the Ground Stations to Spacecraft is a very limited and small enough to make a manual planning, defined by short periods of time. However, resource allocation of a ground station on a mission has a high cost, and automation of this process provides many benefits not only in terms of management, but in economic terms as well. The problem is known for its high complexity and is an over-constrained problem. In this paper, we present the resolution of the problem through Struggle Genetic Algorithms. Struggle GA is a version of GAs that distinguishes for its efficiency in maintaining the diversity of the population through genetic evolution. We present some computational results for the case of the multi-ground stations scheduling obtained with Struggle GA using the STK simulation toolkit.
{"title":"A Struggle Genetic Algorithm for Ground Stations Scheduling Problem","authors":"F. Xhafa, X. Herrero, Admir Barolli, M. Takizawa","doi":"10.1109/iNCoS.2012.125","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.125","url":null,"abstract":"The Ground Station Scheduling is one of the most important problems in the field of Satellite-Scheduling. This problem consists in planning feasible planning of communications between satellites or spacecraft (SC) and operations teams of Ground Station (GS). The information received in these communications is usually basic information such as telemetry, tracking information or tasks to perform, so usually the time required for communication is usually quite smaller than the window of visibility. Typically, the assignment of the Ground Stations to Spacecraft is a very limited and small enough to make a manual planning, defined by short periods of time. However, resource allocation of a ground station on a mission has a high cost, and automation of this process provides many benefits not only in terms of management, but in economic terms as well. The problem is known for its high complexity and is an over-constrained problem. In this paper, we present the resolution of the problem through Struggle Genetic Algorithms. Struggle GA is a version of GAs that distinguishes for its efficiency in maintaining the diversity of the population through genetic evolution. We present some computational results for the case of the multi-ground stations scheduling obtained with Struggle GA using the STK simulation toolkit.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"13 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":"134561184","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
扫码关注我们
求助内容：
应助结果提醒方式：