Instructor:
Charalampos (Babis) Papamanthou
ECE Department
Email: cpap at umd.edu
Office: 3409 A.V. Williams Building
Office hours: By appointment (email me)
Lecture times:
Monday and Wednesday, 11:00am-12.15pm
EGR 1104
We are going to use Canvas for announcements.
Summary of class requirements: (i) Presentation of two papers (40%); (ii) preparation of a short summary for each of the presented papers (10%) and (iii) completion of a research project (50%).
Date | Title | Lecture | Summary | |
---|---|---|---|---|
01/27/14 | Introduction. | C. Papamanthou | Introduced the thematic areas that we are going to talk about during this semester. Relevant papers: (i) cryptographic_cloud_storage (ii) data_protection. | |
01/29/14 | Secure storage. | C. Papamanthou | Talked about various implementations of secure READ/WRITE using Merkle trees with (i) collision resistant hashing; (ii) message authentication codes. Discussed various trade-offs including public verifiability, communication cost and replay attacks. Relevant papers: (i) merkle_tree (ii) memory_checking (iii) certificate_update. | |
02/03/14 | Authenticated data structures. | C. Papamanthou | Talked about (i) Proofs of retrievability and why error correcting codes are useful for solving this problem. (ii) the overhead involved in implementing secure data structures using secure READ/WRITE and how authenticated data structures can help us reduce this overhead. (iii) a specific implementation of an authenticated data structure, i.e., an authenticated skip list. (iv) accumulator-based authenticated data structures. Relevant papers: (i) por (ii) dyn_por (iii) auth_skip_list (iv) accumulator. | |
02/05/14 | Database privacy. | C. Papamanthou | Talked about (i) Strong RSA assumption and a proof of security for cloud membership queries; (ii) Dababase privacy and the CryptDB system that supports a rich series of SQL queries over encrypted data. Relevant papers: (i) non_membership (ii) crypt_db. | |
02/10/14 | Searchable encryption. | C. Papamanthou | Talked about (i) Naive solutions for searchable encryption; (ii) The scheme of Curtmola, Garay, Kamara and Ostrovsky. Relevant papers: (i) sse_1 (ii) sse_2. | |
02/12/14 | Oblivious computation. | C. Papamanthou | Talked about (i) Conjunctive searchable symmetric encryption; (ii) Square root algorithm for oblivious RAM. Relevant papers: (i) oram_1 (ii) binary_oram. | |
02/17/14 | Generalized verifiable computation. | C. Papamanthou | Talked about (i) The verifiable computation system Pinocchio; (ii) How to verify the execution of RAM programs. Relevant papers: (i) pinocchio (ii) pantry. | |
02/19/14 | Fully-homomorphic encryption. | C. Papamanthou | Presented a simple fully-homomorphic encryption scheme and introduced the notion of bootstrapping. Relevant papers: (i) fhe_first (ii) fhe_integers. | |
02/24/14 | Invited lecture. | T. Dumitras | Slides: Security data science. | |
02/26/14 | Invited lecture. | A. Miller | Slides: Programming languages, authenticated data structures and Bitcoin. | |
03/03/14 | No lecture due to snowstorm. | |||
03/05/14 | Student presentation. | N. Seekhao | Slides (here): Practical techniques for searches on encrypted data, SSP 2000 (Song, Perrig, Wagner). | |
03/10/14 | Student presentation. | H. Mushtaq | Slides (here): Fully homomorphic encryption over the integers, EUROCRYPT 2010 (van Dijk, Gentry, Halevi, Vaikuntanathan). | |
03/12/14 | Student presentation. | E. Paraskevas | Slides (here): Shortest path computation with no information leakage, VLDB 2012 (Mouratidis, Yiu). | |
03/17/14 | SPRING BREAK. | |||
03/19/14 | SPRING BREAK. | |||
03/24/14 | Student presentation. | A. Sharma | Slides (here): How efficient can memory checking be?, TCC 2008 (Dwork, Naor, Rothblum, Vaikuntanathan). | |
03/26/14 | Invited lecture. | Y. Huang | Slides: Secure multi-party computation | |
03/31/14 | Invited lecture. | H. Rossman (Amazon) | Slides: | |
04/02/14 | 1st Student presentation. | N. Seekhao | Slides (here): Efficient Verification of Shortest Path Search via Authenticated Hints, ICDE 2010 (Yu, Lin, Mouratidis). | |
2nd Student presentation. | X. Chen | Slides (here): Privacy preserving keyword searches on remote encrypted data, ACNS 2007 (Chang, Mitzenmacher). | ||
04/07/14 | 1st Student presentation. | A. Kosba | Slides (here): CorrectDB: SQL Engine with Practical Query Authentication, VLDB 2013 (Bajaj, Sion). | |
2nd Student presentation. | T. Takapu | Slides (here): Building web applications on top of encrypted data using Mylar, NSDI 2014 (Popa, Stark, Helfer, Valdez, Zeldovich, Kaashoek, Balakrishnan). | ||
04/09/14 | 1st Student presentation. | E. Paraskevas | Slides (here): Hey, You, Get Off of My Cloud: Exploring Information Leakage in Third-Party Compute Clouds, CCS 2009 (Ristenpart, Tromer, Shacham, Savage). | |
2nd Student presentation. | X. Chen | Slides (here): Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers, CRYPTO 2010 (Gennaro, Gentry, Parno). | ||
04/14/14 | Student presentation. | Y. Qian | Slides (here): The Melbourne Shuffle: Improving Oblivious Storage in the Cloud, (Ohrimenko, Goodrich, Tamassia, Upfal). | |
04/16/14 | 1st Student presentation. | S. Bhattacherjee | Slides (here): Authenticating the Query Results of Text Search Engines, VLDB 2008 (Pang, Mouratidis). | |
2nd Student presentation. | H. Zhang | Slides (here): Pinocchio: Nearly Practical Veri?able Computation, SSP 2013 (Parno, Howell, Gentry, Raykova). | ||
04/21/14 | 1st Student presentation. | J. Chen | Slides (here): Searchable Symmetric Encryption: Improved Denitions and Efficient Constructions, CCS 2006 (Curtmola, Garay, Kamara, Ostrovsky). | |
2nd Student presentation. | H. Zhang | Slides (here): Dynamic Searchable Symmetric Encryption, CCS 2012 (Kamara, Papamanthou, Roeder). | ||
04/23/14 | 1st Student presentation. | H. Mushtaq | Slides (here): Verifiable Delegation of Computation over Large Datasets, CRYPTO 2011 (Benabbas, Gennaro, Vahlis). | |
2nd Student presentation. | A. Sharma | Slides (here): Bitter to Better: How to make Bitcoin a Better Currency, FC 2012 (Barber, Boyen, Shi, Uzun). | ||
04/28/14 | 1st Student presentation. | A. Kosba | Slides (posted on Canvas): TrueSet: Nearly Practical Veriable Set Computations (Kosba, Papadopoulos, Papamanthou, Sayed, Shi, Triandopoulos). | |
2nd Student presentation. | J. Chen | Slides (here): Highly-Scalable Searchable Symmetric Encryption, CRYPTO 2013 (Cash, Jarecki, Jutla, Krawczyk, Rosu, Steiner). | ||
04/30/14 | 1st Student presentation. | S. Bhattacherjee | Slides (here): Processing Analytical Queries Over Encrypted Data (Tu, Kaashoek, Madden, Zeldovich). |