This paper studies the consignment contract with revenue sharing where the retailer offers two revenue share schemes between himself and his supplier from the viewpoint of inventory ownership: One is that the retailer...This paper studies the consignment contract with revenue sharing where the retailer offers two revenue share schemes between himself and his supplier from the viewpoint of inventory ownership: One is that the retailer takes charge of the unsold items,the other one is that the retailer returns the unsold items to the supplier at the end of the selling period,and the supplier disposes those overstockings.In each contract,the retailer deducts a percentage from the selling price for each sold item and transfers the balance to the supplier.The supplier solves a two-stage problem:She first chooses contract,then decides retail price and delivery quantity according to the terms of the contract chosen.With an iso-price-elastic demand model,the authors derive the retailer and suppliers’ optimal decisions for both schemes.In addition,the authors characterize how they are affected by disposing cost.The authors compare the decisions between the two schemes for disposing cost turn out to be holding cost or salvage value,respectively.The authors use numerical examples to show the supplier’s first-stage optimal decision depends critically on demand price elasticity,the disposing cost and the retailer’s share for channel cost.展开更多
∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the f...∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the following difficult problems 1-3 and to construct three ettlcient cryptographic protocols 4 6：1） How to construct a protocol for proving a secret integer to be a Blum integer with form PQ, where P, Q are two different primes and both -- 3（mod 4）;2） How to construct a protocol for proving a secret polynomial with exact degree t - 1 iil a （t, n）- threshold secret sharing scheme：3） How to construct witness indistinguishable and witness hiding protocol not from zero-knowledge proof;4） A publicly verifiable secret sharing scheme with information-theoretic security;5） A delegateable signature scheme under the existence of one-way permutations;6） Non-interactive universal designated verifier signature schemes.展开更多
基金supported by the National Natural Science Foundation of China under Grant Nos.70901029, 71171088,71131004 and 71002077the Fundamental Research Funds for the Universities under Grant No. 65010771
文摘This paper studies the consignment contract with revenue sharing where the retailer offers two revenue share schemes between himself and his supplier from the viewpoint of inventory ownership: One is that the retailer takes charge of the unsold items,the other one is that the retailer returns the unsold items to the supplier at the end of the selling period,and the supplier disposes those overstockings.In each contract,the retailer deducts a percentage from the selling price for each sold item and transfers the balance to the supplier.The supplier solves a two-stage problem:She first chooses contract,then decides retail price and delivery quantity according to the terms of the contract chosen.With an iso-price-elastic demand model,the authors derive the retailer and suppliers’ optimal decisions for both schemes.In addition,the authors characterize how they are affected by disposing cost.The authors compare the decisions between the two schemes for disposing cost turn out to be holding cost or salvage value,respectively.The authors use numerical examples to show the supplier’s first-stage optimal decision depends critically on demand price elasticity,the disposing cost and the retailer’s share for channel cost.
基金supported by the Foundation of tihe National Natural Science of China under Grant Nos 90604034 (Key Project), 10726012, 10871222, 10531040,and 10471156
文摘∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the following difficult problems 1-3 and to construct three ettlcient cryptographic protocols 4 6：1） How to construct a protocol for proving a secret integer to be a Blum integer with form PQ, where P, Q are two different primes and both -- 3（mod 4）;2） How to construct a protocol for proving a secret polynomial with exact degree t - 1 iil a （t, n）- threshold secret sharing scheme：3） How to construct witness indistinguishable and witness hiding protocol not from zero-knowledge proof;4） A publicly verifiable secret sharing scheme with information-theoretic security;5） A delegateable signature scheme under the existence of one-way permutations;6） Non-interactive universal designated verifier signature schemes.
