A threshold signature allows one to delegate its signing rights to n parties, such that any subset of size t can sign a message on their behalf. In this work, we show how to construct threshold signatures for any t and n from one way functions, thus establishing the latter as a necessary and sufficient computational assumption. Our protocol makes non-black box use of one-way functions, and can be generalized to other access structures, such as monotone policies.