Department of Computer Science 


CS 6410: Advanced Systems

Fall 2014

   
    
* Home
* Schedule
* Labs
* Project
 

#

Who (click for slides)

Date

Topic

Required Reading

Suggested Reading

1 Ken
(pdf pptx)
8/26 Course overview
2 Ken
(pdf pptx)
8/28 Building Large, Principled Systems End-to-end arguments in system design, J.H. Saltzer, D.P. Reed, D.D. Clark. ACM Transactions on Computer Systems Volume 2, Issue 4 (November 1984), pages 277--288.

Hints for computer system design, B. Lampson. Proceedings of the Ninth ACM Symposium on Operating Systems Principles (Bretton Woods, New Hampshire, United States) 1983, pages 33--48.

The Impact of Architectural Trends on Operating System Performance Rosenblum et al. 15th SOSP, 1995.

Interposition Agents: Transparently Interposing User Code at the System Interface, Michael Jones. 14th SOSP, 1993, pages 80--93.

3 Ken
(pdf pptx)
9/2 Classic Systems The UNIX time-sharing system, Dennis M. Ritchie and Ken Thompson. Communications of the ACM Volume 17, Issue 7 (July 1974), pages 365--375.

The Duality of Memory and Communication in the Implementation of a Multiprocessor Operating System, M. Young, A Tavanian, R. Rashid, D. Golub, and J. Eppinger. Proceedings of the Eleventh ACM Symposium on Operating Systems Principles (Austin, Texas, United States), ACM, 1987, pages 63--76.
Using continuations to implement thread management and communication in operating systems, Richard P. Draves, Brian N. Bershad, Richard F. Rashid, and Randall W. Dean. Proceedings of the Thirteenth ACM Symposium on Operating Systems Principles (Pacific Grove, California, 1991), pages 122--136.

The nucleus of a multiprogramming system, P, Brinch Hansen. Communications of the ACM Volume 13, Issue 4 (April 1970), pages 238--241.
4 Ken
(pdf pptx)
9/4 Modern Systems: Virtualization Disco: Running Commodity Operating Systems on Scalable Multiprocessors, Edouard Bugnion, Scott Devine, and Mendel Rosenblum. 16th ACM symposium on Operating systems principles (SOSP), October 1997, pages 143--156.

Xen and the Art of Virtualization, Paul Barham, Boris Dragovic, Keir Fraser, Steven Hand, Tim Harris, Alex Ho, Rolf Neugebauer, Ian Pratt, Andrew Warfield. 19th ACM symposium on Operating systems principles (SOSP), October 2003, pages 164--177.
Are Virtual Machine Monitors Microkernels Done Right?, Steven Hand, Andrew Warfield, Keir Fraser, Evangelos Kotsovinos, Dan Magenheimer. Proceedings of the Tenth Workshop on Hot Topics in Operating Systems (HotOS), Sante Fe, NM, June 2005.

Are Virtual Machine Monitors Microkernels Done Right?, Gernot Heiser, Volkmar Uhlig, Joshua LeVasseur. ACM SIGOPS Operating Systems Review (OSR), Volume 40, Issue 1, January 2006, pages 95--99.


Memory resource management in VMware ESX server, C. A. Waldspurger. OSDI 2002.


Virtual Machine Monitors: Current Technology and Future Trends, Mendel Rosenblum, Tal Garfinkel. Computer, vol. 38, no. 5, pp. 39-47, May 2005.


Operating System Support for Virtual Machines, S. T. King, G. W. Dunlap, and P. M. Chen. 2003 USENIX Technical Conference.

Kai Mast
(pdf)
9/9 Modern Systems: Multicore issues The Multikernel: A new OS architecture for scalable multicore systems.  Andrew Baumann, Paul Barham, Pierre-Evariste Dagand, Tim Harrisy, Rebecca Isaacs,
Simon Peter , Tim Roscoe, Adrian Schüpbach, and Akhilesh Singhania . Proceedings of the Twenty-Second ACM Symposium on Operating Systems Principles (Austin, Texas, United States), ACM, 2009.

