Sciweavers

PLDI
2011
ACM
14 years 17 days ago
EnerJ: approximate data types for safe and general low-power computation
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
Adrian Sampson, Werner Dietl, Emily Fortuna, Danus...
PLDI
2011
ACM
14 years 17 days ago
Language-independent sandboxing of just-in-time compilation and self-modifying code
When dealing with dynamic, untrusted content, such as on the Web, software behavior must be sandboxed, typically through use of a language like JavaScript. However, even for such ...
Jason Ansel, Petr Marchenko, Úlfar Erlingss...
PKC
2011
Springer
169views Cryptology» more  PKC 2011»
14 years 17 days ago
Cryptanalysis of the RSA Subgroup Assumption from TCC 2005
At TCC 2005, Groth underlined the usefulness of working in small RSA subgroups of hidden order. In assessing the security of the relevant hard problems, however, the best attack co...
Jean-Sébastien Coron, Antoine Joux, Avradip...
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
14 years 17 days ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
PKC
2011
Springer
197views Cryptology» more  PKC 2011»
14 years 17 days ago
Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
We investigate the security of a generalization of HFE (multivariate and odd-characteristic variants). First, we propose an improved version of the basic Kipnis-Shamir key recovery...
Luk Bettale, Jean-Charles Faugère, Ludovic ...
PKC
2011
Springer
212views Cryptology» more  PKC 2011»
14 years 17 days ago
On the Correct Use of the Negation Map in the Pollard rho Method
Bos, Kaihara, Kleinjung, Lenstra, and Montgomery recently showed that ECDLPs on the 112-bit secp112r1 curve can be solved in an expected time of 65 years on a PlayStation 3. This p...
Daniel J. Bernstein, Tanja Lange, Peter Schwabe
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
14 years 17 days ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
PERVASIVE
2011
Springer
14 years 17 days ago
Disaggregated End-Use Energy Sensing for the Smart Grid
Most utility installed energy meters are primarily intended to support a utility's billing function. They report only the aggregate energy consumption of a home or business o...
Jon Froehlich, Eric Larson, Sidhant Gupta, Gabe Co...
PERVASIVE
2011
Springer
14 years 17 days ago
n-Gram Geo-trace Modeling
As location-sensing smart phones and location-based services gain mainstream popularity, there is increased interest in developing techniques that can detect anomalous activities. ...
Senaka Buthpitiya, Ying Zhang, Anind K. Dey, Marti...
PERVASIVE
2011
Springer
14 years 17 days ago
Hybrid Prototyping by Using Virtual and Miniature Simulation for Designing Spatial Interactive Information Systems
Abstract. In this paper, we introduce CityCompiler, an integrated environment for the iteration-based development of spatial interactive systems. CityCompiler visualizes interactiv...
Yasuto Nakanishi, Koji Sekiguchi, Takuro Ohmori, S...