Sciweavers

515 search results - page 28 / 103
» Secure Parameters for SWIFFT
Sort
View
ASIACRYPT
2010
Springer
13 years 8 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld
IEEEHPCS
2010
13 years 8 months ago
Fast learning for multibiometrics systems using genetic algorithms
The performance (in term of error rate) of biometric systems can be improved by combining them. Multiple fusion techniques can be applied from classical logical operations to more...
Romain Giot, Mohamad El-Abed, Christophe Rosenberg...
IJNSEC
2010
98views more  IJNSEC 2010»
13 years 4 months ago
A Random Bit Generator Using Chaotic Maps
Chaotic systems have many interesting features such as sensitivity on initial condition and system parameter, ergodicity and mixing properties. In this paper, we exploit these int...
Narendra K. Pareek, Vinod Patidar, Krishan K. Sud
IJNSEC
2010
112views more  IJNSEC 2010»
13 years 4 months ago
Detecting Connection-Chains: A Data Mining Approach
A connection-chain refers to a mechanism in which someone recursively logs into a host, then from there logs into another host, and so on. Connection-chains represent an important...
Ahmad Almulhem, Issa Traoré
IJNSEC
2010
116views more  IJNSEC 2010»
13 years 4 months ago
Modelling and Analyzing Passive Worms over Unstructured Peer-to-Peer Networks
Passive worm have posed serious security threats to the functioning of unstructured P2P networks. A delayed SEIRS epidemic model with death, off line and online rate is constructe...
Fangwei Wang, Yunkai Zhang, Jianfeng Ma