Tornado: maximizing locality and concurrency in a shared memory multiprocessor operating system, Ben Gamsa, Orran Krieger, Jonathan Appavoo, and Michael Stumm. 3rd USENIX symposium on Operating systems design and implementation (OSDI), February 1999, pages 87-100.
Thousand core chips: a technology perspective. S. Borkar.  In Proceedings of the 44th Annual Design Automation Conference, pages.  746–749, 2007.

Corey: An operating system for many cores. S. Boyd-Wickizer, H. Chen, R. Chen, Y. Mao, F. Kaashoek, R. Morris, A. Pesterev, L. Stein, M. Wu, Y. Dai, Y. Zhang, and Z. Zhang. In Proceedings of the 8th
USENIX Symposium on Operating Systems Design and Implementation,
pages 43–57, Dec. 2008.
Fabian Okeke 9/11 Modern Systems: Containment Scalability, Fidelity, and Containment in the Potemkin Virtual Honeyfarm. Michael Vrable, Justin Ma, Jay Chen, David Moore, Erik Vandekieft,
Alex C. Snoeren, Geoffrey M. Voelker, and Stefan Savage.  Proceedings of the Twentyth ACM Symposium on Operating Systems Principles (SOSP), Brighton, UK. 2005.

 

Vigilante: End-to-End Containment of Internet Worm Epidemics. Manuel Costa, Jon Crowcroft, Miguel Castro, Antony Rowstron, Lidong Zhou, Lintao Zhang, and Paul Barham, in ACM Transactions on Computer Systems, December 2008

Labels and Event Processes in the Asbestos Operating System, Petros Efstathopoulos, Maxwell Krohn, Steve VanDeBogart, Cliff Frey, David Ziegler, Eddie Kohler, David Mazières, Frans Kaashoek, and Robbert Morris. 12th ACM symposium on Operating systems principles (SOSP), October 2005, pages 17--30.

Intrusion Recovery Using Selective Re-execution.
Taesoo Kim, Xi Wang, Nickolai Zeldovich, and M. Frans Kaashoek.  OSDI 2010.

Symantic Elderwood project (analysis of current malware attacks)
7 Kyle Croman
(pdf)
9/16 Modern Systems: Obsfuscation The Monoculture Risk Put into Context. Fred B. Schneider and Ken Birman. IEEE Security & Privacy. Volume 7, Number 1. Pages 14-17. January/February 2009.

On the Effectiveness of Address-Space Randomization.  Shacham, H. and Page, M. and Pfaff, B. and Goh, E.J. and Modadugu, N. and Boneh, D, Proceedings of the 11th ACM conference on Computer and communications security,pp 298—307, 2004
Address Obfuscation: An Efficient Approach to Combat a Broad Range of Memory Error Exploits. S. Bhatkar, D.C. DuVarney, and R. Sekar, Proc. 12th Usenix
Security Symp., Usenix Assoc., 2003, pp. 105–120.

