This talk considers the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. We will present new achievability and converse bounds, which are tighter than existing bounds. The bounds also lead to the tightest second-order coding rate for discrete memoryless and Gaussian wiretap channels. Finally, we will characterize the optimal tradeoff between reliability and secrecy for semi-deterministic wiretap channels at finite blocklength.