5473 search results - page 37 / 1095 » On the graph isomorphism problem |
CPC
2006
14 years 12 months ago
2006
We study relational structures (especially graphs and posets) which satisfy the analogue of homogeneity but for homomorphisms rather than isomorphisms. The picture is rather diffe...
CRYPTO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we revisit one of the most popular passwordbased key exchange protocols, namely the OKE (for Open Key Exchange) scheme, proposed by Luck in 1997. Our result...
121
click to vote
DAM
2011
14 years 6 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
116
click to vote
JOC
2007
14 years 11 months ago
2007
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...