Our research
Content type
+
Downloads (421)
+
Events (355)
 
Groups (147)
+
News (2467)
 
People (825)
 
Projects (1016)
+
Publications (11432)
+
Videos (4861)
Labs
Research areas
Algorithms and theory47205 (208)
Communication and collaboration47188 (177)
Computational linguistics47189 (143)
Computational sciences47190 (159)
Computer systems and networking47191 (599)
Computer vision208594 (8)
Data mining and data management208595 (4)
Economics and computation47192 (81)
Education47193 (71)
Gaming47194 (63)
Graphics and multimedia47195 (178)
Hardware and devices47196 (173)
Health and well-being47197 (62)
Human-computer interaction47198 (715)
Machine learning and intelligence47200 (597)
Mobile computing208596 (7)
Quantum computing208597 (3)
Search, information retrieval, and knowledge management47199 (561)
Security and privacy47202 (218)
Social media208598 (5)
Social sciences47203 (219)
Software development, programming principles, tools, and languages47204 (495)
Speech recognition, synthesis, and dialog systems208599 (12)
Technology for emerging markets208600 (22)
1–25 of 218
Sort
Show 25 | 50 | 100
1234567Next 
James Mickens
Pivot is a new JavaScript isolation framework for web applications. Pivot uses iframes as its low-level isolation containers, but it uses code rewriting to implement synchronous cross-domain interfaces atop the asynchronous cross-frame postMessage() primitive. Pivot layers a distributing scheduling abstraction across the frames, essentially treating each frame as a thread which can invoke RPCs that are serviced by external threads. By rewriting JavaScript call sites, Pivot can detect RPC invocations; Pivot...
Publication details
Date: 1 May 2014
Type: Inproceeding
Publisher: IEEE
Shayak Sen, Saikat Guha, Anupam Dutta, Sriram Rajamani, Janice Tsai, and Jeannette Wing
With the rapid increase in cloud services collecting and using user data to offer personalized experiences, ensuring that these services comply with their privacy policies has become a business imperative for building user trust. However, most compliance efforts in industry today rely on manual review processes and audits designed to safeguard user data, and therefore are resource intensive and lack coverage. In this paper, we present our experience building and operating a system to automate privacy...
Publication details
Date: 1 May 2014
Type: Inproceeding
Tolga Acar, Cedric Fournet, and Dan shumow
We present DKM, a distributed key management system with a cryptographically verified code base. DKM implements a new data protection API. It manages keys and policies on behalf of groups of users that share data. To ensure long-term protection, DKM supports cryptographic agility: algorithms, keys, and policies can evolve for protecting fresh data while preserving access to old data. DKM is written in C# and currently used by several large data center applications. To verify our design and implementation,...
Publication details
Date: 15 April 2014
Type: Technical report
Publisher: Microsoft Technical Report
Number: MSR-TR-2014-48
Patrick Longa and Francesco Sica
The GLV method of Gallant, Lambert and Vanstone (CRYPTO 2001) computes any multiple kP of a point P of prime order n lying on an elliptic curve with a low-degree endomorphism \Phi (called GLV curve) over GF(p) as kP = k_1P + k_2\Phi(P), with max{|k_1|,|k_2|} <= C_1 n^(1/2) for some explicit constant C_1>0. Recently, Galbraith, Lin and Scott (EUROCRYPT 2009) extended this method to all curves over GF(p^2) which are twists of curves defined over GF(p). We show in this work how to merge the two...
Publication details
Date: 1 April 2014
Type: Article
Publisher: Springer
Tolga Acar and Lan Nguyen
Past decade has witnessed the availability of Trusted Platform Modules (TPM) on commodity computers. While the most common use of TPM appears to be BitLocker on Windows OS, server class motherboards have not yet enjoyed a similar TPM deployment base. Recent research and products show that the TPM can provide a level of trust on locally executing software. Nonetheless, TPMs haven’t been utilized in data center cryptographic key management for higher levels of security assurance than software-only...
Publication details
Date: 1 April 2014
Type: Technical report
Publisher: Microsoft Research Technical Report
Number: MSR-TR-2014-49
Nick Nikiforakis, Wouter Joosen, and Benjamin Livshits
This paper proposes a solution to the problem of browser-based fingerprinting. An important observation is that making fingerprints non-deterministic also makes them hard to link across subsequent web site visits. Our key insight is that when it comes to web tracking, the real problem with fingerprinting is not uniqueness of a fingerprint, it is linkability, i.e. the ability to connect the same fingerprint across multiple visits. In PriVaricator we use the power of randomization to "break"...
Publication details
Date: 28 February 2014
Type: Technical report
Number: MSR-TR-2014-26
Matt Fredrikson and Benjamin Livshits
Applications increasingly rely on privacy-sensitive user data, but storing user's data in the cloud creates challenges for the application provider, as concerns arise relating to the possibility of data leaks, responding to regulatory pressure, and initiatives such as DoNotTrack. However, storing data in the cloud is not the only option: a recent trend explored in several recent research projects has been to move functionality to the client. Because execution happens on the client, such as a mobile device...
Publication details
Date: 28 February 2014
Type: Technical report
Number: MSR-TR-2014-27
Armando Faz-Hernandez, Patrick Longa, and Ana H. Sanchez
We propose efficient algorithms and formulas that improve the performance of side-channel protected scalar multiplication exploiting the Gallant-Lambert-Vanstone (CRYPTO 2001) and Galbraith-Lin-Scott (EUROCRYPT 2009) methods. Firstly, by adapting Feng et al.'s recoding to the GLV setting, we derive new regular algorithms for variable-base scalar multiplication that offer protection against simple side-channel and timing attacks. Secondly, we propose an efficient technique that interleaves ARM-based and...
Publication details
Date: 1 February 2014
Type: Inproceeding
Publisher: Lecture Notes in Computer Science
Antoine Delignat-Lavaud, Martin Abadi, Andrew Birrell, Ilya Mironov, Ted Wobber, and Yinglian Xie
A string of recent attacks against the global public key infrastructure (PKI) has brought to light weaknesses in the certification authority (CA) system. In response, the CA/Browser Forum, a consortium of certification authorities and browser vendors, published in 2011 a set of requirements applicable to all certificates intended for use on the Web and issued after July 1st, 2012, following the successful adoption of the extended validation guidelines in 2007. We evaluate the actual level of adherence to...
Publication details
Date: 1 February 2014
Type: Inproceeding
Publisher: Internet Society
Joppe W. Bos, Craig Costello, Patrick Longa, and Michael Naehrig
We select a set of elliptic curves for cryptography and analyze our selection from a performance and security perspective. This analysis complements recent curve proposals that suggest (twisted) Edwards curves by also considering the Weierstrass model. Working with both Montgomery-friendly and pseudo-Mersenne primes allows us to consider more possibilities which improves the overall efficiency of base field arithmetic. Our Weierstrass curves are backwards compatible with current implementations of prime...
Publication details
Date: 1 February 2014
Type: Technical report
Number: MSR-TR-2014-19
Joppe W. Bos, J. Alex Halderman, Nadia Heninger, Jonathan Moore, Michael Naehrig, and Eric Wustrow
In this paper, we perform a review of elliptic curve cryptography (ECC), as it is used in practice today, in order to reveal unique mistakes and vulnerabilities that arise in implementations of ECC. We study four popular protocols that make use of this type of public-key cryptography: Bitcoin, secure shell (SSH), transport layer security (TLS), and the Austrian e-ID card. We are pleased to observe that about 1 in 10 systems support ECC across the TLS and SSH protocols. However, we find that despite the...
Publication details
Date: 1 January 2014
Type: Inproceeding
Publisher: Springer
Joppe W. Bos, Craig Costello, and Andrea Miele
Motivated by the advantages of using elliptic curves for discrete logarithm-based public-key cryptography, there is an active research area investigating the potential of using hyperelliptic curves of genus 2. For both types of curves, the best known algorithms to solve the discrete logarithm problem are generic attacks such as Pollard rho, for which it is well-known that the algorithm can be sped up when the target curve comes equipped with an efficiently computable automorphism. In this paper we...
Publication details
Date: 1 January 2014
Type: Inproceeding
Publisher: Springer
Joppe W. Bos, Alina Dudeanu, and Dimitar Jetchev
We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group G. Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the elliptic curve discrete logarithm problem. Our bounds differ from the birthday bound O(sqrt(|G|)) by a factor of sqrt(\log(|\G|)) and are based on mixing time estimates for random walks on finite abelian groups due to Dou and Hildebrand. See also:...
Publication details
Date: 1 January 2014
Type: Article
Publisher: de Gruyter
Joppe W. Bos, Kristin Lauter, Jake Loftus, and Michael Naehrig
In 1996, Hoffstein, Pipher and Silverman introduced an efficient lattice based encryption scheme dubbed NTRUEnc. Unfortunately, this scheme lacks a proof of security. However, in 2011, Stehle and Steinfeld showed how to modify NTRUEnc to reduce security to standard problems in ideal lattices. In 2012, Lopez-Alt, Tromer and Vaikuntanathan proposed a fully homomorphic scheme based on this modified system. However, to allow homomorphic operations and prove security, a non-standard assumption is required. In...
Publication details
Date: 1 December 2013
Type: Inproceeding
Publisher: Springer Verlag
Anna Leontjeva, Moises Goldszmidt, Yinglian Xie, Fang Yu, and Martin Abadi
We investigate possible improvements in online fraud detection based on information about users and their interactions. We develop, apply, and evaluate our methods in the context of Skype. Specifically, in Skype, we aim to provide tools that identify fraudsters that have eluded the first line of detection systems and have been active for months. Our approach to automation is based on machine learning methods. We rely on a variety of features present in the data, including static user profiles (e.g., age),...
Publication details
Date: 1 November 2013
Type: Inproceeding
Publisher: ACM
Adam Doupe, Weidong Cui, Mariusz Jakubowski, Marcus Peinado, Christopher Kruegel, and Giovanni Vigna
Web applications are constantly under attack. They are popular, typically accessible from anywhere on the Internet, and they can be abused as malware delivery systems. Cross-site scripting flaws are one of the most common types of vulnerabilities that are leveraged to compromise a web application and its users. A large set of cross-site scripting vulnerabilities originates from the browser's confusion between data and code. That is, untrusted data input to the web application is sent to the clients'...
Publication details
Date: 1 November 2013
Type: Inproceeding
Publisher: ACM
Maria Christakis and Patrice Godefroid
We report in this paper how we proved memory safety of a complex Windows image parser written in low-level C in only three months of work and using only three core techniques, namely (1) symbolic execution at the x86 binary level, (2) exhaustive program path enumeration and testing, and (3) user-guided program decomposition and summarization. We also used a new tool, named MicroX, for executing code fragments in isolation using a custom virtual machine designed for testing purposes. As a result of this...
Publication details
Date: 1 November 2013
Type: Technical report
Number: MSR-TR-2013-120
Joppe W. Bos, Kristin Lauter, and Michael Naehrig
Increasingly, confidential medical records are being stored in data centers hosted by hospitals or large companies. As sophisticated algorithms for predictive analysis on medical data continue to be developed, it is likely that, in the future, more and more computation will be done on private patient data. While encryption provides a tool for assuring the privacy of medical information, it limits the functionality for operating on such data. Conventional encryption methods used today provide only very...
Publication details
Date: 1 September 2013
Type: Technical report
Number: MSR-TR-2013-81
Joppe W. Bos, Peter L. Montgomery, Daniel Shumow, and Greg Zaverucha
In this paper we present a parallel approach to compute \emph{interleaved} Montgomery multiplication. This approach is particularly suitable to be computed on 2-way single instruction, multiple data platforms as can be found on most modern computer architectures in the form of vector instruction set extensions. We have implemented this approach for tablet devices which run the x86 architecture (Intel Atom Z2760) using SSE2 instructions as well as devices which run on the ARM platform (Qualcomm MSM8960,...
Publication details
Date: 1 September 2013
Type: Inproceeding
Publisher: Springer
Joppe W. Bos, Craig Costello, and Michael Naehrig
We study exponentiations in pairing groups for the most common security levels and show that, although the Weierstrass model is preferable for pairing computation, it can be worthwhile to map to alternative curve representations for the non-pairing group operations in protocols.
Publication details
Date: 1 August 2013
Type: Inproceeding
Publisher: Springer
Martín Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, and Gil Segev
Motivated by the problem of avoiding duplication in storage systems, Bellare, Keelveedhi, and Ristenpart have recently put forward the notion of Message-Locked Encryption (MLE) schemes which subsumes convergent encryption and its variants. Such schemes do not rely on permanent secret keys, but rather encrypt messages using keys derived from the messages themselves. We strengthen the notions of security proposed by Bellare et al. by considering plaintext distributions that may depend on the public...
Publication details
Date: 1 August 2013
Type: Inproceeding
Publisher: Springer Verlag
Krishnaram Kenthapadi, Aleksandra Korolova, Ilya Mironov, and Nina Mishra
Suppose that party A collects private information about its users, where each user's data is represented as a bit vector. Suppose that party B has a proprietary data mining algorithm that requires estimating the distance between users, such as clustering or nearest neighbors. We ask if it is possible for party A to publish some information about each user so that B can estimate the distance between users without being able to infer any private bit of a user. Our method involves projecting each user's...
Publication details
Date: 1 July 2013
Type: Article
Jon Howell, Bryan Parno, and John R. Douceur
We envision a future where Web, mobile, and desktop applications are delivered as isolated, complete software stacks to a minimal, secure client host. This shift imbues app vendors with full autonomy to maintain their apps' integrity. Achieving this goal requires shifting complexity out of the client platform and replacing the required behavior inside the vendors' isolated apps. We ported rich, interactive POSIX apps, such as Gimp and Inkscape, to a spartan host platform. We describe this effort in...
Publication details
Date: 1 June 2013
Type: Inproceeding
Publisher: USENIX
Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova
We introduce a new characterization of the NP complexity class, called Quadratic Span Programs (QSPs), which is a natural extension of span programs defined by Karchmer and Wigderson. Our main motivation is the quick construction of succinct, easily verified arguments for NP statements. To achieve this goal, QSPs use a new approach to the well-known technique of arithmetization of Boolean circuits. Our new approach yields dramatic performance improvements. Using QSPs, we construct a NIZK argument --...
Publication details
Date: 30 May 2013
Type: Inproceeding
Publisher: International Association for Cryptologic Research
Bryan Parno, Craig Gentry, Jon Howell, and Mariana Raykova
To instill greater confidence in computations outsourced to the cloud, clients should be able to verify the correctness of the results returned. To this end, we introduce Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions. With Pinocchio, the client creates a public evaluation key to describe her computation; this setup is proportional to evaluating the computation once. The worker then evaluates the computation on a particular input...
Publication details
Date: 21 May 2013
Type: Inproceeding
Publisher: IEEE
1–25 of 218
Sort
Show 25 | 50 | 100
1234567Next 
> Our research