3115 search results - page 595 / 623 » Synthesizing Secure Protocols |
135
click to vote
JCP
2008
15 years 3 months ago
2008
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
150
click to vote
ENTCS
2007
15 years 3 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
134
click to vote
NETWORK
2006
15 years 3 months ago
2006
As voice over IP gains popularity, it is easy to imagine that Internet hacking and other security problems we currently face with email spam will attack the VoIP environment. In c...
127
click to vote
SIGCSE
2008
ACM
15 years 3 months ago
2008
ACM
Early undergraduate Grid computing courses generally took a bottom-up approach to Grid computing education starting with network protocols, client-server concepts, creating Web an...
117
click to vote
IJISEC
2007
15 years 3 months ago
2007
Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymo...