Security, privacy, and cryptography
Video
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client’s data. The central challenge is to build systems that are both efficient and…
Video
Singular Moduli
The values of the elliptic modular function j at imaginary quadratic numbers τ are called singular moduli. They are of fundamental importance in the study of elliptic curves and in algebraic number theory, including the…
Project
Detection of JavaScript-based Malware
Nozzle: Runtime heap spray detector Nozzle is a runtime monitoring infrastructure that detects attempts by attackers to spray the heap. Nozzle uses lightweight emulation techniques to detect the presence of objects that contain executable code. To…
Publication
Data Collection with Self-Enforcing Privacy
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…
