Sciweavers

13436 search results - page 2515 / 2688
» e
Sort
View
CCS
2008
ACM
15 years 7 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
CCS
2008
ACM
15 years 7 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
CCS
2008
ACM
15 years 7 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
ISPASS
2010
IEEE
15 years 7 months ago
Understanding transactional memory performance
Abstract—Transactional memory promises to generalize transactional programming to mainstream languages and data structures. The purported benefit of transactions is that they ar...
Donald E. Porter, Emmett Witchel
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
15 years 7 months ago
Active learning for biomedical citation screening
Active learning (AL) is an increasingly popular strategy for mitigating the amount of labeled data required to train classifiers, thereby reducing annotator effort. We describe ...
Byron C. Wallace, Kevin Small, Carla E. Brodley, T...
« Prev « First page 2515 / 2688 Last » Next »