benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10460 / Let I = (S,V)I=(S,V) be a MAC. Suppose S(k,m)S(k,m) is always 5 bits long. Can…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Let I = (S,V)I=(S,V) be a MAC. Suppose S(k,m)S(k,m) is always 5 bits long. Can this MAC be secure?

category

computer science

options

  1. Yes, the attacker cannot generate a valid tag for any message
  2. Yes, the PRG is pseudorandom
  3. No, an attacker can simply guess the tag for messages
  4. No, the attacker can simply guess the key
  5. Yes, the key length is sufficiently long
  6. No, the key length is not long enough
  7. Yes, the tag length is sufficiently long
  8. It depends on the complexity of the PRG
  9. It depends on the details of the MAC
  10. It depends on the encryption algorithm used in the MAC

src

ori_mmlu-computer_security

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
10460
task_id
566050c7-bfca-5cda-8472-ce61563fc9f5
task_key
default--test--10460
task_revision_id
1
config / split
default / test

Official source

initial import