A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfectly one-way probabilistic hash functions (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the (non)Universality of the One-Time Pad
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On the Impossibility of Private Key Cryptography with Weakly Random Keys
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Does privacy require true randomness?
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Obfuscation for cryptographic purposes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
POSH: a generalized captcha with security applications
Proceedings of the 1st ACM workshop on Workshop on AISec
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On cryptography with auxiliary input
Proceedings of the forty-first annual ACM symposium on Theory of computing
Towards Security Notions for White-Box Cryptography
ISC '09 Proceedings of the 12th International Conference on Information Security
On strong simulation and composable point obfuscation
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
A note on obfuscation for cryptographic functionalities of secret-operation then public-encryption
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A general and efficient obfuscation for programs with tamper-proof hardware
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
On obfuscating programs with tamper-proof hardware
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Secure obfuscation of encrypted verifiable encrypted signatures
ProvSec'11 Proceedings of the 5th international conference on Provable security
Multi-stage binary code obfuscation using improved virtual machine
ISC'11 Proceedings of the 14th international conference on Information security
On symmetric encryption and point obfuscation
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Obfuscation of hyperplane membership
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Secure obfuscation for encrypted signatures
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Program obfuscation with leaky hardware
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
A note on (im)possibilities of obfuscating programs of zero-knowledge proofs of knowledge
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Point obfuscation and 3-round zero-knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Functional re-encryption and collusion-resistant obfuscation
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Black-box obfuscation for d-CNFs
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
We construct obfuscators of point functions with multibit output and other related functions. A point function with multibit output returns a fixed string on a single input point and zero everywhere else. Obfuscation of such functions has a useful application as a strong form of symmetric encryption which guarantees security even when the key has very low entropy: Essentially, learning information about the plaintext is paramount to finding the key via exhaustive search on the key space. Although the constructions appear to be simple and modular, their analysis turns out to be quite intricate. In particular, we uncover some weaknesses in the current definitions of obfuscation. One weakness is that current definitions do not guarantee security even under very weak forms of composition. We thus define a notion of obfuscation that is preserved under an appropriate composition operation. The constructions can use any obfuscator of point functions under the proposed definition. Alternatively, they can use perfect one way (POW) functions with statistical indistinguishability, or with computational indistinguishability at the price of somewhat weaker security.