Sciweavers

707 search results - page 75 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
ECAI
2006
Springer
13 years 11 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 8 months ago
The one-way communication complexity of the Boolean Hidden Matching Problem
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
Iordanis Kerenidis, Ran Raz
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 8 months ago
Doubly Perfect Nonlinear Boolean Permutations
Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secretkey block ciphers. This choice directly induces the cl...
Laurent Poinsot
KDD
2004
ACM
110views Data Mining» more  KDD 2004»
14 years 8 months ago
Generalizing the notion of support
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....
Michael Steinbach, Pang-Ning Tan, Hui Xiong, Vipin...
CHES
2000
Springer
121views Cryptology» more  CHES 2000»
13 years 11 months ago
On Boolean and Arithmetic Masking against Differential Power Analysis
Abstract. Since the announcement of the Differential Power Analysis (DPA) by Paul Kocher and al., several countermeasures were proposed in order to protect software implementations...
Jean-Sébastien Coron, Louis Goubin