Prof. Rebecca Wright, Jason Perry |

Rutgers University |

Spring 2013 |

Time: | Tuesdays 1:00-2:30pm |

Location: | CoRE 305 |

Secure computation (SC) allows two or more parties to communicate with each other to compute a function of their joint inputs while providing various security guarantees, the most essential being that no party can learn anything about the other parties' inputs beyond the output of the computation. Since being introduced in the 1980's, there have been tremendous advances in both the theory and the practice of secure computation.

This light seminar/reading group will survey classic and state-of-the-art results in the field. After the initial meeting, we will take turns presenting papers. All attendants should read the papers to be presented before each meeting.

Date | Paper(s) or Topic | Presenter |

February 5 | Overview and introduction to secure computation, [BGW88] | Prof. Wright |

February 12 | Bellare/Hoang/Rogaway | Prof. Cash |

February 19 | Bellare/Hoang/Rogaway, continued | Prof. Cash |

February 26 | [BMR90] | Jason |

March 5 | Fairplay and Beyond [MNPS04],
[HEKM11],
[KSS12] | Josef Wegehaupt |

March 12 |
NO MEETING | --- |

March 19 |
Kreuter, Shelat, Shen | Luan Nguyen |

March 26 |
[LDDM12] | Jason |

April 2 |
NO MEETING | --- |

April 9 |
High-level optimizations for compiling to circuits | Josef Wegehaupt |

April 16 |
Selective Private Function Evaluation [CIK+01] | group |

April 23 |
Fully Homomorphic Encryption [Gentry09] | Debayan Gupta |

April 30 | NO MEETING - go to the DIMACS Cryptology Workshop! |
--- |

These links are intended as general references and to provide helpful background information. They will not be presented in the seminar.

- Yehuda Lindell's Secure Multiparty Computation tutorial [PPT]

The following is a list of papers appropriate to present in the seminar. More papers will be added as the semester progresses. If there are papers not on this list that you think should be added, let us know.

D. Beaver, S. Micali and P. Rogaway, The round complexity of secure protocols. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), May 1990.

M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway. Efficient Garbling from a Fixed-Key Blockcipher. IEEE Security and Privacy 2013.

M. Bellare, V. T. Hoang, and P. Rogaway, Foundations of Garbled Circuits. Proceedings of the 19th ACM Computer and Communications Security Conference (ACM CCS), October 2012.

A. Ben-David, N. Nisan and B. Pinkas, FairplayMP - A System for Secure Multi-Party Computation. Proceedings of the 15th ACM Computer and Communications Security Conference (ACM CCS), October 2008.

M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault Tolerant Distributed Computation. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), May 1988.

R. Canetti, Y. Ishai, R. Kumar, M. Reiter, R. Rubinfeld, and R. N. Wright, Selective Private Function Evaluation with Applications to Private Statistics. Proceedings of Twentieth ACM Symposium on Principles of Distributed Computing (PODC), 2001.

D. Chaum, C. Crépeau and I. Damgård. Multi-party Unconditionally Secure Protocols. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), May 1988.

I. Damgaard, M. Fitzi, E. Kiltz, J. Buus N. and T. Toft. Unconditionally Secure Constant-Rounds Multi-Party Computation for Equality, Comparison, Bits and Exponentiation. Proceedings of IACR TCC 2006.

J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. N. Wright, Secure Multiparty Computation of Approximations. ACM Transactions on Algorithms, Vol. 2, No. 3, 2006.

C. Gentry. Fully Homomorphic Encryption Using Ideal Lattices. Proceedings of the 41st ACM Symposium on Theory of Computing (STOC), 2009. Also see Gentry's PhD Thesis.

O. Goldreich, S. Micali, A. Wigderson. How to play ANY mental game. Proceedings of the nineteenth annual ACM Symposium on Theory of computing (STOC), 1987.

Y. Huang, D. Evans, J. Katz, and L. Malka. Faster Secure Two-Party Computation Using Garbled Circuits. 20th USENIX Security Symposium, August 2011.

Y. Ishai and E. Kushilevitz, Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP), 2002.

Y. Ishai, T. Malkin, M. Strauss, and R. N. Wright, Private Multiparty Sampling and Approximation of Vector Combinations. Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP), 2007.

J. Katz, R. Ostrovsky, and A. Smith. Round Efficiency of Multi-Party Computation with a Dishonest Majority. In EUROCRYPT 2003, pages 578-595.

B. Kreuter, A. Shelat, C.-H. Shen, Billion-Gate Secure Computation with Malicious Adversaries. Proceedings of the 21st USENIX conference on Security symposium, August 2012. Also available on the IACR eprint archive.

J. Launchbury, I. S. Diatchki, T. DuBuisson, A. Adams-Moran, Efficient Lookup-Table Protocol in Secure Multiparty Computation. Proceedings of the 17th ACM SIGPLAN international conference on Functional Programming (ICFP), September 2012.

Y. Lindell and B. Pinkas, A Proof of Yao's Protocol for Secure Two-Party Computation. Journal of Cryptology, 22(2):161-188, 2009.

D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, Fairplay - A Secure Two-Party Computation System. Proceedings of the 13th Usenix Security Symposium, August 2004.

M. Naor and K. Nissim, Communication preserving protocols for secure function evaluation. Proceedings of the 2001 Symposium on Theory of Computing (STOC), July 2001.

R. Ryger, O. Kardes, and R. N. Wright, On the Lindell-Pinkas Secure Computation of Logarithms: From Theory to Practice. Proceedings of the International Workshop on Practical Privacy-Preserving Data Mining, 2008. (Electronic proceedings only.)

Last updated 2013-04-10 by jasperry (at) cs.rutgers.edu |