87 search results - page 14 / 18 » A Verifiable Random Function with Short Proofs and Keys |
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
114
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
ECCC
2006
14 years 9 months ago
2006
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
WINET
2010
14 years 8 months ago
2010
This paper proposes a secure encrypted-data aggregation scheme for wireless sensor networks. Our design for data aggregation eliminates redundant sensor readings without using encr...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...