| Friday 19 April 2024 | |
| Events for day: Sunday 30 January 2022 |
| 16:00 - 17:00 Mathematics Colloquium Targeted Attacks on Coin Tossing Protocols and Applications School MATHEMATICS Suppose n algorithms adaptively choose n pieces of an input (x1,...xn)=X one by one from some predefined distributions, and that Pr[f(X)=1]=p for a (known) Boolean function f. This defines a coin-tossing protocol with coin bias p. Now suppose an adversary A who observes the protocol, as it proceeds, can replace up to k of the inputs. How much can such adversary A increase Pr[f(X)=1] in the two natural settings below. 1.The tampered messages are chosen at random. 2. A can choose the tampered messages at wish. I will survey what is known about the question above, with the focus on (2) while aiming for polynomial-time attacks. ... |