|
Mar
21 |
|
answered | Probability of being B smooth |
|
Dec
2 |
|
answered | Justifying simplifying assumption about message distributions for perfectly secret encryption? |
|
Dec
2 |
|
answered | NIZK proofs: Why is the prove function necessary? |
|
Aug
27 |
|
awarded | Yearling |
|
Aug
27 |
|
awarded | Yearling |
|
Jun
7 |
|
awarded | Nice Question |
|
May
8 |
|
awarded | Scholar |
|
May
8 |
|
accepted | Non-uniform hierarchy theorem for approximating functions |
|
May
8 |
|
revised |
Non-uniform hierarchy theorem for approximating functions Added a partial answer |
|
May
8 |
|
comment |
Non-uniform hierarchy theorem for approximating functions Thanks! This looks like exactly what I am looking for. I'm leaving the question open for now in case someone is aware of (1) a more recent reference, and/or (2) a statement of the results I am looking for so I don't have to go re-derive them myself. =) |
|
May
7 |
|
asked | Non-uniform hierarchy theorem for approximating functions |
|
Apr
25 |
|
comment |
Overwriting saved eip to point to stdin? @OliCharlesworth: so does ASLR randomize the location of stdio on the heap? |
|
Apr
25 |
|
comment |
Overwriting saved eip to point to stdin? Yes, I mean the stdio buffer on the heap. What is interesting here is that the exploit works <em>even if the shellcode does not get written onto the stack at all</em> (e.g., if the overflow allows the saved eip to be overwritten, but does not copy the shellcode itself). |
|
Apr
25 |
|
answered | Rabins Signature Implementation |
|
Apr
25 |
|
asked | Overwriting saved eip to point to stdin? |
|
Apr
24 |
|
answered | Are linear feedback shift registers being generally discouraged by cryptologists? |
|
Apr
24 |
|
comment |
"forward-secure" zero knowledge protocols The standard notion of zero knowledge is <em>auxiliary-input</em> zero knowledge, which is preserved even if the distinguisher is given <em>any</em> auxiliary input (in particular the random bits used to generate the instance to be proven). |
|
Apr
22 |
|
answered | How much bigger does a precomputed lookup table get when salt is added? |
|
Apr
22 |
|
comment |
Variants of direct product theorems I would also be interested if any weaker results are known, e.g., that computing $k$ copies of $f$ requires size $s+O(k)$... |
|
Apr
22 |
|
comment |
Variants of direct product theorems I took a look at Chapter 10.2 of Wegener's book (thanks for the reference!) that shows that a direct-sum result cannot hold in general. But is anything known for specific $f$ (perhaps those having circuit complexity smaller than $2^n$)? (I am still interested in worst-case complexity, and for arbitrary circuits.) |
