benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10567 / Let F: K …

Problem

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

question

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?

category

computer science

options

  1. It depends on the size of R
  2. Yes, but only if R is large enough so r never repeats (w.h.p)
  3. Yes, but only if M is small enough so m never repeats (w.h.p)
  4. No, unless F is a weak PRF
  5. No, unless F is a strong PRF
  6. Yes, but only if K is large enough so k never repeats (w.h.p)
  7. It depends on the size of K
  8. No, there is always a CPA attack on this system
  9. It depends on what F is used
  10. Yes, whenever F is a secure PRF

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
10567
task_id
f513267a-f077-55a8-8bc8-9815ab272abe
task_key
default--test--10567
task_revision_id
1
config / split
default / test

Official source

initial import