S. Nair, B. Popescu, C. Gamage, B. Crispo, A. Tanenbaum
{"title":"Enabling DRM-preserving digital content redistribution","authors":"S. Nair, B. Popescu, C. Gamage, B. Crispo, A. Tanenbaum","doi":"10.1109/ICECT.2005.43","DOIUrl":"https://doi.org/10.1109/ICECT.2005.43","url":null,"abstract":"Traditionally, the process of online digital content distribution has involved a limited number of centralised distributors selling protected contents and licenses authorising the use of these contents, to consumers. In this paper, we extend this model by introducing a security scheme that enables DRM preserving digital content redistribution. Essentially consumers can not only buy the rights to use digital content but also the rights to redistribute it to other consumers in a DRM controlled fashion. We examine the threats associated with such a redistribution model and explain how our scheme addresses them.","PeriodicalId":312957,"journal":{"name":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128972631","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":"Synchronization among activities in a workflow using extended workflow Petri nets","authors":"Y. Kotb, E. Badreddin","doi":"10.1109/ICECT.2005.89","DOIUrl":"https://doi.org/10.1109/ICECT.2005.89","url":null,"abstract":"To maximize throughput in workflow systems concurrency is required. On the other hand concurrency must be controlled especially in systems in which a set of tasks can not serve more than one activity at a time constituting a critical section. This paper introduces an extended workflow Petri net model to deal with synchronization among activities in workflows which include critical sections and which the validity of resource tokens is subject to real time constraints. The paper also addresses the soundness property of the proposed extended workflow Petri net.","PeriodicalId":312957,"journal":{"name":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133096528","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 of combinatorial auctions for allocation and procurement processes","authors":"M. Schwind","doi":"10.1109/ICECT.2005.36","DOIUrl":"https://doi.org/10.1109/ICECT.2005.36","url":null,"abstract":"The application of combinatorial auctions in procurement and allocation processes can help to achieve higher efficiency by taking the substitutionalities and complementarities of bundled goods valuation into consideration. The article describes criteria for the analysis, conceptualization and modeling of Web-based combinatorial procurement and allocation systems. The foundations of combinatorial auctions are illustrated, followed by a view on several procedural variants. A number of obstacles such as design and usage complexity which eliminate the advantages of the combinatorial auction (allocation efficiency, transaction cost savings, and fairness) are then discussed. Based on these insights a draft of a comprehensive decision framework for application-oriented combinatorial auctions is given in the third part. Auction designs developed within the presented decision framework have to be evaluated before going into industry deployment. The article therefore closes with a process model for the experimental and simulative verification of the planned auction design.","PeriodicalId":312957,"journal":{"name":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132217041","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":"Unicursal supply chain management for extending traceability from ordering to distribution and settlement","authors":"K. Hayashi, Reki Murakami","doi":"10.1109/ICECT.2005.101","DOIUrl":"https://doi.org/10.1109/ICECT.2005.101","url":null,"abstract":"This paper presents a novel concept called \"unicursal supply chain management\" and describes its application in the Japanese retail industry. This concept enables the tracing of orders throughout the long continuous supply chain from the processes of ordering to distribution and settlement. This paper describes techniques to realize two essential features that comprise the unicursal supply chain, i.e., a cross-segment supply chain and order revision tracing. The cross-segment supply chain is a concept used for modeling business transactions initiated by ordering and completed by delivery and settlement as a single chain without breaks. Both conventional EDIs and more advanced B2B standards support business transactions independently for each segment of ordering, distribution, and settlement. Order revision tracing is a concept for management of the order changes that often occur at the boundaries of the segments and that have made order tracing across segments difficult or sometimes impossible in the past. This paper further describes the application of this concept to a real supply chain. We developed an experimental system based on these techniques and demonstrated a unicursal supply chain for the Japanese retail industry.","PeriodicalId":312957,"journal":{"name":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","volume":"8 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120844325","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":"Secure efficient proxy blind signature schemes based DLP","authors":"Wang Shaobin, Hong Fan, Cui Guohua","doi":"10.1109/ICECT.2005.77","DOIUrl":"https://doi.org/10.1109/ICECT.2005.77","url":null,"abstract":"In a proxy blind signature scheme, the proxy signer is allowed to generate a blind signature on behalf of the original signer. The proxy blind signature scheme is useful in several applications such as e-voting, e-payment and mobile agent environments. This paper analyzed the security shortcoming of a proxy blind signature scheme which is proposed by Tan et al. Comparing with the weakness of the previous schemes, a new proxy blind signature scheme based discrete logarithm problem (DLP) is presented to overcome the insecurity. It is proved that this scheme is more secure and efficient than the previous schemes. As an instance, the applying of the schemes in electronic voting is describing.","PeriodicalId":312957,"journal":{"name":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127786088","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":"Truthful online auctions for pricing peer-to-peer services","authors":"Po-An Chen, Tyng-Ruey Chuang","doi":"10.1109/ICECT.2005.100","DOIUrl":"https://doi.org/10.1109/ICECT.2005.100","url":null,"abstract":"We consider truthful online auctions that aim at optimizing sellers' revenues, representing service contributors' satisfactions, as a general model for pricing peer-to-peer services under the assumption of individual service consumer's rationality. For services that are in unlimited supply, we design a randomized truthful online auction with guaranteed revenue based on a randomized truthful offline auction. It is shown that the expected revenue extracted by our truthful online auction over all random factors achieves a /spl Theta/ (1) approximation ratio relative to the optimal single-price revenue under some reasonable assumption about the input bids. Since a peer must serve others to earn sufficient revenue that can cover its payment for being served, we argue that our online truthful auctions can be suitable schemes for incentivizing peer nodes in peer-to-peer systems to share, and thereby addressing the \"free-rider\" problem in peer-to-peer service sharing.","PeriodicalId":312957,"journal":{"name":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","volume":"1960 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129362592","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}
Liangzhao Zeng, H. Lei, J. Jeng, Jen-Yao Chung, B. Benatallah
{"title":"Policy-driven exception-management for composite Web services","authors":"Liangzhao Zeng, H. Lei, J. Jeng, Jen-Yao Chung, B. Benatallah","doi":"10.1109/ICECT.2005.66","DOIUrl":"https://doi.org/10.1109/ICECT.2005.66","url":null,"abstract":"Process-based composition of Web services has recently gained significant momentum in the implementation of business processes. A critical and time-consuming part of business process development is the detection and handling of exceptions that may occur during process execution. In this paper, we introduce a novel, policy-driven approach to exception management, which substantially simplifies business process development. We advocate that exception management should be implemented in the system infrastructure. Using our exception management framework, developers define exception policies in a declarative manner. Before a business process is executed, the service composition middleware integrates the exception policies with normal business logic to generate an exception-aware process schema. We argue that our policy-driven approach significantly reduces the development time of business processes through its separation of the development of the business logic and the exception handling policies.","PeriodicalId":312957,"journal":{"name":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127007536","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":"Catalog-based purchasing: illustrating a quantitative approach to electronic commerce","authors":"B. Golany, O. Shmueli","doi":"10.1109/ICECT.2005.27","DOIUrl":"https://doi.org/10.1109/ICECT.2005.27","url":null,"abstract":"This paper describes a negotiation application where one of the parties has products and services as described by a catalog. In such an environment, the final deal must be based on actual entries in the catalog. However, negotiation can be performed, at least partially, on hypothetical entries. The method described herein is based on a general e-commerce framework that employs goal programming (GoP) models to describe deals (including constraints, preferences and tradeoffs) as well as for automating activities such as deal valuation, negotiations, auctions, etc.","PeriodicalId":312957,"journal":{"name":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125989135","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}