Security, privacy, and cryptography
Group
Research in Software Engineering (RiSE)
RiSE coordinates Microsoft’s Research in Software Engineering in Redmond, USA. Our mission is to advance the state of the art in Software Engineering and to bring those advances to Microsoft’s businesses.
Video
Computing class polynomials with the Chinese Remainder Theorem
Class polynomials play a key role in the CM-method for constructing elliptic curves with known order. This has many applications to cryptography and is the primary means of obtaining pairing-friendly curves. The CM-method is unfortunately…
Video
Special vs Random Curves: Could the Conventional Wisdom Be Wrong?
The conventional wisdom in cryptography is that for greatest security one should choose parameters as randomly as possible. In particular, in elliptic and hyperelliptic curve cryptography this means making random choices of the coefficients of…
Publication
Automated Whitebox Fuzz Testing
Video
A Cryptographic Compiler for Information-Flow Security
Joint work with Tamara Rezk and Gurvan le Guernic (MSR-INRIA Joint Centre http://msr-inria.inria.fr/projects/sec) We relate two notions of security: one simple and abstract, based on information flows in programs, the other more concrete, based on…
Video
Bilinear Complexity of the Multiplication in a Finite Extention of a Finite Field
Let q=pr be a prime power and Fq be the finite field with q elements. We study the multiplication of two polynomials in Fq [X], with degree ≤ n-1, modulo an irreducible polynomial of degree…
Video
Deniable Authentication on the Internet
We revisit the question of deniable cryptographic primitives, where, intuitively, a malicious party observing the interaction, cannot later prove to a third party that the interaction took place. Example include deniable message authentication, key exchange…
Publication