I539/B609 Cryptographic Protocols

Syllabus

The primary focus of this seminar course is the theory and implementation of computation-oriented cryptographic protocols, including secure multi-party computation protocols, verifiable computation protocols, homomorphic encryption protocols, efficient zero-knowledge protocols, etc. Broader topics on security and cryptography are also accommodated per students interests. The course is highly research oriented: students will read and present research papers in regular class meetings and accomplish a research term project.

Instructor & Moderator: Yan Huang
Class Meeting: Mon 3:30-4:45 Lindley Hall 325; Wed 3:30-4:45 Lindley Hall 215

Papers

You will select (subject to instructor's approval), read and present papers published at major crypto and security conferences (CRYPTO, EUROCRYPT, IEEE S&P, USENIX Security, ACM CCS, NDSS, etc). The following is a suggested list of papers:

    Security Models, Proofs and Automation

  1. Universally Composable Security: A New Paradigm for Cryptographic Protocols, R. Canetti, FOCS'01. [pdf]
  2. A Simpler Variant of Universally Composable Security for Standard Multiparty Computation, R. Canetti, A. Cohen, Y. Lindell, CRYPTO'15.[pdf]
  3. Sequences of Games: A Tool for Taming Complexity in Security Proofs, V. Shoup. [pdf]
  4. Computer-Aided Security Proofs for the Working Cryptographer, G. Barthe, B. Gregoire, S. Heraud, and S. Beguelin. CRYPTO'11. [pdf]
  5. Certified computer-aided cryptography: efficient provably secure machine code from high-level implementations, J. Almeida M. Barbosa G. Barthe, F. Dupressoir, CCS'13. [pdf]

    6. Secure Computation

  6. Foundations of Garbled Circuits, M. Bellare, V. T. Hoang, P. Rogaway. CCS'12. [pdf]
  7. Fast Garbling of Circuits Under Standard Assumptions, S. Gueron, Y. Lindell, A. Nof, B. Pinkas. CCS'15. [pdf]
  8. Non-Interactive Secure Computation Based on Cut-and-Choose, Arash Afshar, Benny Pinkas, and Ben Riva, EUROCRYPT'14. [pdf]
  9. Circuits Resilient to Additive Attacks with Applications to Secure Computation, D. Genkin, Y. Ishai, M. Prabhakaran, A. Sahai, E. Tromer. STOC'14. [pdf]
  10. How to Garble Arithmetic Circuits, B. Applebaum and Y. Ishai and E. Kushilevitz. FOCS'11. [pdf]
  11. How to Garble RAM Programs, S. Lu, R. Ostrovsky. EUROCRYPT'13. [pdf]
  12. Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost, Z. Hu; P. Mohassel; M. Rosulek. CRYPTO'15. [pdf]
  13. Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ, Y. Lindell and B. Pinkas and N. P. Smart and A. Yanai. CRYPTO'15 [pdf]

  14. Phasing: Private Set Intersection Using Permutation-based Hashing, B. Pinkas, T. Schneider, G. Segev, M. Zohner. USENIX'15. [pdf]
  15. Privacy-Preserving Shortest Path Computation, D. Wu, J. Zimmerman, J. Planul, J. Mitchell. NDSS'16. [pdf]

    16. Verifiable Computation

  16. Geppetto: Versatile Verifiable Computation, C. Costello, C. Fournet, J. Howell, M. Kohlweiss, B. Kreuter, M. Naehrig, B. Parno, S. Zahur, IEEE SP'15. [pdf]
  17. Efficient RAM and control flow in verifiable outsourced computation, R. Wahby, S. Setty, Z. Ren, and A. Blumberg, M. Walfish. NDSS'15. [pdf]
  18. ALITHEIA: Towards Practical Verifiable Graph Processing, Y. Zhang, C. Papamanthou, and J. Katz. CCS'14. [pdf]

    19. FHE

  19. Computing Arbitrary Functions of Encrypted Data, C. Gentry. CACM'10. [pdf]

    20. Other Interesting Papers

  20. ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data, M. Backes, M. Barbosa, D. Fiore, R. Reischuk. IEEE SP'15. [pdf]
  21. The Pythia PRF Service, A. Everspaugh, R. Chaterjee, S. Scott, A. Juels, T. Ristenpart. USENIX'15. [pdf]
  22. SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies, J. Bonneau, A. Miller, J. Clark, A. Narayanan, J. Kroll, E. Felten. IEEE SP'15 [pdf]
  23. Provisions: Privacy-preserving proofs of solvency for Bitcoin exchanges, G. Dagher, B. Bunz, J Bonneau, J. Clark, D. Boneh. CCS'15[pdf]
  24. Riposte: An Anonymous Messaging System Handling Millions of Users, H. Corrigan-Gibbs, D. Boneh, D. Mazières. IEEE SP'15 [pdf]
  25. Honey Encryption: Security Beyond the Brute-Force Bound, A. Juels, T. Ristenpart. EUROCRYPT'14. [pdf]
  26. Cracking-Resistant Password Vaults using Natural Language Encoders, R. Chatterjee, J. Bonneau, A. Juels, T. Ristenpart. IEEE SP'15. [pdf]
  27. Asymmetric proof-of-work based on the Generalized Birthday problem, A. Biryukov, D. Khovratovich. [pdf]
  28. Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice, D. Adrian, K. Bhargavan, Z. Durumeric, P. Gaudry, M. Green, A. Halderman, N. Heninger, D. Springall, E. Thomé, L. Valenta, B. VanderSloot, E. Wustrow, S. Zanella-Béguelin, P. Zimmermann. CCS'15. [pdf]