Probabilistic communication complexity
Journal of Computer and System Sciences
Communication complexity
Polynomial Interpolation of the Discrete Logarithm
Designs, Codes and Cryptography
Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Towards Proving Strong Direct Product Theorems
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Threshold circuit lower bounds on cryptographic functions
Journal of Computer and System Sciences
Complexity theoretic aspects of some cryptographic functions
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
In this work we give a non-trivial upper bound on the spectral norm of various Boolean predicates of the Diffie-Hellman function. For instance, we consider every individual bit and arbitrary unbiased intervals. Combining the bound with recent results from complexity theory we can rule out the possibility that such a Boolean function can be represented by simple functions like depth-2 threshold circuits with a small number of gates.