Computer Security quiz
116 questions across 1 difficulty level. Every attempt draws a fresh random set, so you can play as often as you like.
Choose your level
Hard
116 questions
Playing needs a free account so your score can appear on the leaderboard — create one in under a minute.
Sample questions
- Let F: K \times R \to MF:K×R→M be a secure PRF. For m \in Mm∈M define E(k,m) = \big[ r \gets R,\ \text{output } \big(r,\ F(k,r) \oplus m\big)\ \big]E(k,m)=[r←R, output (r, F(k,r)⊕m) ] Is EE symantically secure under CPA?
- _______________ is a popular tool used for network analysis in multiprotocol diverse network.
- What does EXE do when the STP solver times out on a constraint query for a particular path?
Answers are revealed after you submit a quiz.