38 search results - page 4 / 8 » How to Build a Hash Function from Any Collision-Resistant Fu... |
COCO
2006
Springer
13 years 11 months ago
2006
Springer
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
ICFP
1999
ACM
13 years 11 months ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
TLDI
2009
ACM
14 years 4 months ago
2009
ACM
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of...