Sciweavers

3228 search results - page 349 / 646
» Computationally Sound Proofs
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 8 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
MPC
1992
Springer
235views Mathematics» more  MPC 1992»
15 years 8 months ago
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
Berry Schoenmakers
EUROCRYPT
2006
Springer
15 years 7 months ago
Compact Group Signatures Without Random Oracles
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
Xavier Boyen, Brent Waters
FC
2008
Springer
102views Cryptology» more  FC 2008»
15 years 5 months ago
Identity Theft: Much Too Easy? A Study of Online Systems in Norway
Governments and commercial companies connect more and more computer systems to the Internet, giving people easier access to services. Many of these online services handle personal ...
André N. Klingsheim, Kjell Jørgen Ho...
ISCAPDCS
2008
15 years 5 months ago
Parallel Embedded Systems: Where Real-Time and Low-Power Meet
This paper introduces a combination of models and proofs for optimal power management via Dynamic Frequency Scaling and Dynamic Voltage Scaling. The approach is suitable for syste...
Zdravko Karakehayov, Yu Guo