A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits

Authors:
Eike Kiltz
Affiliations:
-
Venue:
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Year:
2001

Citing 5
Cited 1

A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Spectral Bounds on General Hard Core Predicates

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
All Bits ax+b mod p are Hard (Extended Abstract)

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Universal hash functions & hard core bits

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques

Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a useful primitive, the hidden number problem, which can be exploited to prove that every bit is a hard core of specific cryptographic functions. Applications are RSA, ElGamal, Rabin and others. We give an efficient construction of a hard core predicate of any one-way function providing an alternative to the famous Goldreich-Levin Bit [3]. Furthermore, a conjectured connection between universal hash functions and hard core predicates is disproven.