Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Are the proofs based on a PRF assumption still valid when using a variable-length input PRF ?

The answer might be obvious, but I have a doubt.

share|improve this question
    
I think it generally is true but the devil is in the details. Any particular protocol/algorithm you're looking at? –  nightcracker Oct 17 '13 at 8:22
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.