An accumulator based on bilinear pairings was proposed at CT-RSA’05. In this paper, we first demonstrate that the security model proposed by Lan Nguyen does lead to a cryptographic accumulator which is not collision resistant. Second we show that we can provide collision-resistance by updating the adversary model appropriately. Finally, we propose an improvement on Nguyen’s identity escrow sche...

A dynamic universal accumulator is an accumulator that allows one to efficiently compute both membership and nonmembership witnesses in a dynamic way. It was first defined and instantiated by Li et al., based on the Strong RSA problem, building on the dynamic accumulator of Camenisch and Lysyanskaya. We revisit their construction and show that it does not provide efficient witness computation i...

The computational architecture that enables the flexible coupling between otherwise independent eye and hand effector systems is not understood. By using a drift diffusion framework, in which variability of the reaction time (RT) distribution scales with mean RT, we tested the ability of a common stochastic accumulator to explain eye-hand coordination. Using a combination of behavior, computati...

A new architecture for decimating finite impulse response filters is proposed. The architecture is based on using a number of accumulators; each one accumulates a partial sum corresponding to a unique set of D filter coefficients into the filter output, where D is the decimation factor. In the new decimating filter, the accumulated result of an accumulator is passed to another accumulator once ...

The rotary compressor accumulator with pre-charged oil has already been developed and the concept published.[I] Compared to the conventional accumulator, the new accumulator differentiates itself from the conventional one in that the new accumulator is pre-charged with a pre-determined amount of oil. It offers advantages as a conventional accumulator attached to rotary compressor. This paper no...

An accumulator scheme, introduced be Benaloh and de Mare [BdM94] and further studied by Barić and Pfitzmann [BP97], is an algorithm that allows to hash a large set of inputs into one short value, called the accumulator, such that there is a short witness that a given input was incorporated into the accumulator. We put forward the notion of dynamic accumulators, i.e., a method that allows to dyn...

Accumulator models have a relatively long history of application to choice and response time, especially for binary choice. When the number of response options is greater than two, these models usually posit one accumulator per response option. Here, we propose a theoretical framework in which there is one accumulator for every ordered pairwise difference between choices, each quantifying the e...

Focusing on the low energy-storage efficiency and unstable energy output of existing accumulators, this paper proposes a novel constant-pressure elastic-strain accumulator based rubber material hyperelastic effect. The proposed can store release at constant pressure. Based exergy analysis method, charging/discharging storage was analyzed. Then, Mullins effect airbag over multiple cycles studied...

This is the second of two papers comparing connectionist and traditional stochastic latency mechanisms with respect to their ability to account for simple judgments. In the first, we reviewed evidence for a self-regulating accumulator module for twoand three-category discrimination. In this paper, we examine established neural network models that have been applied to predicting response time me...