General compression algorithms were designed for usage characters as basic symbols. Later, algorithm which used words were developed. The problem is that there is no clear line which defines if is better to use characters or words. In this paper, we developed optimization algorithm based on simulated annealing that selects only several words from all possible words and combine them with character to improve overall compression. The achieved results are very promising.
{"title":"Improving Compression Using Words","authors":"J. Platoš, P. Krömer","doi":"10.1109/iNCoS.2012.103","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.103","url":null,"abstract":"General compression algorithms were designed for usage characters as basic symbols. Later, algorithm which used words were developed. The problem is that there is no clear line which defines if is better to use characters or words. In this paper, we developed optimization algorithm based on simulated annealing that selects only several words from all possible words and combine them with character to improve overall compression. The achieved results are very promising.","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":"126702016","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 new knapsack public key cryptosystem is crypt analyzed. The cryptanalytic attack uses the Euclidean algorithm to obtain the greatest common divisor of some integers, and thus recovers the modulus. Then the attack reconstructs the multiplier by solving a linear congruence. Therefore, all the secret keys can be retrieved in polynomial time. Hence, the public key cryptosystem is insecure.
{"title":"Key Recovery Attack on a Knapsack Public Key Cryptosystem","authors":"Chunfei Ju, Hui Yuan","doi":"10.1109/iNCoS.2012.89","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.89","url":null,"abstract":"A new knapsack public key cryptosystem is crypt analyzed. The cryptanalytic attack uses the Euclidean algorithm to obtain the greatest common divisor of some integers, and thus recovers the modulus. Then the attack reconstructs the multiplier by solving a linear congruence. Therefore, all the secret keys can be retrieved in polynomial time. Hence, the public key cryptosystem is insecure.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"44 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":"125514179","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 proxy re-encryption (PRE), a semi-trusted proxy can convert a cipher text originally intended for Alice into one which can be decrypted by Bob, while the proxy can not know the corresponding plaintext. PREcan be classified as single-use PRE and multi-use PRE according to the times the cipher text can be transformed. In multi-use PRE schemes, the cipher text can be transformed from A to B and to C and so on. In CCS'09 (post session), Wan get al. proposed a multi-use unidirectional CCA-secure proxy re-encryption scheme. Unfortunately, we show their proposal is not CCA-secure in the corresponding security models by giving concrete attacks.
{"title":"On the Security of a Multi-use CCA-Secure Proxy Re-encryption Scheme","authors":"Jindan Zhang, Xu An Wang","doi":"10.1109/iNCoS.2012.53","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.53","url":null,"abstract":"In proxy re-encryption (PRE), a semi-trusted proxy can convert a cipher text originally intended for Alice into one which can be decrypted by Bob, while the proxy can not know the corresponding plaintext. PREcan be classified as single-use PRE and multi-use PRE according to the times the cipher text can be transformed. In multi-use PRE schemes, the cipher text can be transformed from A to B and to C and so on. In CCS'09 (post session), Wan get al. proposed a multi-use unidirectional CCA-secure proxy re-encryption scheme. Unfortunately, we show their proposal is not CCA-secure in the corresponding security models by giving concrete attacks.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"48 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":"124365472","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}
Charlie Baker, A. Anjum, Richard Hill, N. Bessis, Saad Liaquat
With network infrastructure reaching capacity limits, new ways of managing network traffic and devices in Cloud data centres need to be investigated to better scale and manage the data centre resources. Open Flow can be a good fit for the usage within a datacentre due to its promise to reduce the cost of operations by reducing the time needed to configure network resources and flexibly managing the operations. Open Flow allows a programmable Software Defined Network to be implemented and network resources such as switches can be remotely and collectively configured, controlled and monitored. With increasing number of resources in data centres, and by consequence the networking hardware and software, Open Flow can be used to manage the network devices and the flow of traffic throughout the network. This paper investigates if Open Flow based switches allow for flexible networking and administration to enable quick network segmentation, packet re-routing, permit scalability and allow for quick network setup in Cloud data centres. With the help of experiments, this work also investigates what design and implementation considerations need to be made to achieve scalability, agility and performance in Cloud data centres.
{"title":"Improving Cloud Datacentre Scalability, Agility and Performance Using OpenFlow","authors":"Charlie Baker, A. Anjum, Richard Hill, N. Bessis, Saad Liaquat","doi":"10.1109/iNCoS.2012.118","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.118","url":null,"abstract":"With network infrastructure reaching capacity limits, new ways of managing network traffic and devices in Cloud data centres need to be investigated to better scale and manage the data centre resources. Open Flow can be a good fit for the usage within a datacentre due to its promise to reduce the cost of operations by reducing the time needed to configure network resources and flexibly managing the operations. Open Flow allows a programmable Software Defined Network to be implemented and network resources such as switches can be remotely and collectively configured, controlled and monitored. With increasing number of resources in data centres, and by consequence the networking hardware and software, Open Flow can be used to manage the network devices and the flow of traffic throughout the network. This paper investigates if Open Flow based switches allow for flexible networking and administration to enable quick network segmentation, packet re-routing, permit scalability and allow for quick network setup in Cloud data centres. With the help of experiments, this work also investigates what design and implementation considerations need to be made to achieve scalability, agility and performance in Cloud data centres.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"34 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":"127762786","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}
Yueyu Zhang, Jing Chen, Hui Li, Wujun Zhang, Jin Cao, Chengzhe Lai
In cellular networks, Machine-Type Communication (MTC) has shown the advantages, including better coverage and lower network deployment cost, which makes it become the hotspot in industry area. However, the current cellular network is designed for human-to-human communication (H2H), and less optimal for machine-to-machine, machine-to-human or human-to-machine applications. One of the most urgent issues, which network operators are currently facing, is MTC related signalling congestion and overload. Especially, when a large co-located MTC group almost simultaneously accesses or periodically transmits, masses authentication data may cause a serious congestion in VLR/SGSN node and overload of link between serving network (SN) and home environment (HE). This paper provides a practical group based authentication and key agreement for MTC roaming scenario. In the group, each MTC device not only shares a secret key with home environment, but also a group secret key with home environment and other MTC devices belong to the same group. Then signalling data is reduced between serving network and home environment, by the MTC device using this group key as an authentication key and authenticating locally. Furthermore, a method of group key update is proposed to suit for dynamic MTC group. Finally, the analysis shows that the proposal can remarkably lower the effort of handling large MTC group, and minimize the change of operator's core network(CN).
{"title":"Dynamic Group Based Authentication Protocol for Machine Type Communications","authors":"Yueyu Zhang, Jing Chen, Hui Li, Wujun Zhang, Jin Cao, Chengzhe Lai","doi":"10.1109/iNCoS.2012.86","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.86","url":null,"abstract":"In cellular networks, Machine-Type Communication (MTC) has shown the advantages, including better coverage and lower network deployment cost, which makes it become the hotspot in industry area. However, the current cellular network is designed for human-to-human communication (H2H), and less optimal for machine-to-machine, machine-to-human or human-to-machine applications. One of the most urgent issues, which network operators are currently facing, is MTC related signalling congestion and overload. Especially, when a large co-located MTC group almost simultaneously accesses or periodically transmits, masses authentication data may cause a serious congestion in VLR/SGSN node and overload of link between serving network (SN) and home environment (HE). This paper provides a practical group based authentication and key agreement for MTC roaming scenario. In the group, each MTC device not only shares a secret key with home environment, but also a group secret key with home environment and other MTC devices belong to the same group. Then signalling data is reduced between serving network and home environment, by the MTC device using this group key as an authentication key and authenticating locally. Furthermore, a method of group key update is proposed to suit for dynamic MTC group. Finally, the analysis shows that the proposal can remarkably lower the effort of handling large MTC group, and minimize the change of operator's core network(CN).","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":"131079352","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}
Tibebe Beshah, D. Ejigu, P. Krömer, V. Snás̃el, J. Platoš, A. Abraham
This paper presents an application of evolutionary fuzzy classifier design to a road accident data analysis. A fuzzy classifier evolved by the genetic programming was used to learn the labeling of data in a real world road accident data set. The symbolic classifier was inspected in order to select important features and the relations among them. Selected features provide a feedback for traffic management authorities that can exploit the knowledge to improve road safety and mitigate the severity of traffic accidents.
{"title":"Learning the Classification of Traffic Accident Types","authors":"Tibebe Beshah, D. Ejigu, P. Krömer, V. Snás̃el, J. Platoš, A. Abraham","doi":"10.1109/INCOS.2012.75","DOIUrl":"https://doi.org/10.1109/INCOS.2012.75","url":null,"abstract":"This paper presents an application of evolutionary fuzzy classifier design to a road accident data analysis. A fuzzy classifier evolved by the genetic programming was used to learn the labeling of data in a real world road accident data set. The symbolic classifier was inspected in order to select important features and the relations among them. Selected features provide a feedback for traffic management authorities that can exploit the knowledge to improve road safety and mitigate the severity of traffic accidents.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"102 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":"132493704","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 normalized local binary fitting (NLBF) model is proposed for image segmentation in this paper. The proposed model can effectively and efficiently segment images with intensity in homogeneity because the image local characteristics are considered. At the same time, we use a Gaussian filtering process instead of the regularization to keep the level set function smooth in the evolution process. The strategy can reduce computational cost. Comparative experimental results on synthetic and real images demonstrate that the proposed model outperforms the well-known local binary fitting (LBF) model in computational efficiency and robustness to the initial contour.
{"title":"A Normalized Local Binary Fitting Model for Image Segmentation","authors":"Yali Peng, Fang Liu, Shigang Liu","doi":"10.1109/iNCoS.2012.119","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.119","url":null,"abstract":"A normalized local binary fitting (NLBF) model is proposed for image segmentation in this paper. The proposed model can effectively and efficiently segment images with intensity in homogeneity because the image local characteristics are considered. At the same time, we use a Gaussian filtering process instead of the regularization to keep the level set function smooth in the evolution process. The strategy can reduce computational cost. Comparative experimental results on synthetic and real images demonstrate that the proposed model outperforms the well-known local binary fitting (LBF) model in computational efficiency and robustness to the initial contour.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"3 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":"131904691","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 proposes a strong designated verifier signature (SDVS) based on a recently proposed mathematical problem. It consists in searching for an isogeny between super singular elliptic curves. The problem is hypothetically strong against a quantum computer. This makes our proposal the first SDVS scheme that may be secure against a quantum computer.
{"title":"Toward Quantum-Resistant Strong Designated Verifier Signature from Isogenies","authors":"Xi Sun, Haibo Tian, Yumin Wang","doi":"10.1109/iNCoS.2012.70","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.70","url":null,"abstract":"This paper proposes a strong designated verifier signature (SDVS) based on a recently proposed mathematical problem. It consists in searching for an isogeny between super singular elliptic curves. The problem is hypothetically strong against a quantum computer. This makes our proposal the first SDVS scheme that may be secure against a quantum computer.","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":"124425976","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 recently-proposed knapsack public key cryptosystem called knapsack cipher 0/255 is crypt analyzed. It is pointed out that a lattice can be derived from the public key of the knapsack cipher 0/255. The corresponding secret key can be recovered by finding the shortest nonzero vector with lattice basis reduction algorithms. Thus the knapsack cipher 0/255 is insecure.
{"title":"Lattice Attack on the Knapsack Cipher 0/255","authors":"Baocang Wang, H. Lei","doi":"10.1109/iNCoS.2012.90","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.90","url":null,"abstract":"A recently-proposed knapsack public key cryptosystem called knapsack cipher 0/255 is crypt analyzed. It is pointed out that a lattice can be derived from the public key of the knapsack cipher 0/255. The corresponding secret key can be recovered by finding the shortest nonzero vector with lattice basis reduction algorithms. Thus the knapsack cipher 0/255 is insecure.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"12 3 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":"116808175","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}
L. Gheorghe, D. Tudose, Markus Wehner, S. Zeisberg
Multi-Owner Wireless Sensor Networks consist of devices owned by different entities. They have the purpose of covering large areas and reducing energy consumption associated with transmission over long distances. We propose the use of Virtual Networks with the purpose of grouping resources in a Multi-Owner Wireless Sensor Network and delivering a service to the associated owner. We designed a scheme for securing communication in a Virtual Network. The nodes that belong to a specific owner must authenticate themselves before receiving the Virtual Network credentials and the Service Description. We investigated the impact of false data injection and eavesdropping attacks generated by external or internal compromised nodes. We conclude that our security scheme minimizes the impact of attacks against Multi-Owner Wireless Sensor Networks, while allowing data aggregation for efficiency purposes.
{"title":"Securing Virtual Networks for Multi-owner Wireless Sensor Networks","authors":"L. Gheorghe, D. Tudose, Markus Wehner, S. Zeisberg","doi":"10.1109/iNCoS.2012.91","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.91","url":null,"abstract":"Multi-Owner Wireless Sensor Networks consist of devices owned by different entities. They have the purpose of covering large areas and reducing energy consumption associated with transmission over long distances. We propose the use of Virtual Networks with the purpose of grouping resources in a Multi-Owner Wireless Sensor Network and delivering a service to the associated owner. We designed a scheme for securing communication in a Virtual Network. The nodes that belong to a specific owner must authenticate themselves before receiving the Virtual Network credentials and the Service Description. We investigated the impact of false data injection and eavesdropping attacks generated by external or internal compromised nodes. We conclude that our security scheme minimizes the impact of attacks against Multi-Owner Wireless Sensor Networks, while allowing data aggregation for efficiency purposes.","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":"116942637","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
扫码关注我们
求助内容：
应助结果提醒方式：