Sciweavers

458 search results - page 49 / 92
» Perfect Skolem sets
Sort
View
IACR
2011
134views more  IACR 2011»
13 years 11 months ago
An Exploration of the Kolmogorov-Smirnov Test as Competitor to Mutual Information Analysis
A theme of recent side-channel research has been the quest for distinguishers which remain eective even when few assumptions can be made about the underlying distribution of the m...
Carolyn Whitnall, Elisabeth Oswald, Luke Mather
HPCA
2006
IEEE
16 years 5 days ago
Store vectors for scalable memory dependence prediction and scheduling
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
Samantika Subramaniam, Gabriel H. Loh
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 28 days ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
ICPR
2008
IEEE
16 years 1 months ago
Securing fingerprint template: Fuzzy vault with minutiae descriptors
Fuzzy vault has been shown to be an effective technique for securing fingerprint minutiae templates. Its security depends on the difficulty in identifying the set of genuine minut...
Abhishek Nagar, Anil K. Jain, Karthik Nandakumar
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 13 days ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito