---
res:
  bibo_abstract:
  - Digital hardware Trojans are integrated circuits whose implementation differ from
    the specification in an arbitrary and malicious way. For example, the circuit
    can differ from its specified input/output behavior after some fixed number of
    queries (known as “time bombs”) or on some particular input (known as “cheat codes”).
    To detect such Trojans, countermeasures using multiparty computation (MPC) or
    verifiable computation (VC) have been proposed. On a high level, to realize a
    circuit with specification   F  one has more sophisticated circuits   F⋄  manufactured
    (where   F⋄  specifies a MPC or VC of   F ), and then embeds these   F⋄ ’s into
    a master circuit which must be trusted but is relatively simple compared to   F
    . Those solutions impose a significant overhead as   F⋄  is much more complex
    than   F , also the master circuits are not exactly trivial. In this work, we
    show that in restricted settings, where   F  has no evolving state and is queried
    on independent inputs, we can achieve a relaxed security notion using very simple
    constructions. In particular, we do not change the specification of the circuit
    at all (i.e.,   F=F⋄ ). Moreover the master circuit basically just queries a subset
    of its manufactured circuits and checks if they’re all the same. The security
    we achieve guarantees that, if the manufactured circuits are initially tested
    on up to T inputs, the master circuit will catch Trojans that try to deviate on
    significantly more than a 1/T fraction of the inputs. This bound is optimal for
    the type of construction considered, and we provably achieve it using a construction
    where 12 instantiations of   F  need to be embedded into the master. We also discuss
    an extremely simple construction with just 2 instantiations for which we conjecture
    that it already achieves the optimal bound.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Suvradip
      foaf_name: Chakraborty, Suvradip
      foaf_surname: Chakraborty
      foaf_workInfoHomepage: http://www.librecat.org/personId=B9CD0494-D033-11E9-B219-A439E6697425
  - foaf_Person:
      foaf_givenName: Stefan
      foaf_name: Dziembowski, Stefan
      foaf_surname: Dziembowski
  - foaf_Person:
      foaf_givenName: Małgorzata
      foaf_name: Gałązka, Małgorzata
      foaf_surname: Gałązka
  - foaf_Person:
      foaf_givenName: Tomasz
      foaf_name: Lizurej, Tomasz
      foaf_surname: Lizurej
  - foaf_Person:
      foaf_givenName: Krzysztof Z
      foaf_name: Pietrzak, Krzysztof Z
      foaf_surname: Pietrzak
      foaf_workInfoHomepage: http://www.librecat.org/personId=3E04A7AA-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-9139-1654
  - foaf_Person:
      foaf_givenName: Michelle X
      foaf_name: Yeo, Michelle X
      foaf_surname: Yeo
      foaf_workInfoHomepage: http://www.librecat.org/personId=2D82B818-F248-11E8-B48F-1D18A9856A87
    orcid: 0009-0001-3676-4809
  bibo_doi: 10.1007/978-3-030-90453-1_14
  bibo_volume: 13043
  dct_date: 2021^xs_gYear
  dct_identifier:
  - UT:000728364000014
  dct_isPartOf:
  - http://id.crossref.org/issn/0302-9743
  - http://id.crossref.org/issn/1611-3349
  - http://id.crossref.org/issn/9-783-0309-0452-4
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: Trojan-resilience without cryptography@
...