The authors discuss what is a proof, what is provable security, and what are approaches to provable security. Think that provable security is asymptotic, relative, and dynamic, is only a complement to but not a replacement of exact security or concrete security from security analysis, and should not tempt cryptology, a type of bit magic, to deviate the technological track. Also think that any academic conclusion should be checked and verified by practices or experiments as much as possible. Lastly, a reward is offered for the subexponential-time solution of the three REESSE1+ one-way problems: MPP, ASPP, and TLP with n >= 80 and log2 M >= 80, which may be regarded as a type of security proof by experiment.
View on arXiv