XOR-based visual cryptography scheme with essential shadows

Visual cryptography scheme with essential shadows (EVCS) is of great significance since it provides different levels of the importance to shadows. In this paper, we propose a general construction method for (t, s, k, n)-VCS with essential shadows based on XOR operation ((t, s, k, n)-EXVCS), which originates from the partition of access structure. The secret image is encrypted into s essential shadows and n-s non-essential shadows. Any k shadows including at least t essentials can cooperate to decode the secret image and the decoding process is implemented by XOR operation on the involved shadows. Our scheme achieves perfectly reconstruction of secret image in the revealed image and the less size of shadows and revealed images. The experiments are conducted to testify the feasibility and practicability of the proposed scheme.     

Complete weight enumerators of a class of linear codes with two weights

In this paper, a class of $p$-ary linear codes with two weights is constructed by using the properties of cyclotomic classes of ${\mathbb{F}}_{p^2}^1$. The complete weight enumerators of these linear codes are also determined. In some cases, they are optimal and can be employed to obtain secret sharing schemes with interesting access structures and asymptotically optimal systematic authentication codes.     

An uncooperative order model for items with trade credit,inventory-dependent demand and limited displayed-shelf space

This paper considers a two-echelon supply chain where a supplier sells a single product through a retailer, who faces an inventory-dependent demand. The supplier hopes to incentive the retailer to order more items by offering trade credit. The retailer places the ordered items on the display shelf (DS) with limited space and stocks the remaining items (if any) that exceed the shelf capacity in his/her backroom/warehouse (BW). From the supplier’s perspective, we focus mainly on under which conditions the supplier should offer trade credit and how he/she should design such trade credit policy and corresponding ordering policy to obtain much more benefits. From the retailer’s perspective, we discuss whether the retailer needs BW and exactly how many items need to be stocked in BW when the supplier offers trade credit. We formulate a “supplier-Stackelberg” game model, from which we obtain the conditions under which the presented simple trade credit policy not only increases the overall chain profit but also each member’s profit. We also show that the trade credit policy is always more beneficial to the retailer than to the supplier if it is offered.     

Secure multicasting of images via joint privacy-preserving fingerprinting,decryption, and authentication

Joint fingerprinting and decryption (JFD) is useful in securing media transmission and distribution in a multicasting environment. Common drawbacks of the existing JFD methods are the transmitted data may leak the content of data, and a subscriber cannot determine if a received image is modified such that tampering attack can be mounted successfully. Here we focus on security and privacy of image multicasting and introduce a new framework called JFDA (joint privacy-preserving fingerprinting, decryption, and authentication). It has several main characteristics, JFDA: (1) accomplishes fingerprinting in the encryption domain to preserve privacy and prevent encrypted data from being tampered without additional hash code/digest, (2) prevents tampering attack on the decrypted data to ensure the fidelity of the fingerprinted data, (3) makes user subscribing to a visual media be an examiner to authenticate the same visual media over the Internet. The effectiveness of the proposed method is confirmed by experimental results.     

A Rational Secret Sharing Scheme Against Coalition Based on Nash Equilibrium and Neighbor＇s Strategy

In order to prevent any arbitrary subsets of coalition in rational secret sharing we propose a new one- way information transmission mechanism, every player in a rational secret sharing protocol only interacts with his around two players, which means his decision is strictly based on previous neighboring player＇s strategy. Combined with the punishment strategy of Maleka＇s scheme and pay- off distribution principle in Game Theory, our scheme is capable of achieving Nash equilibrium and has the feature of anti-coalition. For the conspirators, getting the secret at the same time or in less than necessary iteration rounds is almost impossible. Without repeated involvement of the dealer, our scheme has the features of verifiability, anti- coalition, and more meaningfully, superiority of approaching reality model by taking rational behavior into consid-eration.     

数据业务市场演进的经济学分析

从数据业务的经济学内涵出发,比较国内外不同的市场特点，找出影响数据业务市场发展的最重要因素,井且从这些因素的变化推导出数据业务市场的演进路线．从而进一步提出政策和策略上的建议.     

日美贸易战的背后：——日本企业夺取美国市场面面观

分析了日本企业在进入 美国市场时采取的营销策略，归纳出了１０种常用的方式。     

电子商务———因特网上的新业务

基于电信基础设施笔电子化商务银行的电子商务将给传统的贸易和商务方式带来革命。本文介绍了电子商务的概念、特点、基础，以及安全因素和所涉及的关键技术，最后提出了中国电子商务解决方案和未来发展．     

An Authentication Scheme for Ad-hoc Networks using Threshold Secret Sharing

Ad-hoc networks are peer-to-peer self- organized networks that make possible the communication between nodes located in areas, where communication infrastructure is absent or difficult to implement. For such networks, security is a crucial issue, since the wireless medium is vulnerable to various attacks. A centralized solution can be easily compromised, leaving the nodes exposed to threats originating from malicious users. In this paper, a security design for Ad-hoc networks is proposed and studied, providing authentication to the nodes that follow the principles of threshold secret sharing.     

一种网络涉密信息系统的设计

文章分析了在网络中进行涉密信息系统建设的需求，提出了涉密信息系统设计的理念，给出了涉密信息系统各部分在网络中的工作机理、组件功能和工作过程。