Login / Signup
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch.
Ueli M. Maurer
Stefano Tessaro
Published in:
TCC (2010)
Keyphrases
</>
encryption scheme
dynamic programming
access control
network security
mathematical programming
databases
statistical databases
computer security
genetic algorithm
relational databases
intrusion detection
information security
computationally tractable
security level