9 search results - page 2 / 2 » Efficient pseudorandom functions from the decisional linear ... |
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...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
IEICET
2006
13 years 7 months ago
2006
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
ICML
2007
IEEE
14 years 7 months ago
2007
IEEE
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...