We give the first construction of a practical threshold pseudorandom function. The protocol for evaluating the function is efficient enough that it can be used to replace random oracles in some protocols relying on such oracles. In particular, we show how to transform the efficient cryptographically secure Byzantine agreement protocol by Cachin, Kursawe and Shoup for the random oracle model int...

In this paper, after reviewing the main points of image encryption and threshold function, we introduce the methods of chaotic image encryption based on pseudorandom bit padding that the bits be generated by the novel generalized threshold function (segmentation and selfsimilarity) methods. These methods decrease periodic effect of the ergodic dynamical systems in randomness of the chaotic imag...

Recently, we proposed a new threshold based penalty function. The threshold dynamically controls the penalty to infeasible solutions. This paper implants the two different forms of the proposed penalty function in the multiobjective evolutionary algorithm based on decomposition (MOEA/D) framework to solve constrained multiobjective optimization problems. This led to a new algorithm, denoted by ...

The procedures of Donoho, Johnstone, Kerkyacharian and Picard DJKP] estimate functions by inverting thresholded wavelet transform coeecients of the data. The choice of threshold is crucial to the success of the method and is currently subject to an intense research eeort. We describe how we have applied the statistical technique of cross-validation to choose a threshold and we present results t...

Buffer space in packet switching nodes is an important network resource. Shared buffer switches are prone to high packet losses and unfair use of buffer space. The use of a buffer management scheme is necessary to overcome these problems. This paper investigates the performance of Sigmoid Function Threshold scheme by means of simulations. This scheme regulates the usage of shared buffer space b...

Secret sharing is a cryptographic scheme that divides a secret key s to n participants with threshold t. Thus, assuring that no less than t shares can reconstruct the secret. The application of secret sharing also widens not only one group but several hierarchical structure. However, the group-based secret sharing proposed by Liu et al. in 2014 has some drawbacks, which are having an equal thre...

Experiments 1 and 2 compared, with a single-stimulus procedure, the discrimination of filled and empty intervals in both auditory and visual modalities. In Experiment 1, in which intervals were about 250 msec, the discrimination was superior with empty intervals in both modalities. In Experiment 2, with intervals lasting about 50 msec, empty intervals showed superior performance with visual sig...

SOME FACTORS INFLUENCING THE EFFECTIVE AUDITORY INTENSIVE DIFFERENCE LIMEN