Abheek Anand

Learn More
We present low-overhead protocols for disseminating streaming data in an interimistic environment in which the availability of computers, networks, and other resources is very unpredictable. An important example of such an environment is the state of computing and communication resources immediately following a natural disaster or a similar disruptive(More)
In previous lectures, we constructed public-key encryption schemes which were provably secure against non-adaptive chosen-ciphertext (CCA-1) attacks, and also adaptive chosenciphertext (CCA-2) attacks. However, both constructions used generic non-interactive zeroknowledge proof systems which — although poly-time — are not very efficient (as we will see(More)
In the previous lecture, we introduced the notion of message authentication: Given message m ∈ q , to authenticate it pick two random secrets a, b ∈ q and output (m,am + b). The possibility of an attacker outputting (m′, t′) such that (m′ 6= m) and (t = am′ + b) is at most 1/q. The security of this message authentication protocol is information-theoretic(More)
  • 1