We investigate space complexity hierarchies of three-dimensional Turing machines whose input tapes are restricted to cubic ones, and show that there exists an infinite hierarchy among the classes of sets accepted by space-bounded three-dimensional deterministic or nondeterministic Turing machines with cubic inputs.