[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-395031-105":59,"doc-detail-395031-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","61600-fall-2022-practice-problems-practice-problems","6.1600 Fall 2022 Practice Problems - Practice Problems","","Practice problems for MIT 6.1600 Fall 2022 on foundations of computer security. The set includes true/false questions, authentication scheme analysis, short-answer prompts, and tasks on randomness generation. Topics cover CPA-secure encryption and its implications, one-time passwords, digital signatures, MAC and encryption, protocol analysis, pseudorandom functions, and variants on Diffie-Hellman, including adversarial behavior and security properties. Instructions specify open-book rules and restrictions on internet use and collaboration.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":20,"@type":76,"position":81},"https://docshare.wps.com/document/exam/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/61600-fall-2022-practice-problems-practice-problems/395031/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/61600-fall-2022-practice-problems-practice-problems/395031.png","ImageObject",300,407,{"name":92,"@type":93},"mieayamfan","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-30","2026-09-26",true,{"@type":102,"interactionType":103,"userInteractionCount":14},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What are the exam rules regarding resources and collaboration?","Question",{"text":112,"@type":113},"The exam is open book, but only notes and materials released by the course that term may be used. Internet access is forbidden, and any form of collaboration is strictly prohibited.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How are true/false questions graded?",{"text":117,"@type":113},"Each statement is marked by circling T or F, and no justification is required or considered for grading. Points are allocated per subpart.",{"name":119,"@type":110,"acceptedAnswer":120},"What authentication topics are included in the practice problems?",{"text":121,"@type":113},"The practice set analyzes client authentication to a database server, compares password-based, MAC-based, and signature-based approaches, and includes protocol reasoning about replay attacks and security when hashing username and query values.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},395031,1792219768,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":19,"category_name":20,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":14,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":139,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145,"preview_page_count":4},962090893677,"https://ap-avatar.wpscdn.com/davatar_3d24733baf745e90a7e4bdd5f77d97b2","Foundations of Computer Security  \nMassachusetts Institute of Technology  \nHenry Corrigan-Gibbs, Yael Kalai, Nickolai Zeldovich  \nOctober 17, 2022 6.1600 Fall 2022 Practice Problems  \nPractice Problems  \n\n| Question | Parts | Points |\n| --- | --- | --- |\n| 1: Instructions | 1 | 0 |\n| 2: True or False | 10 | 20 |\n| 3: Authentication schemes | 6 | 20 |\n| 4: Short Answer Questions | 3 | 15 |\n| 5: Generating Randomness | 1 | 5 |\n| 6: Pseudorandom functions | 2 | 10 |\n| 7: Protocol Analysis | 2 | 10 |\n| 8: Encryption and MAC | 1 | 5 |\n| 9: MAC1 | 1 | 5 |\n| 10: Variants on Diffie-Hellman (DH) | 4 | 20 |\n| 11: Course Survey | 5 | 5 |\n| Total: |  | 115 |\n\nName:    \nThe actual midterm will be for a total of 120 points.  \n6. 1600 Practice Problems Name:   2 of 14 Problem 1. [0 points] Instructions (1 part)  \n• This is an open book exam: you can use your notes from this class, or any material released by us this term. You cannot use the internet. Use of any material not released by us this term is strictly forbidden.  \n• Any form of collaboration is strictly forbidden.  \n• If you need assistance clarifying a question in the exam, raise your hand and a proctor will come by.  \n• Point totals correspond roughly to how much time we expect you to spend on each problem (part) .  \n6. 1600 Practice Problems Name:   3 of 14  \nProblem 2. [20 points] True or False (10 parts)  \nPlease circle T or F for the following. No justification is needed (nor will be considered) .  \n(a) [2 points] A CPA-secure encryption scheme must hide the length of encrypted messages.  \n(b) [2 points] Let H be a standard collision-resistant hash function (e.g., SHA256), and let p bea random 32-bit string. An attacker who learns H(p) can recover p.  \n(c) [2 points] Time-based one-time passwords require a client and a server to share a secret.  \n(d) [2 points] The shortest digital signatures commonly used in practice today are 2048 bits long.  \n(e) [2 points] [HTTPS uses a](HTTPS uses a) “trust on first use” design for distribution of public keys.  \n6. 1600 Practice Problems Name:   4 of 14  \n(f) [2 points] Let (E, D) be an arbitrary CPA-secure symmetric encryption scheme. This scheme remains secure if an attacker learns only one bit of the secret key.  \n(g) [2 points] A CPA-secure encryption scheme on n-bit messages (with perfect correctness) must have ciphertexts that are more than n bits long.  \n(h) [2 points] Large-scale quantum computers can efficiently break all known digital-signature schemes.  \n(i) [2 points] In the lab 2 web of trust, Alice adds Bob as a trusted contact by signing Bob’s public key. Cedric also adds Bob as a trusted contact by signing Bob’s public key. Assuming lab 2 has been succesfully completed, Alice can now retreive Cedric’s public key in an authenticated manner.  \n(j) [2 points] Is it the case that for every possible CPA secure encryption scheme, its ciphertext looks random?  \n6. 1600 Practice Problems Name:   5 of 14  \nProblem 3. [20 points] Authentication schemes (6 parts)  \nWe consider the problem of a client authenticating to a database server over a network. After authenticating, the client will send a variable-length query command to the server.  \n(a) [3 points] Give two advantages of password-based authentication over MAC-based authentication.  \n(b) [3 points] Give two advantages of MAC-based authentication over password-based authentication.  \n(c) [3 points] Give two advantages of MAC-based authentication over signature-based authentication.  \n6. 1600 Practice Problems Name:   6 of 14  \n(d) [2 points] Give one advantage of signature-based authentication over MAC-based authentication.  \n(e) [5 points] To provide strong security, the database administrator decides to use MAC-based authentication. During account registration, each client will generate a MAC key k and send it to the server. To authenticate, the client will send the message t = MAC(k, user_name) to the server over the open network. The server, will check that t == MAC(k, user","cbCaig8s6JBke1u2","https://ap.wps.com/l/cbCaig8s6JBke1u2","pdf",159437,14,"English","# Instructions\n# True or False\n# Authentication schemes\n# Short Answer Questions\n# Generating Randomness\n# Pseudorandom functions\n# Protocol Analysis\n# Encryption and MAC\n# MAC1\n# Variants on Diffie-Hellman (DH)\n# Course Survey","[{\"question\":\"What are the exam rules regarding resources and collaboration?\",\"answer\":\"The exam is open book, but only notes and materials released by the course that term may be used. Internet access is forbidden, and any form of collaboration is strictly prohibited.\"},{\"question\":\"How are true/false questions graded?\",\"answer\":\"Each statement is marked by circling T or F, and no justification is required or considered for grading. Points are allocated per subpart.\"},{\"question\":\"What authentication topics are included in the practice problems?\",\"answer\":\"The practice set analyzes client authentication to a database server, compares password-based, MAC-based, and signature-based approaches, and includes protocol reasoning about replay attacks and security when hashing username and query values.\"}]","6.1600 Fall 2022 Practice Problems - Practice Problems | PDF",1790415498,35]