A new k-out-of-n oblivious transfer protocol is presented in this paper. The communication cost of our scheme are n+1 messages of sender to receiver and k messages from the receiver to sender. To the best knowledge of the authors, the communication complexity of our scheme is the least. Also, our scheme has a lower computation cost with (k+1)n modular exponentiations for sender and 3k modular e...

Audio cryptography is same like a visual cryptography. A plain data (audio file) is split into two or more shares. Each single share does not convey any meaning but when shares are combined together they will reveal the original data. In Audio cryptography the "plaintext" is an audio File. k out of n Nonbinary Audio Cryptography scheme is a special type of secret sharing scheme which is more se...

REFERENCES A. Mahmood and E. J . McCluskey, “Concurrent error detection using watchdog processorA survey,” IEEE Trans. Cornput., vol. C-37, no. 2, pp. 160-174, Feb. 1988. M. Schuette and J . Shen, “Processor control flow monitoring using signatured instruction streams,” IEEE Trans. Cornput., vol. C-36, no. 3 , pp. 264-276, Mar. 1987. N. R. Saxena and E. J. McCluskey, “Extended precision checksu...

Abs t r a c t . A consecutive k-out-of-n system consists of n linearly or cyclically ordered components such that the system fails if and only if at least k consecutive components fail. In this paper we consider a maintained system where each component is repaired independently of the others according to an exponential distribution. Assuming general lifetime distributions for system's component...

We generalize a multistage procedure for parallel gatekeeping to what we refer to as k-out-of-n gatekeeping in which at least k out of n hypotheses ( 1 ⩽ k ⩽ n) in a gatekeeper family must be rejected in order to test the hypotheses in the following family. This gatekeeping restriction arises in certain types of clinical trials; for example, in rheumatoid arthritis trials, it is required that e...

Two non-interactive three parties k out of n oblivious transfer protocols k n OT (where 0<k<n) from bilinear pairings are proposed in this paper. In these protocols, a sender can obliviously transfer n messages to a receiver without communication with him/her. The public keys that a sender used to encrypt his/her messages are made by a third party. The receiver can extract k out of n messages a...

The k-out-of-n configuration is a widely adopted structure for partially redundant safety systems. This configuration ensures a high level of reliability and safety with limited financial and space resources. It also facilitates on-line Test and Maintenance (T&M) without having to shut the system down. One question a decision maker needs to answer when adopting k-out-of-n systems is: what is th...

We consider a k-out-of-n system with repair under T -policy. Life time of each component is exponentially distributed with parameter λ. Server is called to the system after the elapse of T time units since his departure after completion of repair of all failed units in the previous cycle or until accumulation of n−k failed units, whichever occurs first. Service time is assumed to be exponential...