Sciweavers

976 search results - page 93 / 196
» Evaluating Adversarial Partitions
Sort
View
SIGIR
2011
ACM
12 years 11 months ago
Learning to rank from a noisy crowd
We study how to best use crowdsourced relevance judgments learning to rank [1, 7]. We integrate two lines of prior work: unreliable crowd-based binary annotation for binary classi...
Abhimanu Kumar, Matthew Lease
CCS
2011
ACM
12 years 8 months ago
How to break XML encryption
XML Encryption was standardized by W3C in 2002, and is implemented in XML frameworks of major commercial and open-source organizations like Apache, redhat, IBM, and Microsoft. It ...
Tibor Jager, Somorovsky Juraj
CCS
2011
ACM
12 years 8 months ago
Automated black-box detection of side-channel vulnerabilities in web applications
Web applications divide their state between the client and the server. The frequent and highly dynamic client-server communication that is characteristic of modern web application...
Peter Chapman, David Evans
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
12 years 8 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...