Sciweavers

849 search results - page 75 / 170
» Secure Applications of Low-Entropy Keys
Sort
View
CRYPTO
2007
Springer
105views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...
Emmanuel Bresson, Yassine Lakhnech, Laurent Mazar&...
ACSAC
2000
IEEE
14 years 2 months ago
The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip
The performance of RSA hardware is primarily determined by an efficient implementation of the long integer modular arithmetic and the ability to utilize the Chinese Remainder The...
Johann Großschädl
KDD
2003
ACM
210views Data Mining» more  KDD 2003»
14 years 10 months ago
Privacy-preserving k-means clustering over vertically partitioned data
Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. The key ...
Jaideep Vaidya, Chris Clifton
EUROCRYPT
2001
Springer
14 years 2 months ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
Eric R. Verheul
IJNSEC
2008
115views more  IJNSEC 2008»
13 years 10 months ago
Improving Security Through Analysis of Log Files Intersections
The paper discusses our research in development of general and systematic methods for intrusion prevention. The key idea is to use data mining techniques to discover repeated patt...
Kazimierz Kowalski, Mohsen Beheshti