Yinghui Zhang, Xiaofeng Chen, Jin Li, Hui Li, Fenghua Li
In attribute-based encryption (ABE) systems, the revocation issue is essential and difficult, since users may change their attributes frequently in practice and each attribute is conceivably shared by multiple users. To our knowledge, all the existing ABE schemes fail to support flexible and direct revocation due to the burdensome update of attribute secret keys and cipher texts. Aiming at tackling the challenge above, in this paper, we formalize the notion of cipher text policy ABE with flexible and direct revocation (FDR-CP-ABE), and give out a concrete construction, which supports direct attribute and user revocation and is applicable to the data sharing architecture. The proposed FDR-CP-ABE scheme outperforms the previous revocation-related methods in that it has constant-size cipher texts and only partial cipher texts need to be updated whenever revocation events occur. Furthermore, we show that our FDR-CP-ABE scheme is provably secure in the standard model and it cannot be achieved by trivial combinations of the techniques of CP-ABE and BE.
{"title":"FDR-ABE: Attribute-Based Encryption with Flexible and Direct Revocation","authors":"Yinghui Zhang, Xiaofeng Chen, Jin Li, Hui Li, Fenghua Li","doi":"10.1109/INCoS.2013.16","DOIUrl":"https://doi.org/10.1109/INCoS.2013.16","url":null,"abstract":"In attribute-based encryption (ABE) systems, the revocation issue is essential and difficult, since users may change their attributes frequently in practice and each attribute is conceivably shared by multiple users. To our knowledge, all the existing ABE schemes fail to support flexible and direct revocation due to the burdensome update of attribute secret keys and cipher texts. Aiming at tackling the challenge above, in this paper, we formalize the notion of cipher text policy ABE with flexible and direct revocation (FDR-CP-ABE), and give out a concrete construction, which supports direct attribute and user revocation and is applicable to the data sharing architecture. The proposed FDR-CP-ABE scheme outperforms the previous revocation-related methods in that it has constant-size cipher texts and only partial cipher texts need to be updated whenever revocation events occur. Furthermore, we show that our FDR-CP-ABE scheme is provably secure in the standard model and it cannot be achieved by trivial combinations of the techniques of CP-ABE and BE.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124845729","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 financial system, distributed terminal equipments generate huge mass of data that containing much valuable information. The integrated analysis of the distributed data combining with traditional information will reveal the potential business value and provide a brand new view. Based on the infrastructure of cloud computing service platform, propose a practical scheme of financial data processing which composing of data acquisition, processing, storage and analysis. Present the key technologies of data loading, migration, MapReduce processing, remote analysis and flashback, and describe the execution of these technologies within cloud computing framework.
{"title":"Research on Cloud Computing Based Data Processing for Financial Terminal Equipment","authors":"Zhou Zhi-zhao","doi":"10.1109/INCOS.2013.110","DOIUrl":"https://doi.org/10.1109/INCOS.2013.110","url":null,"abstract":"In financial system, distributed terminal equipments generate huge mass of data that containing much valuable information. The integrated analysis of the distributed data combining with traditional information will reveal the potential business value and provide a brand new view. Based on the infrastructure of cloud computing service platform, propose a practical scheme of financial data processing which composing of data acquisition, processing, storage and analysis. Present the key technologies of data loading, migration, MapReduce processing, remote analysis and flashback, and describe the execution of these technologies within cloud computing framework.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123307417","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}
Xiaoyuan Yang, Weidong Du, Xu An Wang, Liqiang Wang
Along with the development of the Internet, the traditional public key encryption system becomes insufficient for many newly emerging applications, such as the cloud services. Then the ABE is proposed to meet the urgent demands. The study on attribute-based encryption mainly concern on two issues: how to improve its expressibility and achieve stronger security. This paper has proposed a attribute-based encryption scheme that has good property in both two points: our scheme allows a user's private key to be expressed in non-monotonic access structures, and we prove its fully security in the standard model. Furthermore, the performance of our scheme is as efficient as the less expressive and selective security ones.
{"title":"Fully Secure Attribute-Based Encryption with Non-monotonic Access Structures","authors":"Xiaoyuan Yang, Weidong Du, Xu An Wang, Liqiang Wang","doi":"10.1109/INCoS.2013.98","DOIUrl":"https://doi.org/10.1109/INCoS.2013.98","url":null,"abstract":"Along with the development of the Internet, the traditional public key encryption system becomes insufficient for many newly emerging applications, such as the cloud services. Then the ABE is proposed to meet the urgent demands. The study on attribute-based encryption mainly concern on two issues: how to improve its expressibility and achieve stronger security. This paper has proposed a attribute-based encryption scheme that has good property in both two points: our scheme allows a user's private key to be expressed in non-monotonic access structures, and we prove its fully security in the standard model. Furthermore, the performance of our scheme is as efficient as the less expressive and selective security ones.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123412198","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}
M. Gaeta, F. Orciuoli, Pierluigi Ritrovato, Giuseppe D’aniello, A. D. Vivo
In recent years, merchants have increased their interest in marketing strategies based on loyalty programs. Coalition loyalty is one of the most profitable among the aforementioned strategies. This work proposes a co-operation model based on the principles of Collective Knowledge Systems and on Semantic Technologies to support the generation and management of dynamic coalitions of merchants. The main benefit of the proposed model is represented by the possibility, for merchants, to match their needs and define coalition programs (based on conditional coupon) without the involvement of mediators. Moreover, the model provides the capability of defining collaboratively and formally the aforementioned coupons that can be handled by means of technologies for payment and value added services. The proposed model is defined in the context of the TITAN Project aiming at defining an integrated service-oriented Software Platform enabling innovative business scenarios for e-money, e-payments and value added services.
{"title":"A Collective Knowledge System for Business Partner Co-operation","authors":"M. Gaeta, F. Orciuoli, Pierluigi Ritrovato, Giuseppe D’aniello, A. D. Vivo","doi":"10.1109/INCoS.2013.145","DOIUrl":"https://doi.org/10.1109/INCoS.2013.145","url":null,"abstract":"In recent years, merchants have increased their interest in marketing strategies based on loyalty programs. Coalition loyalty is one of the most profitable among the aforementioned strategies. This work proposes a co-operation model based on the principles of Collective Knowledge Systems and on Semantic Technologies to support the generation and management of dynamic coalitions of merchants. The main benefit of the proposed model is represented by the possibility, for merchants, to match their needs and define coalition programs (based on conditional coupon) without the involvement of mediators. Moreover, the model provides the capability of defining collaboratively and formally the aforementioned coupons that can be handled by means of technologies for payment and value added services. The proposed model is defined in the context of the TITAN Project aiming at defining an integrated service-oriented Software Platform enabling innovative business scenarios for e-money, e-payments and value added services.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116563901","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}
Inspired by Agrawal, Boneh and Boyen's identity-based encryption scheme, we proposed a post-quantum identity-based signature scheme from lattices. In this construction, two distinct trapdoors are used to find short bases. One trapdoor enables the real implementation to generate short bases for all lattices. The other trapdoor enables the simulator to generate short bases for all lattices. Moreover, the generating short bases are used to sample short vectors as signatures. Based on the hardness of the small integer solution (SIS) problem, the proposed scheme is proven to be strongly unforgeable against adaptive chosen-identity and adaptive chosen-message attacks without using random oracles. Compared with the existing strongly unforgeable identity-based signature schemes, our scheme has the advantages of full security and resistance to quantum computing attacks.
{"title":"Post-quantum Strongly Unforgeable Identity-Based Signature Scheme from Lattices without Random Oracles","authors":"Zhenhua Liu, Xiangsong Zhang, T. Takagi","doi":"10.1109/INCoS.2013.107","DOIUrl":"https://doi.org/10.1109/INCoS.2013.107","url":null,"abstract":"Inspired by Agrawal, Boneh and Boyen's identity-based encryption scheme, we proposed a post-quantum identity-based signature scheme from lattices. In this construction, two distinct trapdoors are used to find short bases. One trapdoor enables the real implementation to generate short bases for all lattices. The other trapdoor enables the simulator to generate short bases for all lattices. Moreover, the generating short bases are used to sample short vectors as signatures. Based on the hardness of the small integer solution (SIS) problem, the proposed scheme is proven to be strongly unforgeable against adaptive chosen-identity and adaptive chosen-message attacks without using random oracles. Compared with the existing strongly unforgeable identity-based signature schemes, our scheme has the advantages of full security and resistance to quantum computing attacks.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122091344","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}
Optimization of degree distribution of the joint network LDPC code for orthogonal multiple-access relay channel (MARC) is investigated in this paper. We first calculated the code capacity of the source-destination link of orthogonal MARC based on a Gaussian approximation, where two sources communicate with one destination in the presence of one relay. Then, a new generalized differential evolution algorithm is developed to iteratively improve the degree distribution of the joint network LDPC code. Simulation results show that, the gap between bit error rate (BER) performance of our designed codes and the decoding threshold is about 0.4dB, and that between the capacity limit and decoding threshold is less than 0.7dB at BER = 10-6.
{"title":"Optimal Design of the Joint Network LDPC Codes for Half-Duplex Cooperative Multi-access Relay Channel","authors":"Jingyi Wang, S. Che, Y. Li, Junlong Wang","doi":"10.1109/INCoS.2013.116","DOIUrl":"https://doi.org/10.1109/INCoS.2013.116","url":null,"abstract":"Optimization of degree distribution of the joint network LDPC code for orthogonal multiple-access relay channel (MARC) is investigated in this paper. We first calculated the code capacity of the source-destination link of orthogonal MARC based on a Gaussian approximation, where two sources communicate with one destination in the presence of one relay. Then, a new generalized differential evolution algorithm is developed to iteratively improve the degree distribution of the joint network LDPC code. Simulation results show that, the gap between bit error rate (BER) performance of our designed codes and the decoding threshold is about 0.4dB, and that between the capacity limit and decoding threshold is less than 0.7dB at BER = 10-6.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128296827","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 recent years Trust Management has become a main method to ensure the security of vehicular ad-hoc networks (VANETs). However, most of the existing trust establishment approaches cannot handle the rapidly changing environment of VANET appropriately. In this paper, we propose a Reputation-based Global Trust Establishment scheme (RGTEs). The scheme introduces a solution to share the trust information in VANET safely by applying statistical laws, which makes it more efficient and accurate to establish trust in rapidly changing environment. Moreover, we detect a bad node by dynamic threshold according to real-time reputation status of the network. Analysis shows that RGTEs is more effective in confidence-building, security assurance and adaptability.
{"title":"RGTE: A Reputation-Based Global Trust Establishment in VANETs","authors":"Xiaoqing Li, Jicheng Liu, Xuejun Li, Wei-dong Sun","doi":"10.1109/INCoS.2013.91","DOIUrl":"https://doi.org/10.1109/INCoS.2013.91","url":null,"abstract":"In recent years Trust Management has become a main method to ensure the security of vehicular ad-hoc networks (VANETs). However, most of the existing trust establishment approaches cannot handle the rapidly changing environment of VANET appropriately. In this paper, we propose a Reputation-based Global Trust Establishment scheme (RGTEs). The scheme introduces a solution to share the trust information in VANET safely by applying statistical laws, which makes it more efficient and accurate to establish trust in rapidly changing environment. Moreover, we detect a bad node by dynamic threshold according to real-time reputation status of the network. Analysis shows that RGTEs is more effective in confidence-building, security assurance and adaptability.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128485296","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 design a proxy signature in the setting of leakage-resilient cryptography for the first time. Our motivation is that the proxy signatures are often used in scenarios where the signing is done in an insecure environment, e.g., the proxy key is stored in a device which is not secure enough example of IC card. In such setting, an adversary who can launch side-channel attacks may detect some leakage information about the proxy key. The traditional security models of the proxy signatures cannot provide such security. Hence we extend them to the leakage-resilient setting, and also give a concrete construction which conforms to the extended security model.
{"title":"Leakage-Resilient Proxy Signatures","authors":"Fei Tang, Hongda Li, Qihua Niu, Bei Liang","doi":"10.1109/INCoS.2013.94","DOIUrl":"https://doi.org/10.1109/INCoS.2013.94","url":null,"abstract":"We design a proxy signature in the setting of leakage-resilient cryptography for the first time. Our motivation is that the proxy signatures are often used in scenarios where the signing is done in an insecure environment, e.g., the proxy key is stored in a device which is not secure enough example of IC card. In such setting, an adversary who can launch side-channel attacks may detect some leakage information about the proxy key. The traditional security models of the proxy signatures cannot provide such security. Hence we extend them to the leakage-resilient setting, and also give a concrete construction which conforms to the extended security model.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121386367","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}
Complete fairness means that either all parties learn the output of the function or none of them does. It was deemed as an impossible task in general in secure two party computation by Cleve (STOC 1986). However, a seminal result of complete fairness between two parties was achieved by Gordorn et al. (STOC 2008). Recently Groce and Katz (Euro crypt 2012) corrected the insufficient assumptions and gave some positive results of fairness. Here we revisit this problem and introduce the Tit-for-Tat (TFT) strategy into rational two-party computation. To the best of our knowledge, it is the first secure two-party computation protocol with constant rounds that allows both parties to know the terminal round.
{"title":"Fair Computation with Tit-for-Tat Strategy","authors":"Yilei Wang, Qiuliang Xu, Zhe Liu","doi":"10.1109/INCoS.2013.55","DOIUrl":"https://doi.org/10.1109/INCoS.2013.55","url":null,"abstract":"Complete fairness means that either all parties learn the output of the function or none of them does. It was deemed as an impossible task in general in secure two party computation by Cleve (STOC 1986). However, a seminal result of complete fairness between two parties was achieved by Gordorn et al. (STOC 2008). Recently Groce and Katz (Euro crypt 2012) corrected the insufficient assumptions and gave some positive results of fairness. Here we revisit this problem and introduce the Tit-for-Tat (TFT) strategy into rational two-party computation. To the best of our knowledge, it is the first secure two-party computation protocol with constant rounds that allows both parties to know the terminal round.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"50 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134111791","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 order to conduct fine-grained network management in mobile network, Traffic Classification or Detection is widely used to divide network traffic into different classes, according to their source applications. Many techniques are exploited in Traffic Classification. Among them, machine learning has grown considerably attention because of its accuracy. Feature selection chooses feature combinations for machine learning algorithms, and has significant influence on the accuracy and efficiency. To discover optimal features, all possible combinations need to be evaluated by testing real classifiers. With numerous features, feature selection can cost an abundance of time and computational resources. This paper proposes a feature selection algorithm for C4.5 Decision Tree. This algorithm utilizes structural characteristics of C4.5 algorithm to exclude some of the combinations without actually testing the classifiers. The simulation results demonstrate that the algorithm can reduce the number of tests in seeking the optimal feature combination.
{"title":"RangeTree: A Feature Selection Algorithm for C4.5 Decision Tree","authors":"Hui Zhu, Siyu Chen, L. Zhu, Hui Li, Xiaofeng Chen","doi":"10.1109/INCoS.2013.13","DOIUrl":"https://doi.org/10.1109/INCoS.2013.13","url":null,"abstract":"In order to conduct fine-grained network management in mobile network, Traffic Classification or Detection is widely used to divide network traffic into different classes, according to their source applications. Many techniques are exploited in Traffic Classification. Among them, machine learning has grown considerably attention because of its accuracy. Feature selection chooses feature combinations for machine learning algorithms, and has significant influence on the accuracy and efficiency. To discover optimal features, all possible combinations need to be evaluated by testing real classifiers. With numerous features, feature selection can cost an abundance of time and computational resources. This paper proposes a feature selection algorithm for C4.5 Decision Tree. This algorithm utilizes structural characteristics of C4.5 algorithm to exclude some of the combinations without actually testing the classifiers. The simulation results demonstrate that the algorithm can reduce the number of tests in seeking the optimal feature combination.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"338 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131507511","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
扫码关注我们
求助内容：
应助结果提醒方式：