Our research
Content type
+
Downloads (441)
+
Events (396)
 
Groups (150)
+
News (2593)
 
People (804)
 
Projects (1066)
+
Publications (12006)
+
Videos (5240)
Labs
Research areas
Algorithms and theory47205 (4)
Communication and collaboration47188 (6)
Computational linguistics47189 (13)
Computational sciences47190 (24)
Computer systems and networking47191 (24)
Computer vision208594 (0)
Data mining and data management208595 (0)
Economics and computation47192 (0)
Education47193 (2)
Gaming47194 (3)
Graphics and multimedia47195 (20)
Hardware and devices47196 (9)
Health and well-being47197 (14)
Human-computer interaction47198 (22)
Machine learning and intelligence47200 (15)
Mobile computing208596 (1)
Quantum computing208597 (0)
Search, information retrieval, and knowledge management47199 (23)
Security and privacy47202 (13)
Social media208598 (0)
Social sciences47203 (3)
Software development, programming principles, tools, and languages47204 (26)
Speech recognition, synthesis, and dialog systems208599 (1)
Technology for emerging markets208600 (0)
1–13 of 13
Sort
Show 25 | 50 | 100
1
The U-Prove JavaScript SDK implements the client-side of the U-Prove Cryptographic Specification [1], and is a companion to the U-Prove C# SDK [2]. It can be used to write web clients interacting with U-Prove services. For more information about the U-Prove technology, please visit http://www.microsoft.com/uprove. [1] http://research.microsoft.com/apps/pubs/default.aspx?id=166969 [2] https://uprovecsharp.codeplex.com/
Details
Date: 3 October 2014
Version: 1.0
Size: 0.14 MB
Type: Download
The Microsoft Research JavaScript Cryptography Library has been developed for use with cloud services in an HTML5 compliant and forward-looking manner. The algorithms are exposed via the W3C WebCrypto interface, and are tested against the Internet Explorer 11 implementation of that interface. The library currently supports RSA encrypt/decrypt (PKCS#1 v1.5, OAEP, and PSS), AES-CBC and GCM encrypt/decrypt, SHA-256/384/512, HMAC with supported hash functions, PRNG (AES-CTR based) as specified by NIST, ECDH,...
Details
Date: 15 August 2014
Version: 1.2
Size: 258.41 MB
Type: Download
MSR ECCLib is an efficient cryptographic library that provides functions for computing essential elliptic curve operations on a new set of high-security curves. All computations on secret data exhibit regular, constant-time execution, providing protection against timing and cache attacks.
Details
Date: 27 June 2014
Version: 1.1
Size: 0.11 MB
Type: Download
The U-Prove Extensions SDK implements extensions to the U-Prove Cryptographic Specification [1], and is a companion to the U-Prove C# SDK [2].
Details
Date: 19 June 2014
Version: 1.1
Size: 0.46 MB
Type: Download
This download contains Magma files that compute arithmetic on genus 2 curves in Jacobian coordinates.
Details
Date: 27 May 2014
Version: 1.0
Size: 0.02 MB
Type: Download
In addition to physical TPM devices, TSS.Net can also be connected to a TPM simulator to enable application development and debugging on platforms that do not have a TPM 2.0 device. The connection to the simulator is over a TCP/IP socket so the simulator may be running on a remote machine or in another process on the same machine. Below you will find a link to download the TPM2 Simulator binary for use with the TSS.Net TPM2 library.
Details
Date: 16 January 2014
Version: 1.1
Size: 0.25 MB
Type: Download
Automata is a .NET tool kit that provides facilities for manipulating and analyzing regular expressions, symbolic finite automata, and symbolic finite transducers. It supports automata and transducers where input and output alphabets can be fully symbolic. Constraints over the alphabets can be analyzed using Satisfiability Modulo Theory (SMT) solvers. The tool kit provides a particular extension that uses the Microsoft SMT solver Z3.
Details
Date: 27 October 2011
Version: 1.0.0.0
Size: 3.13 MB
Type: Download
Memoir is a framework for building trusted modules with state continuity. The framework is described in our paper, Memoir: Practical State Continuity for Protected Modules.
Details
Date: 5 April 2011
Version: 1.0.0
Size: 0.18 MB
Type: Download
Research and analysis related to computer networks is often hampered by the tension between the need for accurate network packet traces to study, and the concern that these traces may contain sensitive information. Starting from recent work on differential privacy, we have produced a toolkit and a collection of standard network trace analyses using these tools that guarantee differential privacy. The download demonstrates the tools, and how they can be used to analyze network trace data while providing...
Details
Date: 18 August 2010
Version: 1.0
Size: 0.16 MB
Type: Download
This is a source release of the Fine compiler and several example programs. The Fine compiler implements a type system that enables the enforcement of rich, stateful authorization and information-flow policies to be verified. Our compilation technique produces verifiable target code in a language called DCIL, an extension of CIL, the language of the .NET runtime. Code consumers can check DCIL target programs using a syntactic byte-code verifier to establish the security of the code.
Details
Date: 28 May 2010
Version: 0.3-alpha
Size: 4.92 MB
Type: Download
Privacy Integrated Queries (PINQ) is a LINQ-like API for writing programs against sensitive data sets, while providing differential privacy guarantees for the underlying records. This first release provides the PINQ infrastructure, several example data analysis applications, and should be suitable for prototyping many differentially-private data analyses.
Details
Date: 18 August 2009
Version: 0.1.1
Size: 0.27 MB
Type: Download
FS2PV is a verification tool that compiles cryptographic-protocol implementations in a first-order subset of F# to a formal pi-calculus model. This pi-calculus model then can be analyzed using ProVerif to prove the desired security properties or to find security flaws.
Details
Date: 14 February 2007
Version: 1.0
Size: 2.19 MB
Type: Download
TulaFale is a new specification language for writing machine-checkable descriptions of SOAP-based security protocols and their properties. TulaFale is based on the pi calculus (for writing collections of SOAP processors running in parallel), plus XML syntax (to express SOAP messaging), logical predicates (to construct and filter SOAP messages), and correspondence assertions (to specify authentication goals of protocols). Our implementation compiles TulaFale into the applied pi calculus, and then runs...
Details
Date: 15 May 2006
Version: 1.5
Size: 2.24 MB
Type: Download
1–13 of 13
Sort
Show 25 | 50 | 100
1
> Our research