In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...

this study highlights the costs and benefits of indigenous beef cattle fattening schemes in shinyanga urban and kishapu districts in tanzania. specifically, in this study the net profit (np) for fatteners between beef cattle fattening schemes has been determined. the schemes were divided into two main categories, scheme 1 in which the animals were fed on cottonseed hulls (cshl) based diets and ...

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

conclusions this study indicates that low-load rt results in greater accumulations in vl compared to high-load rt over the course of 8 weeks of training. results after adjusting for the pre-test scores, there was a significant difference between the two intervention groups on post-intervention total vl with a very large effect size (f (1, 15) = 16.598, p = .001, ηp2 = .525). there was a signifi...

medicines constitute a substantial proportion of out-of-pocket (oop) expenses in indian households. in order to address this issue, the government of india launched the jan aushadhi (medicine for the masses) scheme (jas) to provide cheap generic medicines to the patients (http://janaushadhi.gov.in/about_jan_aushadhi.html). these medicines are provided through the jan aushadhi stores established...

In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...

Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which ...

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

sink location is considered as a basic service in geographic routing in wireless sensor networks. obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. in this paper, a sink location algorithm based on fano plane is proposed. the research challenge is how to ensure the intersection of two slq and sla rou...