Sciweavers

4126 search results - page 647 / 826
» Relationships with other Formalisms
Sort
View
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 10 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 10 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
LACL
1998
Springer
15 years 10 months ago
Strict Compositionality and Literal Movement Grammars
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
Marcus Kracht
NDSS
1997
IEEE
15 years 10 months ago
Hierarchical Organization of Certification Authorities for Secure Environments
This paper presents a model of hierarchical organization of Certification Authorities which can be applied to any open system network. In order to study the feasibility of the pro...
Lourdes López Santidrián, Justo Carr...
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
15 years 10 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi