793 search results - page 109 / 159 » Argumentation and standards of proof |
ESORICS
2007
Springer
14 years 5 months ago
2007
Springer
A formal treatment to the privacy of concealed data aggregation (CDA) is given. While there exist a handful of constructions, rigorous security models and analyses for CDA are stil...
IPPS
2006
IEEE
14 years 5 months ago
2006
IEEE
Reconfigurable computing systems have already shown their abilities to accelerate embedded hardware/ software systems. Since standard processor-based embedded applications have co...
FCT
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
PKC
2004
Springer
14 years 4 months ago
2004
Springer
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
TPHOL
2003
IEEE
14 years 4 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...