{"_id":"1645","type":"conference","publication":"2015 IEEE Information Theory Workshop","publisher":"IEEE","citation":{"ama":"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>","ista":"Gazi P, Tessaro S. 2015. Secret-key cryptography from ideal primitives: A systematic verview. 2015 IEEE Information Theory Workshop. ITW 2015: IEEE Information Theory Workshop, 7133163.","ieee":"P. Gazi and S. Tessaro, “Secret-key cryptography from ideal primitives: A systematic verview,” in <i>2015 IEEE Information Theory Workshop</i>, Jerusalem, Israel, 2015.","short":"P. Gazi, S. Tessaro, in:, 2015 IEEE Information Theory Workshop, IEEE, 2015.","mla":"Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal Primitives: A Systematic Verview.” <i>2015 IEEE Information Theory Workshop</i>, 7133163, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/ITW.2015.7133163\">10.1109/ITW.2015.7133163</a>.","apa":"Gazi, P., &#38; Tessaro, S. (2015). Secret-key cryptography from ideal primitives: A systematic verview. In <i>2015 IEEE Information Theory Workshop</i>. Jerusalem, Israel: IEEE. <a href=\"https://doi.org/10.1109/ITW.2015.7133163\">https://doi.org/10.1109/ITW.2015.7133163</a>","chicago":"Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal Primitives: A Systematic Verview.” In <i>2015 IEEE Information Theory Workshop</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/ITW.2015.7133163\">https://doi.org/10.1109/ITW.2015.7133163</a>."},"oa_version":"None","conference":{"location":"Jerusalem, Israel","end_date":"2015-05-01","start_date":"2015-04-26","name":"ITW 2015: IEEE Information Theory Workshop"},"author":[{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter","last_name":"Gazi","first_name":"Peter"},{"last_name":"Tessaro","first_name":"Stefano","full_name":"Tessaro, Stefano"}],"abstract":[{"lang":"eng","text":"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."}],"date_updated":"2021-01-12T06:52:13Z","quality_controlled":"1","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"title":"Secret-key cryptography from ideal primitives: A systematic verview","date_published":"2015-06-24T00:00:00Z","publist_id":"5506","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"year":"2015","day":"24","month":"06","status":"public","article_number":"7133163","date_created":"2018-12-11T11:53:13Z","doi":"10.1109/ITW.2015.7133163","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"publication_status":"published"}