Sciweavers

892 search results - page 94 / 179
» et 2007
Sort
View
DAM
2007
76views more  DAM 2007»
13 years 8 months ago
Super-simple (v, 5, 4) designs
Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-si...
Kejun Chen, Ruizhong Wei
DAM
2007
79views more  DAM 2007»
13 years 8 months ago
Necessary conditions for multistationarity in discrete dynamical systems
R. Thomas conjectured, twenty years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of severa...
Adrien Richard, Jean-Paul Comet
ENTCS
2007
109views more  ENTCS 2007»
13 years 8 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
IJISEC
2007
88views more  IJISEC 2007»
13 years 8 months ago
Secure group key establishment revisited
Abstract. We examine the popular proof models for group key establishment of Bresson et al. [BCPQ01,BCP01] and point out missing security properties addressing malicious protocol p...
Jens-Matthias Bohli, Maria Isabel Gonzalez Vasco, ...
INFORMATICALT
2007
119views more  INFORMATICALT 2007»
13 years 8 months ago
Analysis and Improvements of Two Identity-Based Perfect Concurrent Signature Schemes
The notion of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004. In concurrent signature schemes, two entities can produce t...
Zhenjie Huang, Kefei Chen, Xuanzhi Lin, Rufen Huan...