Is there a language which has a polynomial length certificate but not known to have a polynomial time verifier?
For any instance of a problem, take the instance itself as the certificate. Linear size, verifiable in polynomial time for problems in P, not known for problems in NP.