Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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? – orlp Oct 17 '13 at 8:22

Your Answer


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

Browse other questions tagged or ask your own question.