{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu","formal_name":"MMLU","introduction":"MMLU asks four-way multiple-choice questions across 57 subjects, from elementary material to professional-level examinations. Since 2020 it has been the most widely cited single reference point for general capability.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/test","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"8352746e-138a-567f-a68b-e04a70fe39b5","task_key":"all--test--8352746e-138a-567f-a68b-e04a70fe39b5","task_revision_id":"1","upstream_id":"","short_description":"Let F: K \\times R \\to MF:K×R→M be a secure PRF. For m \\in Mm∈M define E(k,m) =…","config":"all","split":"test","body":"{\"choices\":\"['Yes, whenever F is a secure PRF', 'No, there is always a CPA attack on this system', 'Yes, but only if R is large enough so r never repeats (w.h.p)', 'It depends on what F is used']\",\"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?\",\"subject\":\"computer_security\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/test","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}