Institution
Worcester Polytechnic Institute
Education•Worcester, Massachusetts, United States•
About: Worcester Polytechnic Institute is a education organization based out in Worcester, Massachusetts, United States. It is known for research contribution in the topics: Computer science & Population. The organization has 6270 authors who have published 12704 publications receiving 332081 citations. The organization is also known as: WPI.
Topics: Computer science, Population, Data envelopment analysis, Nonlinear system, Finite element method
Papers published on a yearly basis
Papers
More filters
•
TL;DR: The results of this study show that there is a great security risk to OpenSSL AES implementation running on VMware cloud services when the deduplication is not disabled.
Abstract: In cloud computing, efficiencies are reaped by resource sharing such as co-location of computation and deduplication of data. This work exploits resource sharing in virtualization software to build a powerful cache-based attack on AES. We demonstrate the vulnerability by mounting Cross-VM Flush+Reload cache attacks in VMware VMs to recover the keys of an AES implementation of OpenSSL 1.0.1 running inside the victim VM. Furthermore, the attack works in a realistic setting where different VMs are located on separate cores. The modified flush+reload attack we present, takes only in the order of seconds to minutes to succeed in a cross-VM setting. Therefore long term co-location, as required by other fine grain attacks in the literature, are not needed. The results of this study show that there is a great security risk to OpenSSL AES implementation running on VMware cloud services when the deduplication is not disabled.
207 citations
••
TL;DR: An approach for determining the frontier points for inefficient DMUs within the framework of two-stage DEA is developed.
206 citations
•
TL;DR: In this article, a processor architecture for elliptic curves cryptosystems over fields GF(2 m ) is proposed, which is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curve and finite fields.
Abstract: This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2 m ) This is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curves and finite fields The main features of this architecture are the use of an optimized bit-parallel squarer, a digit-serial multiplier, and two programmable processors Through reconfiguration, the squarer and the multiplier architectures can be optimized for any field order or field polynomial The multiplier performance can also be scaled according to system's needs Our results show that implementations of this architecture executing the projective coordinates version of the Montgomery scalar multiplication algorithm can compute elliptic curve scalar multiplications with arbitrary points in 021 msec in the field GF(2 167 ) A result that is at least 19 times faster than documented hardware implementations and at least 37 times faster than documented software implementations
205 citations
••
TL;DR: In this article, a simple model based on Butler-Volmer kinetics for electrodes and transport resistance in the polymer electrolyte is analyzed for water electrolysis by using a simple circuit analogy for the sequential kinetic and transport resistances.
205 citations
••
07 Jan 2010TL;DR: This research shows that it is possible for third-parties to link PII, which is leaked via OSNs, with user actions both within OSN sites and elsewhere on non-OSN sites.
Abstract: For purposes of this paper, we define "Personally identifiable information" (PII) as information which can be used to distinguish or trace an individual's identity either alone or when combined with other information that is linkable to a specific individual. The popularity of Online Social Networks (OSN) has accelerated the appearance of vast amounts of personal information on the Internet. Our research shows that it is possible for third-parties to link PII, which is leaked via OSNs, with user actions both within OSN sites and elsewhere on non-OSN sites. We refer to this ability to link PII and combine it with other information as "leakage". We have identified multiple ways by which such leakage occurs and discuss measures to prevent it.
204 citations
Authors
Showing all 6336 results
Name | H-index | Papers | Citations |
---|---|---|---|
Andrew G. Clark | 140 | 823 | 123333 |
Ming Li | 103 | 1669 | 62672 |
Joseph Sarkis | 101 | 482 | 45116 |
Arthur C. Graesser | 95 | 614 | 38549 |
Kevin J. Harrington | 85 | 682 | 33625 |
Kui Ren | 83 | 501 | 32490 |
Bart Preneel | 82 | 844 | 25572 |
Ming-Hui Chen | 82 | 525 | 29184 |
Yuguang Fang | 79 | 572 | 20715 |
Wenjing Lou | 77 | 311 | 29405 |
Bernard Lown | 73 | 330 | 20320 |
Joe Zhu | 72 | 231 | 19017 |
Y.S. Lin | 71 | 304 | 16100 |
Kevin Talbot | 71 | 268 | 15669 |
Christof Paar | 69 | 399 | 21790 |