Lattice-Based Accumulator and Application to Anonymous Credential Revocation
Victor Youdom Kemmoe
Abstract:
An accumulator is a cryptographic system for compactly representing a set of elements such that every element in the set has a short membership witness. A dynamic accumulator, furthermore, allows elements to be added to and deleted from the accumulator. Camenisch and Lysyanskaya (CRYPTO’02) constructed the first dynamic accumulator under the strong-RSA assumption and showed how it can be used to enable revocation of anonymous credentials. In this talk, I will present a communication-efficient cryptographic accumulator based on the Module-SIS assumption, which is an accumulator that allows adding elements from a set without the need to update membership witnesses, and show how it can be used in the context of anonymous credential revocation.
Joint work with Anna Lysyanskaya and Ngoc Khanh Nguyen.
Bio:
Victor Youdom Kemmoe is a fourth-year Ph.D. student in computer science at Brown University working under the supervision of Anna Lysyanskaya. Before joining Brown, he obtained both a Master's and a Bachelor's in computer science from Kennesaw State University in Georgia.