Cryptology ePrint Archive: Report 2006/229

Another Look at "Provable Security". II

Neal Koblitz and Alfred Menezes

Abstract: We discuss the question of how to interpret reduction arguments in cryptography. We give some examples to show the subtlety and difficulty of this question.

Category / Keywords:

Date: received 3 Jul 2006, last revised 13 Jul 2006

Contact author: ajmeneze at uwaterloo ca

Available formats: PDF | BibTeX Citation

Version: 20060713:095426 (All versions of this report)

Discussion forum: Show discussion | Start new discussion