Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Probabilistic methods in number-theoretic algorithms and digital signature schemes
Probabilistic methods in number-theoretic algorithms and digital signature schemes
How to construct random functions
Journal of the ACM (JACM)
Computing logarithms in GF(2n)
Proceedings of CRYPTO 84 on Advances in cryptology
Efficient and secure pseudo-random number generation
Proceedings of CRYPTO 84 on Advances in cryptology
RSA/Rabin least significant bits are 1-2- + 1/poly(log N) secure
Proceedings of CRYPTO 84 on Advances in cryptology
Simultaneous security of bits in the discrete log
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A pseudo-random bit generator based on elliptic logarithms
Proceedings on Advances in cryptology---CRYPTO '86
Inferring sequences produced by pseudo-random number generators
Journal of the ACM (JACM)
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
More efficient DDH pseudorandom generators
Designs, Codes and Cryptography
Efficient primitives from exponentiation in Zp
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
Blum and Micali [4] showed how to hide one bit using the discrete logarithm function. In this paper we show how to hide c•loglog p bits for any constant c, where p is the modulus.