page
Submitted by Katie Dey on Sun, 10/21/2012 - 6:27pm
ABSTRACT
We initiate a study of the security of cryptographic primitives in the presence of efficient tampering attacks to the randomness of honest parties. More precisely, we consider p-tampering attackers that may tamper with each bit of the honest parties' random tape with probability p, but have to do so
in an "online" fashion. We present both positive and negative results: