Blockchain is Driving a Security and Privacy Revolution Almost 30 years ago, a few revolutionary thinkers calling themselves Cypherpunks described a vision of a world of pervasive encryption and privacy …

Title: Polynomial commitments with zk-SNARKs Abstract: In many situations or transactions in which two parties do not trust each other but need to interact, it is necessary to prove the truth …

Title: Computing canonical rings of Hilbert modular varieties Abstract: Recent advances in explicit methods for Hilbert modular forms (HMFs) have allowed researchers to quickly access the Fourier coefficients of a basis for …

Title: Local data of rational elliptic curves with non-trivial torsion. Abstract: There are fourteen possible non-trivial torsion subgroups T of a rational elliptic curve E by Mazur's Torsion Theorem. For each T, we consider …

Title: A classification of isogeny-torsion graphs for isogeny classes of elliptic curves defined over \mathbb{Q} . Abstract: A well-known theorem of Mazur says that there are precisely 15 torsion subgroups …

Title: Algebraic aspects of isogeny-based cryptography Abstract: Cryptographic schemes based on isogeny graphs of elliptic curves give interesting candidates for post-quantum cryptography. Isogenies carry with them lots of beautiful number …

Title: Secure Computation and Private Randomized Controlled Trials Abstract: We will survey various Secure Computation techniques and then consider how to use them to build a privacy-preserving protocol for multiparty Randomized …

Title: Steinberg Homology, Modular Forms, and Real Quadratic Fields Abstract:  I will discuss the three objects in the title and their relationship.  In this joint work with Avner Ash, we …

Title: Semistable abelian varieties with good reduction outside 73. Abstract: In this talk, we describe all simple semistable abelian varieties over \mathbb{Q} , with good reduction outside 73, up to …

Title: Decoding algorithm for irregular expander codes Abstract: Expander codes are special type of LDPC codes known for their sparseness and good decoding abilities. Decoding algorithms for regular expander codes have been …