Semi-quantum protocols that allow some of the users to remain classical are proposed for a large class of problems associated with secure communication and secure multiparty computation. Specifically, first time semi-quantum protocols are proposed for key agreement, controlled deterministic secure communication and dialogue, and it is shown that the semi-quantum protocols for controlled deterministic secure communication and dialogue can be reduced to semi-quantum protocols for ecommerce and private comparison (socialist millionaire problem), respectively. Complementing with the earlier proposed semi-quantum schemes for key distribution, secret sharing and deterministic secure communication, set of schemes proposed here and subsequent discussions have established that almost every secure communication and computation tasks that can be performed using fully quantum protocols can also be performed in semi-quantum manner. Further, it addresses a fundamental question in context of a large number problems-how much quantumness is (how many quantum parties are) required to perform a specific secure communication task? Some of the proposed schemes are completely orthogonal-state-based, and thus, fundamentally different from the existing semi-quantum schemes that are conjugate-coding-based. Security, efficiency and applicability of the proposed schemes have been discussed with appropriate importance.Keywords: Semi-quantum protocol, quantum communication, key agreement, quantum dialogue, deterministic secure quantum communication, secure direct quantum communication. * plored using quantum resources. On the one hand, a large number of conjugate-coding-based (BB84type) schemes [2-4] have been proposed for various tasks including QKD [2-4], quantum key agreement (QKA) [5], quantum secure direct communication (QSDC) [6, 7], deterministic secure quantum communication (DSQC) [8,9], quantum e-commerce [10], quantum dialogue [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30], etc., on the other hand, serious attempts have been made to answer two extremely important foundational questions-(1) Is conjugate coding necessary for secure quantum communication? (2) How much quantumness is needed for achieving unconditional security? Alternatively, whether all the users involved in a secure communication scheme are required to be quantum in the sense of their capacity to perform quantum measurement, prepare quantum states in more than one mutually unbiased basis (MUBs) and/or the ability to store quantum information? Efforts to answer the first question have led to a set of orthogonal-state-based schemes [5,[31][32][33][34], where security is obtained without using our inability to simultaneously measure a quantum state using two or more MUBs. These orthogonal-state-based schemes [5,[31][32][33][34] have strongly established that any cryptographic task that can be performed using a conjugate-coding-based scheme can also be performed using an orthogonal-state-based scheme. Similarly, efforts to answer the sec...