The complexity of Boolean functions
The complexity of Boolean functions
One-way functions and Pseudorandom generators
Combinatorica - Theory of Computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
The Complexity of Computing
Constructions of Freebly-One-Way Families of Permutations
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
On robust combiners for oblivious transfer and other primitives
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Gate elimination for linear functions and new feebly secure constructions
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Cryptographic analysis of all 4 × 4-bit s-boxes
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
| Hi-index | 0.00 |
In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions . These functions are provably harder to invert than to compute, but the complexity (viewed as circuit complexity over circuits with arbitrary binary gates) is amplified by a constant factor only (with the factor approaching 2). In traditional cryptography, one-way functions are the basic primitive of private-key and digital signature schemes, while public-key cryptosystems are constructed with trapdoor functions. We continue Hiltgen's work by providing an example of a feebly trapdoor function where the adversary is guaranteed to spend more time than every honest participant by a constant factor of $\frac{25}{22}$.