A privacy preserving e-payment scheme

Secure electronic payment is an integral part of e-commerce. The e-payment systems in current use require the revealing of the purchaser’s payment information to the seller, while purchasers are not always happy to subject the details of their payment information to possible misuse by sellers. As a result, the uptake of e-commerce is hampered from reaching its full potential. In this paper, we propose an online payment scheme which uses the traditional e-payment infrastructure but which reveals no payment information to the seller. This is done with only an incremental increase in computational power.

Evolution of cooperation in reputation system by group-based scheme

Reputation systems are very useful in large online communities in which users may frequently have the opportunity to interact with users with whom they have no prior experience. Recently, how to enhance the cooperative behaviors in the reputation system has become to one of the key open issues. Emerging schemes focused on developing efficient reward and punishment mechanisms or capturing the social or economic properties of participants. However, whether this kind of method can work widely or not has been hard to prove until now. Research in evolutionary game theory shows that group selection (or multilevel selection) can favor the cooperative behavior in the finite population. Furthermore, some recent works give fundamental conditions for the evolution of cooperation by group selection. In the paper, we extend the original group selection theory and propose a group-based scheme to enhance cooperation for online reputation systems. Related concepts are defined to capture the social structure and ties among participants in reputation system, e.g., group, assortativity, etc. Also, we use a Fermi distribution function to reflect the bounded rationality of participants and the existence of stochastic factors in evolutionary process. Extended simulations show that our scheme can enhance cooperation and improve the average performance of participants (e.g. payoff) in reputation system.

Was monochloramine responsible for widespread lettuce crop failures at a major recycled water irrigation scheme?

In 2008, vegetable growers observed stunted lettuce plants showing signs of chlorosis and wilting. It was suspected that monochloramine in the recycled water used for irrigation, in combination with extreme environmental conditions (high irrigation water salinity and extreme heat), was responsible for these crop failures. A series of glasshouse studies was conducted to evaluate the impact of monochloramine concentration alone on iceberg lettuce seedlings, as well as in combination with high salinity and hot ambient temperatures. Monochloramine concentrations up to 9 and 15 mg L−1 Cl2 for continuous and initial irrigation only, respectively, did not affect the weight of iceberg lettuce heads (p > 0.05), while the combination of monochloramine (4–5 mg L−1 Cl2) and salinity (3,500 μS cm−1) did not significantly affect harvest measurements (p > 0.05). We therefore conclude that it is unlikely that monochloramine was responsible for the observed crop failures.

A dynamical deterministic packet marking scheme for DDoS traceback

DDoS attack source traceback is an open and challenging problem. Deterministic packet marking (DPM) is a simple and relatively effective traceback scheme among the available traceback methods. However, the existing DPM schemes inheret a critical drawback of scalability in tracing all possible attack sources, which roots at their static mark encoding and attempt to mark all Internet routers for their traceback purpose. We find that a DDoS attack session usually involves a limited number of attack sources, e.g. at the thousand level. In order to achieve the traceback goal, we only need to mark these attack related routers. We therefore propose a novel Marking on Demand (MOD) scheme based on the DPM mechanism to dynamical distribute marking IDs in both temporal and space dimensions. The proposed MOD scheme can traceback to all possible sources of DDoS attacks, which is not possible for the existing DPM schemes. We thoroughly compare the proposed MOD scheme with two dominant DPM schemes through theoretical analysis and experiments. The the results demonstrate that the MOD scheme outperforms the existing DPM schemes. © 2013 IEEE.