Secret-key cryptography from ideal primitives: A systematic overview

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 yea...

Full description

Saved in:
Bibliographic Details
Published in2015 IEEE Information Theory Workshop (ITW) pp. 1 - 5
Main Authors Gazi, Peter, Tessaro, Stefano
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2015
Subjects
Ciphers
Computational modeling
Computer science
Cryptography
Encryption
ideal-primitive model
provable security
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1479955248
9781479955244
DOI:10.1109/ITW.2015.7133163