Sciweavers

3210 search results - page 170 / 642
» Secure Similarity Search
Sort
View
JUCS
2002
120views more  JUCS 2002»
15 years 5 months ago
Instance Cooperative Memory to Improve Query Expansion in Information Retrieval Systems
The main goal of this research is to improve Information Retrieval Systems by enabling them to generate search outcomes that are relevant and customized to each specific user. Our ...
Lobna Jeribi, Béatrice Rumpler
AES
2004
Springer
204views Cryptology» more  AES 2004»
15 years 11 months ago
The Boomerang Attack on 5 and 6-Round Reduced AES
In this note we study security of 128-bit key 10-round AES against the boomerang attack. We show attacks on AES reduced to 5 and 6 rounds, much faster than the exhaustive key searc...
Alex Biryukov
IJNSEC
2008
132views more  IJNSEC 2008»
15 years 6 months ago
An Authenticated Key Agreement Protocol Using Conjugacy Problem in Braid Groups
In this paper we propose an authenticated key agreement, which works in a braid group. We prove that our protocol meet the security attributes under the assumption that the Conjug...
Atul Chaturvedi, Sunder Lal
CP
2005
Springer
15 years 11 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
DEXA
2003
Springer
193views Database» more  DEXA 2003»
15 years 11 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs