9 search results - page 2 / 2 » A Functional Rephrasing of the Assumption Commitment Specifi... |
TCC
2009
Springer
14 years 7 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
TCC
2009
Springer
14 years 7 months ago
2009
Springer
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
TC
2002
13 years 6 months ago
2002
Abstract--Mobile systems increasingly are being used for production-grade datacentered applications which require system support for transactional properties. For mobile applicatio...
CORR
2002
Springer
13 years 6 months ago
2002
Springer
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...