What is the formal definition of Random Reducibility>
Arora/Barak is like:
"yeah, so it's kind like you take an instance of a problem, create n random instances of the problem; and if you have the solution to those n instanes; then in polynomial time you can solve your original instance."
doesn't seem much better -- giving examples rather than a rigorous definition.
What is the rigorous definition of random self-reducibility? [And why do people tend to give hand wavey definitions?]