Many 21st-century computer science applications require the design of software or systems that interact with multiple self-interested participants. This course will provide students with the vocabulary and modeling tools to reason about such design problems. Emphasis will be on understanding basic economic and game theoretic concepts that are relevant across many application domains, and on case studies that demonstrate how to apply these concepts to real-world design problems. Topics include auction and contest design, equilibrium analysis, cryptocurrencies, design of networks and network protocols, reputation systems, social choice, and social network analysis. Case studies include BGP routing, Bitcoin, eBay's reputation system, Facebook's advertising mechanism, Mechanical Turk, and dynamic pricing in Uber/Lyft. Prerequisites: CS106B/X and CS161, or permission from the instructor.
Introduction to the theory of error correcting codes, emphasizing algebraic constructions, and diverse applications throughout computer science and engineering. Topics include basic bounds on error correcting codes; Reed-Solomon and Reed-Muller codes; list-decoding, list-recovery and locality. Applications may include communication, storage, complexity theory, pseudorandomness, cryptography, streaming algorithms, group testing, and compressed sensing. Prerequisites: Linear algebra, basic probability (at the level of, say, CS109, CME106 or EE178) and "mathematical maturity" (students will be asked to write proofs). Familiarity with finite fields will be helpful but not required.
Yang Liu, Wenji Chen, and Yong Guan, "A Fast Sketch for Aggregate Queries over High-Speed Network Traffic," in Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM 2012), Mini-Conference, Orlando, Florida, USA, March 25-30, 2012. Ramzi Saifan, Ahmed Kamal, and Yong Guan, "Efficient Spectrum Searching and Monitoring in Cognitive Radio Network", in the Proceedings of the 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2011), Valencia, Spain, October 17-22, 2011. Yanlin Peng, Linfeng Zhang, and Yong Guan, "Detecting Fraud in Internet Auction Systems," in 5th Annual IFIP WG 11.9 International Conference on Digital Forensics, Orlando, Florida, January 25 - 28, 2009. Chunwang Gao, Zhen Yu, Yawen Wei, Steve Russell, and Yong Guan, "A Statistical Indoor Localization Method for Supporting Location-based Access Control," ACM/Springer Mobile Networks and Applications (MONET), Vol.
Gang Xu, George Amariucai, and Yong Guan, "Delegation of Computation with Verification Outsourcing using GENI Infrastructure," in Proceedings of the 3rd GENI Research and Educational Experiment Workshop (GREE 2014),held in conjunction with GEC19Atlanta, GA, USA, March 19-20, 2014 Jin-Ning Tioh and Yong Guan, "8th International Workshop on Systematic Approaches to Digital Forensic Engineering (SADFE 2013), Hong Kong, November 21-22, 2013.
This class will use the case method to teach basic computer, network, and information security from technology, law, policy, and business perspectives. Using real world topics, we will study the technical, legal, policy, and business aspects of an incident or issue and its potential solutions. The case studies will be organized around the following topics: vulnerability disclosure, state sponsored sabotage, corporate and government espionage, credit card theft, theft of embarrassing personal data, phishing and social engineering attacks, denial of service attacks, attacks on weak session management and URLs, security risks and benefits of cloud data storage, wiretapping on the Internet, and digital forensics. Students taking the class will learn about the techniques attackers use, applicable legal prohibitions, rights, and remedies, the policy context, and strategies in law, policy and business for managing risk. Grades will be based on class participation, two reflection papers, and a final exam. Special Instructions: This class is limited to 65 students, with an effort made to have students from Stanford Law School (30 students will be selected by lottery) and students from Computer Science (30 students) and International Policy Studies (5 students). Elements used in grading: Class Participation (20%), Written Assignments (40%), Final Exam (40%). Cross-listed with the Law School (Law 4004) and International Policy Studies (IPS course number TBD).