76 search results - page 7 / 16 » On Boolean Functions with Generalized Cryptographic Properti... |
ECCC
2011
13 years 2 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
BMCBI
2002
13 years 7 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
IWSEC
2009
Springer
14 years 2 months ago
2009
Springer
Reducing the minimum assumptions needed to construct various cryptographic primitives is an important and interesting task in theoretical cryptography. Oblivious Transfer, one of ...