Sciweavers

3172 search results - page 382 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
IDTRUST
2009
ACM
16 years 1 months ago
Usable trust anchor management
Security in browsers is based upon users trusting a set of root Certificate Authorities (called Trust Anchors) which they may know little or nothing about. Browser vendors face a...
Massimiliano Pala, Scott A. Rea
SC
2009
ACM
16 years 1 months ago
Robust workflows for science and engineering
Scientific workflow tools allow users to specify complex computational experiments and provide a good framework for robust science and engineering. Workflows consist of pipelines ...
David Abramson, Blair Bethwaite, Colin Enticott, S...
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
16 years 1 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
DSD
2009
IEEE
144views Hardware» more  DSD 2009»
16 years 1 months ago
Composable Resource Sharing Based on Latency-Rate Servers
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
Benny Akesson, Andreas Hansson, Kees Goossens
MICRO
2009
IEEE
113views Hardware» more  MICRO 2009»
16 years 1 months ago
The BubbleWrap many-core: popping cores for sequential acceleration
Many-core scaling now faces a power wall. The gap between the number of cores that fit on a die and the number that can operate simultaneously under the power budget is rapidly i...
Ulya R. Karpuzcu, Brian Greskamp, Josep Torrellas