Lower and Upper Bounds for Attacks on Authentication Protocols

@inproceedings{Stoller1999LowerAU,
  title={Lower and Upper Bounds for Attacks on Authentication Protocols},
  author={Scott D. Stoller},
  booktitle={PODC},
  year={1999}
}
Many authentication protocols are intended to work correctly in the presence of an adversary that can intercept messages, perform an unbounded number of encryptions and other operations while fabricating messages, and prompt honest principals to engage in an unbounded number of concurrent (i.e., interleaved) runs of the protocol. The amount of local state… CONTINUE READING