{"title":"Research on Implementation of Elliptic Curve Cryptosystem in E-Commerce","authors":"Guicheng Shen, Xue-feng Zheng","doi":"10.1109/ISECS.2008.39","DOIUrl":"https://doi.org/10.1109/ISECS.2008.39","url":null,"abstract":"With the fast development of cryptography research and computer technology, the cryptosystems of RSA and Diffe-Hellman are getting more and more unsafe, and elliptic curve cryptosystem is becoming the trend of public cryptography in the future. This paper mainly uses object-oriented technology as tools, and divides elliptic curve cryptosystem into several layers, every of which corresponds a class. The properties and methods of these classes are discussed, and some methods are implemented. In the end, the advantages are analyzed, and the cryptosystem implemented with advanced programming language is easy to transplant.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121317486","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}
{"title":"Design Secure Contexts Detect Based on Lattice for Grid Computing Environment","authors":"Shuang Xiang, Mingdi Xu, Li Wang, Huanguo Zhang","doi":"10.1109/ISECS.2008.101","DOIUrl":"https://doi.org/10.1109/ISECS.2008.101","url":null,"abstract":"The open environment of grid computing raises new challenges for security. The dynamic contexts of systems could let processes run under uncertain states, and then might compromise system. At present, many theory models had been put forward for secure contexts detect. But high payload and special requirements let these models hard to be implemented. In this paper, we study security property for process in dynamic contexts which can be reconfigured at runtime in grid computing environment. We propose that context of process is secure when all subjects and objects visited from it satisfy lattice property. We also define a suitable equivalence relation among processes and puts forward security property based on lattice. We show that the novel security property is easily implemented on dedicated system.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128804123","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}
{"title":"Research and Application of Customer Churn Analysis in Chain Retail Industry","authors":"Chun-hua Ju, Feipeng Guo","doi":"10.1109/ISECS.2008.157","DOIUrl":"https://doi.org/10.1109/ISECS.2008.157","url":null,"abstract":"Due to easily-correlated and multi-index of indicative attributes in churn data on chain retail industry, prediction model based on support vector machine (SVM) was set up. Principal component analysis (PCA) can realize dimension reduction and eliminate redundant information, make the sample space for SVM more compact and reasonable. In this paper, PCA was adapted firstly to process 31 dimensional feature vectors of customer churn data, then with the application and verification in real chain retail data set, it was demonstrated that this model based on PCA and SVM has a better performance than the prediction based on SVM only and others.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115713740","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}
{"title":"Approach to Missing Data Recovery","authors":"E. Xu, Shaocheng Tong, Y. Wang, Shang Xu, Peng Li","doi":"10.1109/ISECS.2008.79","DOIUrl":"https://doi.org/10.1109/ISECS.2008.79","url":null,"abstract":"In order to recover the missing data in an information system, the paper proposed a new approach based on rough set to reduce the redundant attributes, discretize the continuous attributes and fill in the missing data. According to indiscernible relationship, discernible vector were defined and used the discernible vector addition rule to reduce attributes. And then, depending on the concept of super-club data and entropy of the information table, discretization of the continuous attributes was implemented. Finally, by use of the corresponding relationship of condition attributes and decision attributes, the definition of interval value and interval value addition rule were defined and filled up the incomplete data. The illustration and experimental results indicate that the approach is effective and efficient.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"286 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116234836","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}
{"title":"Test Case Reduction Technique for BPEL-based Testing","authors":"Wenli Dong","doi":"10.1109/ISECS.2008.194","DOIUrl":"https://doi.org/10.1109/ISECS.2008.194","url":null,"abstract":"Testing is necessary for evaluating the functional correctness, performance and reliability. The BPEL-based Web service composition having a large number of input parameters and the assigned values of individual parameters, the number of corresponding combination of input parameters is huge. A method needs to be established in order to limit the number of test cases and reduce space- and time-consuming. A reduction technique based on pair-wise combination of input parameters is presented in this paper. Relationship between BPEL (Business Process Execution Language) concepts and HPN (high-level Petri nets) is analyzed. After translation, the equivalent HPN of the Web service composition based on BPEL can be verified on existing mature tool according to the steps to reduce the size of test suite discussed in this paper. The method base on above technique can efficiently limit the number of test cases and reduce space- and time-consuming in theory and in practice.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114696055","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}
{"title":"Histogram Specification-based Audio Watermarking Technology against Filtering Attacks in Time Domain","authors":"Xiaoming Zhang, Xiong Yin, Zhaoyang Yu","doi":"10.1109/ISECS.2008.161","DOIUrl":"https://doi.org/10.1109/ISECS.2008.161","url":null,"abstract":"Filtering processing is a kind of typical and serious attack on the audio watermarking algorithm. Based on the computation in time domain before and after attacking on the audio, the mean and the standard deviation show good invariant statistical feature. The relation of four consecutive bins in a histogram can keep the change within plusmn5%. A data range selection approach, which meets the demands of normal distribution, is created generally for the watermark hiding. Based on segmenting idea, an audio watermarking algorithm is designed with statistical features by the stable relation of four consecutive bins. Experimental results show that the algorithm can resist on the attack of low pass filtering with large hiding bandwidth up to 17 bit/s. It shows much better than the existed histogram approach with relations of three consecutive bins.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127543169","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}
{"title":"Hindrances to the Development of Tourism E-Commerce in China","authors":"Lixia Yang, Xun Liu, Changyong Xu","doi":"10.1109/ISECS.2008.99","DOIUrl":"https://doi.org/10.1109/ISECS.2008.99","url":null,"abstract":"E-business has developed quickly in China and China is rich in tourism resources. Compared with other countries, however, the development of tourism e-commerce in China has not developed as well as people had expected. It is worth considering what hinders its development? This paper mainly discusses the hindrances to the development of tourism e-commerce from two aspects. One is analyzed from technical hindrance, namely, incomplete searching of information, similar business model, unclear profit outlook and lack of the main tourism business to support; the other from legal hindrance, such as lower transaction security and lack of credit. And finally three pieces of developing strategies are put forward.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126626542","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}
Yejiang Zhang, Zhitang Li, ZhengBin Hu, Hao Tu, Huaiqing Lin
{"title":"A P2P E-commerce Related Network Security Issue: P2P Worm","authors":"Yejiang Zhang, Zhitang Li, ZhengBin Hu, Hao Tu, Huaiqing Lin","doi":"10.1109/ISECS.2008.187","DOIUrl":"https://doi.org/10.1109/ISECS.2008.187","url":null,"abstract":"Being a novel P2P system, P2P E-commerce faces all network security issues as ordinary P2P systems do. One of the most severe threats is the imminent worm attacks aiming at P2P systems. Simple definition and taxonomy of P2P worm are presented and characteristics of different types of P2P worm are discussed. The possibility of using P2P system to contain P2P worm is explored, and preliminary countermeasures are proposed. Studying P2P worm will help to prevent P2P E-commerce from leaking sensitive business information, and make P2P E-commerce more robust and resilient.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124343856","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}
{"title":"Cash Management and Its Risk Control under No-Stationary Uncertain Demand","authors":"L. Bin, Cui Wentian, Xing Chunlin","doi":"10.1109/ISECS.2008.87","DOIUrl":"https://doi.org/10.1109/ISECS.2008.87","url":null,"abstract":"This paper considers the cash balance problem with non-stationary uncertain demand. Online algorithm with risk-reward is used by decision-makers who employ base stock policy. In the online model, the manager could not describe probability distribution but knew exactly the lower bound and upper bound of future demand. We design online risk strategy in terms of forecasting, and measured the reward of online risk strategy by comparing its performance with that of optimal deterministic online algorithm when forecasting is successful. We also proposed a set of online risk strategy whose risk was restricted to a tolerance level by designing the upper bound and range of forecasting while forecasting isn't successful. The online strategy gains reward if successful, the risk is acceptable if unsuccessful. The decision-makers can design an online strategy to improve performance in the light of his risk tolerance level.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121890515","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}
{"title":"An XML based Flexible Security E-Commerce Mode","authors":"Sheng Chai, Yang Cheng, Jifan Qiu, Wei Zhou","doi":"10.1109/ISECS.2008.201","DOIUrl":"https://doi.org/10.1109/ISECS.2008.201","url":null,"abstract":"This paper proposes a XML security E-commerce mode, which deals with the security problems of data transmission in E-commerce. Comparing with the traditional methods, the new mode can operate any parts of the data documents according to userspsila desires, and to encrypt and authenticate in arbitrary sequences. For its high flexibility, the new mode is able to satisfy the complex requirements of data transmission in E-commerce well.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123302885","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}