bmcase_photo
Office: Martin E-2
Phone: (864) 656-1822
Email: bmcase@clemson.edu
Fax: (864) 656-5230

Benjamin Case

Degree Program:
Mathematical Sciences
Education:
MS in Mathematical Sciences from Clemson University, 2018
BS in Mathematics from Bob Jones University, 2016
Professional Research Interests

Post-Quantum Cryptography, Fully Homomorphic Encryption, Blockchain Cryptography, Graph Theory

Professional Memberships
AMS, ACM
Selected Publications

  1. Benjamin M. Case, Shuhong Gao, Gengran Hu, Qiuxia Xu. "Fully Homomorphic Encryption with k-bit Arithmetic Operations." May 18, 2019. https://eprint.iacr.org/2019/521(submitted)
  2. Benjamin M. Case, Colin Gallagher and Shuhong Gao, "A Note on Sub-Gaussian Random Variables." May 18, 2019. https://eprint.iacr.org/2019/520
  3. Benjamin M. Case, Evan M. Haithcock, and Renu C. Laskar. “Beta-Packing Sets in Graphs.” May 31, 2019. https://arxiv.org/abs/1906.00073 (accepted to Congressus Numerantium)
  4. Benjamin M. Case, Todd Fenstermacher, Soumendra Ganguly and Renu C. Laskar. “Properties of Partial Dominating Sets in Graphs.” May 31, 2019. https://arxiv.org/abs/1906.00135 (accepted to Congressus Numerantium)
  5. Weihang Tan, Gengran Hu, B. M. Case, Shuhong Gao and Yingjie Laoz. “VLSI Architecture of Polynomial Multiplier for Bootstrapping in an Efficient Fully Homomorphic Encryption Scheme.” 2019 IEEE International Workshop on Signal Processing Systems.
  6. Yao Chen, Benjamin M. Case, Shuhong Gao, Guang Gong. “Error analysis of weak Poly-LWE instances,” Cryptography and Communications, 2018. (https://link.springer.com/article/10.1007/s12095-018-0301-x)
  7. Benjamin M. Case, Stephen T. Hedetniemi, Renu C. Laskar, and Drew J. Lipman, “Partial Domination in Graphs.” Congressus Numerantium, v.228, 2017, p. 85-95. (https://arxiv.org/abs/1705.03096)

                      Selected Talks

                      1. “Fully Homomorphic Encryption with k-bit Arithmetic Operations,” University of Cincinnati, March 2019.
                      2. “Beta-Packing Sets in Graphs” 50th Southeastern International Conference on Combinatorics, Graph Theory & Computing, Boca Raton, FL. March 2019.
                      3. "Partial Domination in Graphs," 48th Southeastern International Conference on Combinatorics, Graph Theory & Computing, Boca Raton, FL. March 2017.
                      4. "Lattice Cryptography and Attacks." Clemson ADM Seminar. April 19, 2018.

                      Links
                      Last Updated: 1/3/20