Secret-key cryptography from ideal primitives: A systematic verview Gazi, Peter Tessaro, Stefano Secret-key constructions are often proved secure in a model where one or more underlying components are replaced by an idealized oracle accessible to the attacker. This model gives rise to information-theoretic security analyses, and several advances have been made in this area over the last few years. This paper provides a systematic overview of what is achievable in this model, and how existing works fit into this view. IEEE 2015 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text https://research-explorer.ista.ac.at/record/1645 Gazi P, Tessaro S. Secret-key cryptography from ideal primitives: A systematic verview. In: <i>2015 IEEE Information Theory Workshop</i>. IEEE; 2015. doi:<a href="https://doi.org/10.1109/ITW.2015.7133163">10.1109/ITW.2015.7133163</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1109/ITW.2015.7133163 info:eu-repo/semantics/closedAccess