Randomized Instruction Set
Emulation,
E.G. Barrantes et al., ACM Trans. Information and System Security, vol. 8, no. 1, 2005, pp. 3–40.
8 Ken
(Ken's PPTX)
(TAO PPTX)
9/18 Modern Systems: Support for Data Mining in very large graphic-structured data Sets TAO: Facebook’s Distributed Data Store for the Social Graph. Nathan Bronson, Zach Amsden, George Cabrera, Prasad Chakka, Peter Dimov, Hui Ding, Jack Ferris, Anthony Giardullo, Sachin Kulkarni, Harry Li, Mark Marchukov, Dmitri Petrov, Lovro Puzar, Yee Jiun Song, and Venkat Venkataramani, Facebook, Inc.  23rd USENIX, June 2013.

DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language
Yuan Yu, Michael Isard, Dennis Fetterly, Mihai Budiu, Ulfar Erlingsson, Pradeep Kumar Gunda, and Jon Currey
Symposium on Operating System Design and Implementation (OSDI), San Diego, CA, December 8-10, 2008.


DryadLinq web page.

Pregel: A System for Large-Scale Graph Processing
Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn,
Naty Leiser, and Grzegorz Czajkowski
Google, Inc.

GraphLab web page

Vowpal Wabbit web page


9 Andrew Hirsch 9/23 Modern Systems: Security

Fabric: A Platform for Secure Distributed Computation and Storage.  Jed Liu, Michael D. George, K. Vikram, Xin Qi, Lucas Waye, and Andrew C. Myers.  In ACM Symposium on Operating Systems, 2009.  Pages 321-334.

 

Logical Attestation: An Authorization Architecture For Trustworthy Computing. Emin Gün Sirer, Willem de Bruijn, Patrick Reynolds, Alan Shieh, Kevin Walsh, Dan Williams, and Fred B. Schneider. In Proceedings of the Symposium on Operating Systems Principles, Cascais, Portugal, October 2011.

Wiki: Trusted Platform Module

Wiki: Public Key Certificates

Wiki: X509 Standard
10 Ken 9/25 Cloud-Scale Storage and caching An Analysis of Facebook Photo Caching.Qi Huang, Ken Birman, Robbert van Renesse, Wyatt Lloyd, Sanjeev Kumar, Harry Li. The 24th ACM Symposium on Operating Systems Principles (SOSP, 2013). November1- 4, 2013, Pittsburgh.

Finding a Needle in Haystack: Facebook's Photo Storage.
Doug Beaver, Sanjeev Kumar, Harry C. Li, Jason Sobel, and Peter Vajgel.  OSDI 2010.
Rethink the Sync, Edmund B. Nightingale, Kaushik Veeraraghavan, Peter M. Chen, and Jason Flinn. Proceedings of the 7th USENIXE Symposium on Operating Systems Design and Implementation (OSDI), November 2006.

Speculative Execution in a Distributed File System, Edmund B. Nightingale, Peter M Chen, Jason Flinn. Proceedings of the 20th ACM Symposium on Operating Systems Principles (SOSP), October 2005, pages 191--205.
11 Noah Apthorpe 9/30 An O/S perspective on networks Congestion Avoidance and Control, Van Jacobson. Appears in Proceedings of ACM SIGCOMM, Vo1ume 18, Number 4, (August 1988).

TCP Congestion Control with a Misbehaving Receiver, Stefan Savage, Neal Cardwell, David Wetherall and Tom Anderson, Appears in ACM SIGCOMM Computer Communication Review, Volume 29 , Issue 5 (October 1999), pages 71--78.
RouteBricks: Exploiting Parallelism To Scale Software Routers
Mihai Dobrescu and Norbert Egi, Katerina Argyraki, Byung-Gon Chun, Kevin Fall,
Gianluca Iannaccone, Allan Knies, Maziar Manesh, Sylvia Ratnasamy
22nd ACM Symposium on Operating Systems Principles (SOSP), October 2009

Why Do Internet Services Fail, and What Can Be
Done About It?
D. Oppenheimer, A. Ganapathi, 1. and D.A. Patterson,  Proc. 4th Usenix Symp. Internet Technologies
and Systems, Usenix Assoc., 2003, pp. 1–16.

Routers for the Cloud. Can the Internet Achieve 5-Nines Availability? Andrei Agapi, Ken Birman, Robert Broberg, Chase Cotton, Thilo Kielmann, Martin Millnert, Rick Payne, Robert Surton, and Robbert VanRenesse. IEEE Internet Computing. Volume 15. Issue 5. pp.72 - 77. September, October 2011.
12 Moontae Lee 10/2 An O/S perspective on networks U-Net: A User-Level Network Interface for Parallel and Distributed Computing, Von Eicken, Basu, Buch and Werner Vogels. 15th SOSP, December 1995.

Active Messages: A Mechanism for Integrated Communication and Control, Thorsten von Eicken, David E. Culler, Seth Copen Goldstein, and Klaus Erik Schauser. In Proceedings of the 19th Annual International Symposium on Computer Architecture, 1992.

Evaluation of the Virtual Interface Architecture (VIA).

Towards an active network architecture, David L. Tennenhouse and David J. Wetherall. Appears in ACM SIGCOMM Computer Communication Review (CCR), Volume 37, Issue 5 (October 2007), pages 81--94.

A Survey of Active Network Research, David L. Tennenhouse, Jonathan M. Smith, W. David Sincoskie, David J. Wetherall, and Gary J. Minden. Appears in IEEE Communications Magazine, Volume 35, Issue 5 (October 1997), pages 80--86.

13 Praveen Kumar 10/7 An O/S perspective on networks OpenFlow: Enabling innovation in campus networks. Nick McKeown et al. (2008-04).  ACM Communications Review. http://portal.acm.org/citation.cfm?id=1355734.1355746.

Frenetic: A High-Level Langauge for OpenFlow Networks. Nate Foster, Rob Harrison, Matthew L. Meola, Michael J. Freedman, Jennifer Rexford, and David Walker.  In ACM Workshop on Programmable Routers for Extensible Services of Tomorrow (PRESTO), Philadelphia, PA, November 2010.
 Abstractions for Network Update. Mark Reitblatt, Nate Foster, Jennifer Rexford, Cole Schlesinger, and David Walker. In ACM SIGCOMM Conference, Helsinki, Finland, August 2012.
14 Vishal Shrivastav 10/9

Ordering and Consistent Cuts

Time, Clocks, and the Ordering of Events in a Distributed System, Lamport. CACM 21(7). July 1978.

Distributed snapshots: Determining global states of distributed systems.,&nsp; Chandy, Lamport. ACM TOCS 3(1), 1985, 63-75.
How Processes Learn. K. Mani Chandy and Jay Misra. In Proceedings of the fourth annual ACM symposium on Principles of distributed computing (PODC '85). ACM, 204-214
Fall Break: Oct 11-14
15 Isaac Ackerman 10/16 Atomicity Implementing fault-tolerant services using the state machine approach: A tutorial, Fred Schneider. ACM Computing Surveys Volume 22, Issue 4 (December 1990), 299--319.

Sinfonia: A new paradigm for building scalable distributed systems. Marcos K. Aguilera, Arif Merchant, Mehul Shah, Alistair Veitch, Christos Karamanolis. November 2009 Transactions on Computer Systems (TOCS), Volume 27 Issue 3
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems, Lamport. ACM TOPLAS 6:2, 1974.

Dangers of Replication and a Solution, Gray et al. ACM SIGMOD, Jun 1996.
16 Ken
(pdf, pptx)
10/21 Group Communication The Process Group Approach to Reliable Distributed Computing, Birman. CACM, Dec 1993, 36(12):37-53.

Overcoming CAP with Consistent Soft-State Replication.. Kenneth P. Birman, D. Freedman, Q. Huang and Patrick Dowell. IEEE Computer Magazine (special issue on “The Growing Impact of the CAP Theorem”). Volume 12. pp. 50-58. February 2012.
CAP Twelve Years Later.  Eric Brewer. IEEE Computer Magazine (special issue on “The Growing Impact of the CAP Theorem”). Volume 12. pp. 23-30. February 2012.

isis2.codeplex.com:  Isis2, A modern, open-source, group communication library for cloud computing applications.  Ken Birman, 2011.
17 Pooya Jalaly 10/23 Paxos Paxos Made Moderately Complex.  Robbert van Renesse.  Cornell University. March 25, 2011

Wiki: Paxos_Protocol

Paxos Made Simple, Lamport. ACM SIGACT NEWS 32(4). Dec. 2001.
Virtually Synchronous Methodology for Dynamic Service Replication. Ken Birman, Dahlia Malkhi, Robbert van Renesse. Submitted for publication. November 18, 2010. Also available as Microsoft Research TechReport MSR-2010-151.

Wiki: Gbcast_Protocol
18 Vasily Kuksenkov 10/28 Byzantine Agreement The Byzantine Generals Problem, Lamport et al. ACM TOPLAS 4, 1982.

Easy Impossibility Proofs for Distributed Consensus Problems.  Michael J. Fischer , Nancy A. Lynch , Michael Merritt.  ACM PODC 1986.


Practical Byzantine Fault Tolerance, Castro and Liskov. 3rd OSDI, Feb 1999.

Randomized Byzantine Generals, Rabin. FOCS, 1983.

Byzantine Quorum Systems, Malkhi and Reiter.

Fault-Scalable Byzantine Fault-Tolerant Services, Michael Abd-El-Malek et.al. SOSP 2005.

Zyzzyva: Speculative Byzantine Fault Tolerance. Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. 2007. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles (SOSP '07). ACM, New York, NY, USA, 45-58.


The Next 700 BFT Protocols. Rachid Guerraoui, Nikola Knezevic, Vivien Quéma and Marko Vukolić. In Proceedings of EuroSys, Paris, France, pp. 363-376, April 2010

19 Fan Zhang
(slides)
10/30 Byzantine Agreement Atomic broadcast: from simple message diffusion to Byzantine agreement.  Flaviu Cristian, Houtan Aghili, Ray Strong, Danny Dolev. Information and Computation 118 (1): 158–179, 1995.  
20 Theo
(PDF)
11/4 FLP Impossibility of Distributed Consensus with One Faulty Process, Fisher et al. JACM 32(2), Apr 1985.

One of the most famous papers ever written in Computer Science.  Surprisingly subtle...  Bob Constable actually has a far more accessible derivation of the same result using NuPRL; for him it is a constructive solution and one nice thing is that the proof actually illustrates precisely the way the attack needs to play out.


The Building Blocks of Consensus. Yee Jiun Song, Robbert van Renesse, Fred B. Schneider, Danny Dolev.  The 9th International Conference on Distributed Computing and Networking (ICDCN 08), January, 2008. LNCS, Vol. 4904, pp. 54-72.

Many people find this treatment easier to understand than the classic FLP version!
The weakest failure detector for solving consensus, Chandra et al. J. ACM 43, 4, Jul. 1996.

Note: This is quite an amazing result but also a very complex paper.  I highly recommend it but it would deserve a whole lecture on its own, which is why I have it under recommended reading but not required.
21 Soroush Hosseini Alamdari 11/6 Leveraging Social Network Structures Adaptive Hierarchical
clustering of message flows in a multicast data dissemination
system.
Y. Tock, N. Naaman, A. Harpaz, and G. Gershinsky.  In IASTED PDCS, 2005

.Dr. Multicast: Rx for Data Center Communication Scalability. Ymir Vigfusson, Hussam Abu-Libdeh, Mahesh Balakrishnan, Ken Birman, Robert Burgess, Haoyuan Li, Gregory Chockler, Yoav Tock Eurosys, April 2010 (Paris, France). ACM SIGOPS 2010, pp. 349-362.
The structure and function of complex networks. M. E. J. Newman. SIAM Review, 45:167, 2003.

The web as a graph: Measurements, models, and methods. Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan,
and Andrew S. Tomkins. 1999.
22 Ken 11/11 Gossip for Reliable Multicast
Epidemic algorithms for replicated database maintenance, Alan Demers, Dan Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard Sturgis, Dan Swinehart, Doug Terry. Appears in 6th ACM Symposium on Principles of distributed computing (PODC), August 1987, pages 1--12.

Bimodal Multicast, Birman et al. ACM TOCS 17(2), May 1999.
Managing update conflicts in Bayou, a weakly connected replicated storage system, Doug B. Terry, Marvin M. Theimer, Karin Petersen, Alan J. Demers, Mike J. Spreitzer, and Carl H. Hauser. In Proceedings of the 5th ACM Symposium on Operating Systems Principles (SOSP), December 1995, pages 172--182.

T-Man: Fast Gossip-based Construction of Large-Scale Overlay Topologies.  Mark Jelasity Ozalp Babaoglu.  Technical Report UBLCS-2004-7.  May 2004
23 Xanda Schofield
(pdf)
11/13 Gossip for Scalable Data Mining

Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining, Robbert Van Renesse, Kenneth P. Birman, Werner Vogels. Appears in ACM Transactions on Computer Systems (TOCS), Volume 21, Issue 2, May 2003, pages 164--206.

 

Bayesian inference using data flow analysis.  Claret, Guillaume, et al. Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering. ACM, 2013.

Probabilistic programming. IGordon, A. D., Henzinger, T. A., Nori, A. V., & Rajamani, S. K.  May 2014, May. International Conference on Software Engineering (ICSE, FOSE track).

 

24 Galen Marchetti
(pptx)
11/18

Peer to peer/DHT

Chord: A scalable peer-to-peer lookup service for internet applications, Ion Stoica, Robert Moris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Proceedings of the ACM SIGCOMM, August 2001, 149--160. San Diego, California, United States.

 

Dynamo: Amazon's Highly Available Key-Value Store. Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, and Werner Vogels. 2007. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles (SOSP '07). ACM, New York, NY, USA, 205-220.

The Impact of DHT Routing Geometry on Resilience and Proximity, Krishna Gummadi , Ramakrishna Gummadi , Steve Gribble , Sylvia Ratnasamy , Scott Shenker, Ion Stoica. Appears in Proceedings of ACM SIGCOMM, August 2003, pages 381--3

SplitStream: high-bandwidth multicast in cooperative environments. Castro, et. al. SOSP 2003.

Overcast: Reliable Multicasting with an Overlay Network, Jannotti et al. 4th OSDI, Dec 2000.


Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead, Indranil Gupta, Ken Birman, Prakash Linga, Al Demers and Robbert van Renesse. 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03); February 20-21, 2003. Claremont Hotel, Berkeley, CA, USA.

25 Moontae Lee
(pdf)

Jaeyong Sung
(pdf)
11/20 RDMA

The two OSDI papers from 2014 (in the column on the right) are probably the better papers for this lecture, but Ken didn't want the single class to get overwhelming.
U-Net: A user-level network interface for parallel and distributed computing. Von Eicken, T., Basu, A., Buch, V., & Vogels, W. SOSP 1995.  Vol. 29, No. 5, pp. 40-53. ACM. Note:  U-Net later evolved into the Microsoft "direct IO" standard and that in turn became RDMA, but the ideas are the same and the U-Net paper is the best way to learn about them.

FaRM: Fast Remote Memory
Aleksandar Dragojević, Dushyanth Narayanan, Orion Hodson, and Miguel Castro; Microsoft Research 
NSDI 2014

Arrakis: The Operating System is the Control Plane.  Simon Peter, Jialin Li, Irene Zhang, Dan R. K. Ports, Doug Woos, Arvind Krishnamurthy,
and Thomas Anderson,  Timothy Roscoe.  OSDI 2014.

IX: A Protected Dataplane Operating System for High Throughput and Low Latency. Adam Belay, George Prekas, Ana Klimovic, Samuel Grossman, and Christos Kozyrakis,  Edouard Bugnion. OSDI 2014.

12:15 pm
High performance RDMA-based MPI implementation over InfiniBand. Liu, Jiuxing, Jiesheng Wu, and Dhabaleswar K. Panda. International Journal of Parallel Programming 32.3 (2004): 167-198.

WireDirect Enables New Benchmarks For Low Latency UDP.  Chelsio white paper.
26 Eston Schweickart
(pdf).
11/25 Bit Coin
Bitcoin: A peer-to-peer electronic cash system. Nakamoto, Satoshi. Consulted 1.2012 (2008): 28.

Majority is not enough: Bitcoin mining is vulnerable. Eyal, Ittay, and Emin Gün Sirer.  arXiv preprint arXiv:1311.0243 (2013).s

The Bitcoin Backbone Protocol: Analysis and Applications.   Juan A. Garay, Aggelos Kiayias, Nikos Leonardos.  Nov. 2014 (ArXiV).

Information Propagation in the Bitcoin Network.  Christian Decker, Roger Wattenhofer.  13th nal Conference on Peer-to-Peer Computing, 2013.

 

On bitcoin and red balloons.  Babaioff, Moshe, et al.  Proceedings of the 13th ACM Conference on Electronic Commerce. ACM, 2012.
Thanksgiving Holiday: Nov 26-Nov 31
27 Ryan O'Hern
(pptx)
12/2 Differential Privacy
A firm foundation for private data analysis. Dwork, C. Communications of the ACM, 54(1), 86-95.

Privacy by the Numbers: A New Approach to Safeguarding Data

 Erica Klarreich.  Scientific American, December 31 2012.

A few practical options:

CryptDB: Protecting Confidentiality with Encrypted Query Processing.
Raluca Ada Popa, Catherine M. S. Redfield, Nickolai Zeldovich, and Hari Balakrishnan. Proceedings of the 23rd ACM SOSP, Cascais, Portugal, October 2011.

Fully Homomorphic Encryption.

Wikipedia page maintained by Craig Genty and others.

 

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. In PKC 2010, LNCS volume 6056, pages 420-443. Springer, 2010.

 

 

12/4

Final Presentations: Demo Day! (pdf)


Questions or comments? email ken@cs.cornell.edu

Policy on academic integrity

Ken Birman
Last modified: Fri Dec 9 14:34:25 EST 2011