Secret-key cryptography from ideal primitives: A systematic verview Conference Paper


Author(s): Gaži, Peter; Tessaro, Stefano
Title: Secret-key cryptography from ideal primitives: A systematic verview
Affiliation IST Austria
Abstract: 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.
Keywords: Provable security; Cryptography; ideal-primitive model
Conference Title: ITW 2015: IEEE Information Theory Workshop
Volume: Article number: 7133163
Conference Dates: April 26 - May 1, 2015
Conference Location: Jerusalem, Israel
ISBN: 978-147995526-8
Publisher: IEEE  
Date Published: 2015-06-24
Start Page: 1
End Page: 5
Sponsor: Peter Gaži was partly funded by the European Research Council under an ERC Starting Grant (259668-PSPC). Stefano Tessaro was partially supported by NSF grant CNS-1423566.
DOI: 10.1109/ITW.2015.7133163
Open access: no
IST Austria Authors
  1.  Peter Gazi
    9 Gazi
Related IST Austria Work