Sciweavers

22 search results - page 5 / 5
» icalp 1998
Sort
View
TCC
2009
Springer
117views Cryptology» more  TCC 2009»
14 years 5 months ago
Towards a Theory of Extractable Functions
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...
Ran Canetti, Ronny Ramzi Dakdouk
SIAMCOMP
1998
118views more  SIAMCOMP 1998»
13 years 4 months ago
Genericity, Randomness, and Polynomial-Time Approximations
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
Yongge Wang