Groundwater overuse and farm-level technical inefficiency : evidence from Sri Lanka

Extraction of groundwater for onion and other cash crop production has been increasing rapidly during the last two decades in the dry zone areas of Sri Lanka. As a result of overuse, the quantity of available groundwater is gradually declining, while water quality is deteriorating. The deteriorating water quality has a negative impact on agricultural production, especially for crops (such as onions) that are sensitive to increases in salinity levels. This issue is examined with respect to onion production in Sri Lanka. A stochastic frontier production function (SFPF) is used, in which technical efficiency and the determinants of inefficiencies are estimated simultaneously. The results show that farmers are overusing groundwater in their onion cultivation, which has resulted in decreasing yields. Factors contributing to inefficiency in production are also identified. The results have important policy implications.

The suffix-free-prefix-free hash function construction and its indifferentiability security analysis

In this paper, we observe that in the seminal work on indifferentiability analysis of iterated hash functions by Coron et al. and in subsequent works, the initial value (IV) of hash functions is fixed. In addition, these indifferentiability results do not depend on the Merkle–Damgård (MD) strengthening in the padding functionality of the hash functions. We propose a generic n -bit-iterated hash function framework based on an n -bit compression function called suffix-free-prefix-free (SFPF) that works for arbitrary IV s and does not possess MD strengthening. We formally prove that SFPF is indifferentiable from a random oracle (RO) when the compression function is viewed as a fixed input-length random oracle (FIL-RO). We show that some hash function constructions proposed in the literature fit in the SFPF framework while others that do not fit in this framework are not indifferentiable from a RO. We also show that the SFPF hash function framework with the provision of MD strengthening generalizes any n -bit-iterated hash function based on an n -bit compression function and with an n -bit chaining value that is proven indifferentiable from a RO.