Hi, I'm Scott Griffy.
Introduction
I've done a lot of various computer-related stuff in my life. Currently, I'm very interested in applied and theoretical cryptography and how to use it to solve societal and technical problems. Specifically, I've recently been working with randomizable signatures, lattices, and anonymous credentials.Education/Jobs
I'm entering my 5th year as a PhD student in computer science at Brown where I'm working with Anna Lysyanskaya. I graduated from Portland State University with a master's in computer science in June 2019. I got my bachelor's in computer science from Oregon State University. I worked at Intel as a security researcher/engineer and co-authored a patent there. For more info, please see my CV.Conference and journals
Delegatable Anonymous Credentials From Mercurial Signatures With Stronger Privacy
Asiacrypt 2024
PACIFIC: Privacy-preserving automated contact tracing scheme featuring integrity against cloning
Communications in Cryptography 2024
More info
I co-authored (with Anna Lysyanskaya) a paper using randomizable signatures for contact tracing, titled: PACIFIC: Privacy-preserving automated contact tracing scheme featuring integrity against cloning which was published in the first issue of the IACR's Communications in Cryptography journal.
SoK: Signatures With Randomizable Keys
Financial Cryptography 2024
More info
I co-authored (with Sofia Celi, Lucjan Hanzlik, Octavio Perez Kempner, and Daniel Slamanig) a systematization of knowledge on signatures with randomizable keys, titled: SoK: Signatures With Randomizable Keys which appeared at Financial Cryptography 2024 in Curacao.
Aggregate Signatures with Versatile Randomization and Issuer-Hiding Multi-Authority Anonymous Credentials
ACM CCS 2023
More info
Our paper (with Omid Mir, Balthazar Bauer, Anna Lysyanskaya, and Daniel Slamanig) titled: Aggregate Signatures with Versatile Randomization and Issuer-Hiding Multi-Authority Anonymous Credentials which be appeared at ACM CCS 2023 in Copenhagen.
The Strength of Weak Randomization: Easily Deployable, Efficiently Searchable Encryption with Minimal Leakage
IEEE/IFIP Dependable Systems and Networks 2019
More info
I co-authored (with David Pouliot and Charles Wright) a paper on searchable encryption that appeared at DSN 2019, titled: The Strength of Weak Randomization: Easily Deployable, Efficiently Searchable Encryption with Minimal Leakage.Workshop talks
Succinctly Verifiable Computation over Additively-Homomorphically Encrypted Data: Making Privacy-Preserving Blueprints Practical
ICMS Foundations and Applications of Zero-Knowledge Proofs 2024
More info
This work is preprinted at IACR eprint and was presented as a lightning talk at ICMS Foundations and Applications of Zero-Knowledge Proofs 2024
Abradable Key Wrapping
DIMACS 2020 Workshop on Co-Development of Computer Science and Law
I presented work based on my master's thesis at DIMACS 2020 Workshop on Co-Development of Computer Science and Law.
More info
My Master's thesis introduced a concrete version of a scheme for exceptional access. It is titled: Crumpled and Abraded Encryption: Implementation and Provably Secure Construction. PSU library link. Advisor: Charles V. Wright.I presented work based on my master's thesis at DIMACS 2020 Workshop on Co-Development of Computer Science and Law.