Our main result is a generalized Dillon-type theorem, giving graph-theoretic conditions which guarantee that a $p$-ary function in an even number of variables is bent, for $p$ a prime number greater than 2. The key condition is that the component Cayley graphs associated to the values of the function are strongly regular, and either all of Latin square type, or all of negative Latin square type. Such a Latin or negative Latin square type bent function is regular or weakly regular, respectively. Its dual function has component Cayley graphs with the same parameters as those of the original function. We also give a criterion for bent functions involving structure constants of association schemes. We prove that if a $p$-ary function with component Cayley graphs of feasible degrees determines an amorphic association scheme, then it is bent. Since amorphic association schemes correspond to strongly regular graph decompositions of Latin or negative Latin square type, this result is equivalent to our main theorem. We show how to construct bent functions from orthogonal arrays and give some examples.