769 search results - page 141 / 154 » Where Is the Proof |
ACISP
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
ASIACRYPT
2001
Springer
14 years 1 days ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
ALT
1998
Springer
13 years 11 months ago
1998
Springer
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
PET
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. As the popularity of social networks expands, the information users expose to the public has potentially dangerous implications for individual privacy. While social netwo...
GFKL
2007
Springer
13 years 11 months ago
2007
Springer
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...