---
res:
  bibo_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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Peter
      foaf_name: Gazi, Peter
      foaf_surname: Gazi
      foaf_workInfoHomepage: http://www.librecat.org/personId=3E0BFE38-F248-11E8-B48F-1D18A9856A87
  - foaf_Person:
      foaf_givenName: Stefano
      foaf_name: Tessaro, Stefano
      foaf_surname: Tessaro
  bibo_doi: 10.1109/ITW.2015.7133163
  dct_date: 2015^xs_gYear
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: 'Secret-key cryptography from ideal primitives: A systematic verview@'
...