ECCC
2000
13 years 11 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
COLT
1991
Springer
14 years 3 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
TCC
2009
Springer
15 years 16 hour ago
2009
Springer
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...