Reading some questions in this forum I encountered this answer mentioning IND-CPA as a requirement for ciphers. It got me thinking about this paper I recently read, where a formal model of the Honest-But-Curious adversary is given, in order to automate the analysis of whether certain protocol has the indistinguishability property. And I have this way realized I am missing a piece in the puzzle.

As far as I remember, in a Cryptographic System, we have:

Attacks like

  • Ciphertext-only (Passive Attack)
  • Known Plaintext Attack (Passive Attack)
  • Chosen Plaintext Attack (CPA)
  • Chosen Ciphertext Attack (CCA)

And Notions of Security like

  • Semantic Security (SS, SEM)
  • Indistinguishability Security (IND)
  • Non-malleability (NM)

And for stating the notions preserved under certain attacks we end up with combinations like the well known IND-CPA.

Now, how do adversarial models like Dolev-Yao, Honest-But-Curious or Byzantine fit in this scheme? ( If they do at all and I am not mixing up things)

Thank you!

closed as off-topic by Mike Ounsworth, John Deters, Steffen Ullrich, Matthew, Serge Ballesta Aug 24 '17 at 8:46

  • This question does not appear to be about Information security within the scope defined in the help center.
If this question can be reworded to fit the rules in the help center, please edit the question.

  • I'm voting to move this to crypto.se as you're likely to get a better, or at least more formal, answer there. Great question by the way. – Mike Ounsworth Aug 24 '17 at 2:53
  • I agree on both counts. Belongs in crypto. – Sas3 Aug 24 '17 at 5:16
  • Sure thing! Do I have to move it myself or a mod will? – Alvai Aug 24 '17 at 11:36