Sciweavers

3996 search results - page 611 / 800
» A Publish
Sort
View
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 7 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
CHI
2009
ACM
16 years 7 months ago
Designing for discovery: opening the hood for open-source end user tinkering
According to the Free Software Movement, the user ought to have "the freedoms to make changes, and to publish improved versions" and "to study how the program works...
Gifford Cheung, Parmit Chilana, Shaun K. Kane, Bra...
EUROCRYPT
2009
Springer
16 years 7 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
PKC
2009
Springer
140views Cryptology» more  PKC 2009»
16 years 7 months ago
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Abstract. The success of electronic authentication systems, be it eID card systems or Internet authentication systems such as CardSpace, highly depends on the provided level of use...
Jan Camenisch, Markulf Kohlweiss, Claudio Soriente
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 7 months ago
Turning down the noise in the blogosphere
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guidin...
Khalid El-Arini, Gaurav Veda, Dafna Shahaf, Carlos...