Tackling Adaptive Corruptions in Multicast Encryption Protocols

@inproceedings{Panjwani2007TacklingAC,
  title={Tackling Adaptive Corruptions in Multicast Encryption Protocols},
  author={Saurabh Panjwani},
  booktitle={TCC},
  year={2007}
}
We prove a computational soundness theorem for symmetrickey encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversaries who corrupt protocol participants during protocol execution). Our soundness theorem shows that if the encryption scheme used in the protocol is semantically secure, and encryption cycles are absent, then security against adaptive corruptions is achievable via a reduction factor of O(n · (2n)), with n and l being… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS