Detectable Chosen Cipher text Security (DCCA security) is a security notion for Public-Key Encryptions proposed recently in [1]. A DCCA-secure encryption is not necessarily CCA-secure, but dangerous decryption queries can be detected and are not allowed to be requested to the decryption oracle. DCCA-secure schemes may helps in constructing of CCA-secure ones. In this paper, we show there are already DCCA-secure public-key encryptions from popular KEM+DEM style hybrid paradigms, and passive security for DEM is sufficient for achieving DCCA-secure hybrid PKEs both for KEM+DEM and Tag-KEM/DEM paradigms. Furthermore, two DCCA-secure Public-Key schemes constructed from CCA secure KEMs by using hybrid paradigms are presented, which fall outside any of the three cases pointed out in [1].
{"title":"DCCA-Secure Public-Key Encryptions from Hybrid Paradigms","authors":"Yuan Chen, Xiaofeng Chen, Hui Li","doi":"10.1109/iNCoS.2012.29","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.29","url":null,"abstract":"Detectable Chosen Cipher text Security (DCCA security) is a security notion for Public-Key Encryptions proposed recently in [1]. A DCCA-secure encryption is not necessarily CCA-secure, but dangerous decryption queries can be detected and are not allowed to be requested to the decryption oracle. DCCA-secure schemes may helps in constructing of CCA-secure ones. In this paper, we show there are already DCCA-secure public-key encryptions from popular KEM+DEM style hybrid paradigms, and passive security for DEM is sufficient for achieving DCCA-secure hybrid PKEs both for KEM+DEM and Tag-KEM/DEM paradigms. Furthermore, two DCCA-secure Public-Key schemes constructed from CCA secure KEMs by using hybrid paradigms are presented, which fall outside any of the three cases pointed out in [1].","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"23 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":"133282735","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}
Designated verifier signature (DVS) is a cryptographic primitive, which allows a signer to convince a designated verifier of the validity of a signed statement and prevents the verifier from convincing any third party about the signature. As a variant of DVS, strong DVS (SDVS), which exhibits perfect non-transferability, does not accommodate secure disavow ability (or non-repudiation). It makes a SDVS more like a message authentication code rather than a digital signature. In this situation, the signer has to bear the responsibility of some "forged" signatures produced by the designated verifier. Therefore, it's interesting to construct a strong DVS scheme with secure disavow ability. In this paper, we address this problem with a novel construction of a SDVS scheme with secure disavow ability. The new scheme utilizes a chameleon hash function and supports the signer to have a complete control of his signature. Our scheme achieves unforgeability, non-transferability and secure disavow ability. Comparisons show that the new scheme outperforms the existing one in terms of computational efficiency and signature length.
{"title":"A Strong Designated Verifier Signature Scheme with Secure Disavowability","authors":"Bo Yang, Ying Sun, Yong Yu, Qi Xia","doi":"10.1109/iNCoS.2012.24","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.24","url":null,"abstract":"Designated verifier signature (DVS) is a cryptographic primitive, which allows a signer to convince a designated verifier of the validity of a signed statement and prevents the verifier from convincing any third party about the signature. As a variant of DVS, strong DVS (SDVS), which exhibits perfect non-transferability, does not accommodate secure disavow ability (or non-repudiation). It makes a SDVS more like a message authentication code rather than a digital signature. In this situation, the signer has to bear the responsibility of some \"forged\" signatures produced by the designated verifier. Therefore, it's interesting to construct a strong DVS scheme with secure disavow ability. In this paper, we address this problem with a novel construction of a SDVS scheme with secure disavow ability. The new scheme utilizes a chameleon hash function and supports the signer to have a complete control of his signature. Our scheme achieves unforgeability, non-transferability and secure disavow ability. Comparisons show that the new scheme outperforms the existing one in terms of computational efficiency and signature length.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"76 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":"133171848","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}
Web services composition's efficiency strongly depends on the composability paradigm. In this paper, we propose a composability model for Web services that defines a set of composability rules and captures all information needed to verify the interconnection of services. Our proposal essentially deals with functional, non-functional and technical aspects, at both syntactic and semantic levels. It's based on WSDL, SAWSDL and WS-Policy's descriptions.
{"title":"A Composability Model for Efficient Web Service's Connectivity","authors":"Hajar Omrana, Fatima-Zahra Belouadha, O. Roudiès","doi":"10.1109/iNCoS.2012.21","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.21","url":null,"abstract":"Web services composition's efficiency strongly depends on the composability paradigm. In this paper, we propose a composability model for Web services that defines a set of composability rules and captures all information needed to verify the interconnection of services. Our proposal essentially deals with functional, non-functional and technical aspects, at both syntactic and semantic levels. It's based on WSDL, SAWSDL and WS-Policy's descriptions.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"12 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":"125660880","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}
Wireless Sensor Networks are used in a large number of tracking and monitoring applications. The level of security required by an application depends on the threat level, available resources, and security requirements. In this paper, we present a modular and extensible framework, called Adaptive Security Framework (ASF) that adjusts security to the detected threats, available energy and memory, and application requirements. The framework includes three types of components: the Context modules, the Security Adaptation module, and the Security layer. The security level is modified according to the output of the Context modules, and it is then used to enable the appropriate security primitives available in the Security layer. We evaluate our solution in multiple attack scenarios, we determine its resource consumption and we compare it to other State of the Art solutions. Our framework has the following advantages: it takes into consideration the context, but also allows for manual reconfiguration, it has a global, aggregated view of the context, it provides different authentication and encryption algorithms associated to each security level, it is extensible and modular.
{"title":"Adaptive Security Framework for Wireless Sensor Networks","authors":"L. Gheorghe, R. Rughinis, N. Tapus","doi":"10.1109/iNCoS.2012.94","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.94","url":null,"abstract":"Wireless Sensor Networks are used in a large number of tracking and monitoring applications. The level of security required by an application depends on the threat level, available resources, and security requirements. In this paper, we present a modular and extensible framework, called Adaptive Security Framework (ASF) that adjusts security to the detected threats, available energy and memory, and application requirements. The framework includes three types of components: the Context modules, the Security Adaptation module, and the Security layer. The security level is modified according to the output of the Context modules, and it is then used to enable the appropriate security primitives available in the Security layer. We evaluate our solution in multiple attack scenarios, we determine its resource consumption and we compare it to other State of the Art solutions. Our framework has the following advantages: it takes into consideration the context, but also allows for manual reconfiguration, it has a global, aggregated view of the context, it provides different authentication and encryption algorithms associated to each security level, it is extensible and modular.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"33 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":"129253356","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}
We present a benchmark for the performance evaluation of heuristic and meta-heuristic approaches to fair distribution of indivisible goods. The specific problem reflected by the benchmark data sets is Wireless Channel Allocation (WCA), and the approach to fair distribution is to choose from feasible allocations by the maximum set of a fairness relation between their corresponding allocation performances. The effort for exhaustive search for such maximum sets is rapidly increasing and even problems with 10 users may already be beyond today's computing capabilities. Here we present the results for up to 7 users and also discuss some general aspects of using fairness relations in the prescribed manner, also indicating the efficiency of the approach in terms of establishing rather small maximum sets with much overlap of maximal elements among different fairness relations.
{"title":"A Benchmark for Evaluating Approximated Algorithms for Fair Wireless Channel Allocation","authors":"Rodrigo Verschae, M. Köppen, M. Tsuru","doi":"10.1109/iNCoS.2012.109","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.109","url":null,"abstract":"We present a benchmark for the performance evaluation of heuristic and meta-heuristic approaches to fair distribution of indivisible goods. The specific problem reflected by the benchmark data sets is Wireless Channel Allocation (WCA), and the approach to fair distribution is to choose from feasible allocations by the maximum set of a fairness relation between their corresponding allocation performances. The effort for exhaustive search for such maximum sets is rapidly increasing and even problems with 10 users may already be beyond today's computing capabilities. Here we present the results for up to 7 users and also discuss some general aspects of using fairness relations in the prescribed manner, also indicating the efficiency of the approach in terms of establishing rather small maximum sets with much overlap of maximal elements among different fairness relations.","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":"115393483","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}
Chong-zhi Gao, Dongqing Xie, Jin Li, Baodian Wei, Haibo Tian
The deniably information-hiding encryption (DIHE) is a type of deniable encryption which can hide an additional information in encrypting a normal message. Even if the sender or the receiver is coerced to show the plaintext and the random coins in the encryption, a DIHE scheme behaves like only an innocent message is encrypted. Because it protects privacy against malicious coercer, the DIHE scheme is very useful in communication systems such as the cloud storage system when the communication channel is eavesdropped by a coercer. Previous DIHE schemes only concern the security under the adversary's chosen plaintext attack (CPA). This paper proposes the first DIHE construction with deniability and indistinguishability against adaptive chosen cipher text attack (CCA) which is stronger than the CPA attack. Our construction is simple and easy to implement. Furthermore, it achieves simultaneous sender and receiver deniability with negligible detection advantage.
{"title":"Deniably Information-Hiding Encryptions Secure against Adaptive Chosen Ciphertext Attack","authors":"Chong-zhi Gao, Dongqing Xie, Jin Li, Baodian Wei, Haibo Tian","doi":"10.1109/iNCoS.2012.88","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.88","url":null,"abstract":"The deniably information-hiding encryption (DIHE) is a type of deniable encryption which can hide an additional information in encrypting a normal message. Even if the sender or the receiver is coerced to show the plaintext and the random coins in the encryption, a DIHE scheme behaves like only an innocent message is encrypted. Because it protects privacy against malicious coercer, the DIHE scheme is very useful in communication systems such as the cloud storage system when the communication channel is eavesdropped by a coercer. Previous DIHE schemes only concern the security under the adversary's chosen plaintext attack (CPA). This paper proposes the first DIHE construction with deniability and indistinguishability against adaptive chosen cipher text attack (CCA) which is stronger than the CPA attack. Our construction is simple and easy to implement. Furthermore, it achieves simultaneous sender and receiver deniability with negligible detection advantage.","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":"121184162","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}
Noriyuki Suzuki, J. L. Zamora, S. Kashihara, S. Yamaguchi
This paper proposes the design of SOS Cast, an application that will assist the search for immobilized persons in a disaster area. When a catastrophic disaster such as an earthquake or tsunami occurs, people may be injured and trapped in damaged buildings and debris. Note that a prompt rescue operation during the first 72 hours is critical in saving many lives. However, it is difficult for immobilized persons to ask for help because conventional communication services such as cellular phone networks are quite likely to be severely damaged. In a particular affected area, the SOS Cast propagates SOS messages from immobilized persons through a direct communication between smart phones. By collecting these SOS messages, rescuers can estimate the locations of the immobilized persons and view it on their smart phones. We have shown in our preliminary experiment within a residential area that SOS Cast is capable of estimating the location of an immobilized person based on the collected SOS messages.
{"title":"SOSCast: Location Estimation of Immobilized Persons through SOS Message Propagation","authors":"Noriyuki Suzuki, J. L. Zamora, S. Kashihara, S. Yamaguchi","doi":"10.1109/iNCoS.2012.101","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.101","url":null,"abstract":"This paper proposes the design of SOS Cast, an application that will assist the search for immobilized persons in a disaster area. When a catastrophic disaster such as an earthquake or tsunami occurs, people may be injured and trapped in damaged buildings and debris. Note that a prompt rescue operation during the first 72 hours is critical in saving many lives. However, it is difficult for immobilized persons to ask for help because conventional communication services such as cellular phone networks are quite likely to be severely damaged. In a particular affected area, the SOS Cast propagates SOS messages from immobilized persons through a direct communication between smart phones. By collecting these SOS messages, rescuers can estimate the locations of the immobilized persons and view it on their smart phones. We have shown in our preliminary experiment within a residential area that SOS Cast is capable of estimating the location of an immobilized person based on the collected SOS messages.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"75 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":"114412963","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 overhead portion especially for a small packet is one of the most significant parameters that can lower the efficiency of the link utilization. Therefore, many traditional hop-by-hop header compression techniques were introduced to reduce the amount of packet header before transmission. However, those techniques still cannot overcome the time performance issue as compression mechanism requires longer processing time. In the time-sensitive applications such as VoIP, high network latency can lead to voice quality problems. To improve the time performance, instead of using hop-by-hop basis, the authors propose a new header compression mechanism which can be deployed in end-to-end nodes using the Software-Defined Network concept. This mechanism can reduce both packet size and time delay. This research will show the results of round-trip time between our end-to-end header compression mechanism, multiple hop-by-hop header compression mechanism, and normal IP routing algorithm.
{"title":"End-to-End Header Compression over Software-Defined Networks: A Low Latency Network Architecture","authors":"Supalerk Jivorasetkul, M. Shimamura, K. Iida","doi":"10.1109/iNCoS.2012.80","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.80","url":null,"abstract":"The overhead portion especially for a small packet is one of the most significant parameters that can lower the efficiency of the link utilization. Therefore, many traditional hop-by-hop header compression techniques were introduced to reduce the amount of packet header before transmission. However, those techniques still cannot overcome the time performance issue as compression mechanism requires longer processing time. In the time-sensitive applications such as VoIP, high network latency can lead to voice quality problems. To improve the time performance, instead of using hop-by-hop basis, the authors propose a new header compression mechanism which can be deployed in end-to-end nodes using the Software-Defined Network concept. This mechanism can reduce both packet size and time delay. This research will show the results of round-trip time between our end-to-end header compression mechanism, multiple hop-by-hop header compression mechanism, and normal IP routing algorithm.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"12 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":"126728323","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 work reports an image encoding scheme that distributes low-density parity-check (LDPC) encoding over a prime field of order q, GF(q), on a wireless sensor network (WSN). In the scheme, we divide the input data into several small parts, which are then distributed to multiple nodes to perform a LDPC encoding task in a cluster. We conducted extensive computational simulations to verify our method and found that the LDPC codes over GF(4) achieve a fair trade off between the bit error rate (BER) and power consumption criteria. As a result, the proposed scheme of using LDPC codes over GF(4) not only solves the energy balance problem by sharing processing tasks but also increases the data quality.
{"title":"Distributed Image Encoding Scheme Using LDPC Codes over GF(q) on Wireless Sensor Networks","authors":"P. N. Huu, Vinh Tran-Quang, T. Miyoshi","doi":"10.1109/iNCoS.2012.34","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.34","url":null,"abstract":"This work reports an image encoding scheme that distributes low-density parity-check (LDPC) encoding over a prime field of order q, GF(q), on a wireless sensor network (WSN). In the scheme, we divide the input data into several small parts, which are then distributed to multiple nodes to perform a LDPC encoding task in a cluster. We conducted extensive computational simulations to verify our method and found that the LDPC codes over GF(4) achieve a fair trade off between the bit error rate (BER) and power consumption criteria. As a result, the proposed scheme of using LDPC codes over GF(4) not only solves the energy balance problem by sharing processing tasks but also increases the data quality.","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":"127868446","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}
New and powerful hardware like Kinect introduces the possibility of changing biomechanics paradigm, usually based on expensive and complex equipment. Kinect is a markerless and cheap technology recently introduced from videogame industry. In this work we conduct a comparison study of the precision in the computation of joint angles between Kinect and an optical motion capture professional system. We obtain a range of disparity that guaranties enough precision for most of the clinical rehabilitation treatments prescribed nowadays for patients. This way, an easy and cheap validation of these treatments can be obtained automatically, ensuring a better quality control process for the patient's rehabilitation.
{"title":"Biomechanical Validation of Upper-Body and Lower-Body Joint Movements of Kinect Motion Capture Data for Rehabilitation Treatments","authors":"A. Fernández-Baena, A. Susín, Xavier Lligadas","doi":"10.1109/iNCoS.2012.66","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.66","url":null,"abstract":"New and powerful hardware like Kinect introduces the possibility of changing biomechanics paradigm, usually based on expensive and complex equipment. Kinect is a markerless and cheap technology recently introduced from videogame industry. In this work we conduct a comparison study of the precision in the computation of joint angles between Kinect and an optical motion capture professional system. We obtain a range of disparity that guaranties enough precision for most of the clinical rehabilitation treatments prescribed nowadays for patients. This way, an easy and cheap validation of these treatments can be obtained automatically, ensuring a better quality control process for the patient's rehabilitation.","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":"133624695","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
扫码关注我们
求助内容：
应助结果提醒方式：