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