CS Theory/Security Reading group



The Theory/Security discussion group meets weekly to discuss papers related to topics in theory and security. The goal is to encourage interactions and discussions between students, researchers, and faculty with interests in this area. The seminar is open to everyone interested in theory and security.

For Spring 2018, we will be meeting on Mondays at 10:30AM in FEC 3180/3150 (depending on availability and mediator preference). Any changes to this plan will be communicated through email.

If you want to sign up to lead a discussion (or for any general queries), please subscribe to our mailing list by sending a message to listserv@list.unm.edu. Leave the Subject field blank. In the body of the message, type (with no other text): 

subscribe cssecrg-L Firstname Lastname

Refreshments may be provided!


Schedule (Spring 2018) 

Date Room Paper Mediator
Dec 4 (10AM) B19, Travelstead Hall Proof of Work without all the work, Gupta, D., Saia, J., Young, M. (ICDCN 2018) Diksha Gupta
Jan 22 (10AM) FEC 3180 Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement, Turpin. R, Coan, B. (IPL 1984) Abhinav Aggarwal
Jan 29 (10:30AM) FEC 3150 Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections, Bhaskar, U., Dani, V., Ghosh, A. (AAAI 2018) Varsha Dani
Feb 5 (10:30AM) FEC 3150 Public Key Cryptosystems from Lattice Reduction Problems, Goldreich, O., Goldwasser, S., Halevi, S. (CRYPTO 1997) José Abel Castellanos Joo
Feb 12 (10:30AM) FEC 3150  Step by Step Towards Creating a Safe Smart Contract: Lessons and Insights from a Cryptocurrency Lab, Delmolino, K., Arnett, M., Kosba, A., Miller, A., Shi, E. (BITCOIN 2016)  Arpit Garg 
Feb 19 FEC 3180  Scalable Rational Secret Sharing, Dani, V., Mohavedi, M., Rodriguez, Y., Saia, J. (PODC 2011, J. Dist. Comp. 2015) Diksha Gupta
Feb 26  FEC 3180  — Talk continued — Diksha Gupta
Mar 5 FEC 3180  Unobservable Communication over Fully Untrusted Infrastructure, Angel. S, Setty, S. (OSDI 2016) Abhinav Aggarwal 
Mar 19  FEC 3180  A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities, Elkin, M. (PODC 2017 (best paper)) Diksha Gupta
Mar 26  FEC 3180  Toward More Localized Local Algorithms: Removing Assumptions Concerning Global Knowledge, Korman, A., Sereni, J.S., Viennot, L. (DC 2013) Abhinav Aggarwal 
Apr 2  FEC 3180  Splinter: Practical Private Queries on Public Data, Wang, F., Yun, C., Goldwasser, S., Vaikuntanathan, V., Zaharia, M. (NSDI 2017) José Abel Castellanos Joo
Apr 9  FEC 3150  On the Instability of Bitcoin Without the Block Reward,  Carlsten, M., Kalodner, H., Weinberg, M., Narayanan, K. (CCS 2016) Kashif Memon
Apr 12 FEC 3180  Discovery Through Gossip, Haeupler, B., Pandurangan, G., Peleg, D., Rajaraman, R., Sun, Z. (SPAA 2012) Abhinav Aggarwal
Apr 16 FEC 3150 “Why Should I Trust You?” Explaining the Predictions of Any Classifier, Ribiero, M.T., Singh, S., Guestrin, C. (SIGKDD 2016)

Anchors: High-Precision Model-Agnostic Explanation, Ribiero, M.T., Singh, S., Guestrin, C. (AAAI 2018)

Cynthia Freeman
Apr 23  FEC 3180  TBD  Marie Vasek 
Apr 30  FEC 3180  Byzantine Tolerant Machine Learning, Blanchard, P., El Mhamdi, E.M., Guerraoui, R., Stainer, J. (PODC 2017)   Abhinav Aggarwal 
May 7  FEC 3150  Searching and Mining Trillions of Time Series Subsequences under Dynamic Time Warping, Rakthanmanon, T., Campana, B., Mueen, A., Batista, G., Westover, B., Zhu, Q., Zakaria, J., Keogh, E. (SIGKDD 2012)  Zeinab Akhavan 
May 14  FEC 3150  Set Cover on Large Datasets Shuang Luan
May 21  FEC 3180  Optimal Selfish Mining Strategies in Bitcoin, Sapirshtein, A., Sompolinsky, Y., Zohar, A. (FinCrypto, 2016) Abhinav Aggarwal