Sciweavers

5084 search results - page 372 / 1017
» Proving Possibility Properties
Sort
View
IJNSEC
2008
145views more  IJNSEC 2008»
15 years 6 months ago
Efficient Certificateless Authentication and Key Agreement (CL-AK) for Grid Computing
Most of the current security architectures for grid systems use conventional public key infrastructure (PKI) to authenticate grid members and to secure resource allocation to thes...
Shengbao Wang, Zhenfu Cao, Haiyong Bao
COMBINATORICA
2007
117views more  COMBINATORICA 2007»
15 years 6 months ago
Embedding nearly-spanning bounded degree trees
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
Noga Alon, Michael Krivelevich, Benny Sudakov
COMBINATORICS
2007
70views more  COMBINATORICS 2007»
15 years 6 months ago
Gray-ordered Binary Necklaces
A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1, . . . , k − 1} under cyclic rotation. In this paper we define an ordering on t...
Christopher Degni, Arthur A. Drisko
200
Voted
ISCI
2008
160views more  ISCI 2008»
15 years 6 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan
JAR
2008
89views more  JAR 2008»
15 years 6 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff