---
res:
  bibo_abstract:
  - Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension
    of general forking. The notion of (multiple) forking is a useful abstraction from
    the actual simulation of cryptographic scheme to the adversary in a security reduction,
    and is achieved through the intermediary of a so-called wrapper algorithm. Multiple
    forking has turned out to be a useful tool in the security argument of several
    cryptographic protocols. However, a reduction employing multiple forking incurs
    a significant degradation of (Formula presented.) , where (Formula presented.)
    denotes the upper bound on the underlying random oracle calls and (Formula presented.)
    , the number of forkings. In this work we take a closer look at the reasons for
    the degradation with a tighter security bound in mind. We nail down the exact
    set of conditions for success in the multiple forking game. A careful analysis
    of the cryptographic schemes and corresponding security reduction employing multiple
    forking leads to the formulation of ‘dependence’ and ‘independence’ conditions
    pertaining to the output of the wrapper in different rounds. Based on the (in)dependence
    conditions we propose a general framework of multiple forking and a General Multiple
    Forking Lemma. Leveraging (in)dependence to the full allows us to improve the
    degradation factor in the multiple forking game by a factor of (Formula presented.).
    By implication, the cost of a single forking involving two random oracles (augmented
    forking) matches that involving a single random oracle (elementary forking). Finally,
    we study the effect of these observations on the concrete security of existing
    schemes employing multiple forking. We conclude that by careful design of the
    protocol (and the wrapper in the security reduction) it is possible to harness
    our observations to the full extent.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Chethan
      foaf_name: Kamath Hosdurg, Chethan
      foaf_surname: Kamath Hosdurg
      foaf_workInfoHomepage: http://www.librecat.org/personId=4BD3F30E-F248-11E8-B48F-1D18A9856A87
    orcid: 0009-0006-6812-7317
  - foaf_Person:
      foaf_givenName: Sanjit
      foaf_name: Chatterjee, Sanjit
      foaf_surname: Chatterjee
  bibo_doi: 10.1007/s00453-015-9997-6
  bibo_issue: '4'
  bibo_volume: 74
  dct_date: 2016^xs_gYear
  dct_identifier:
  - UT:000373640000005
  dct_language: eng
  dct_publisher: Springer@
  dct_title: 'A closer look at multiple-forking: Leveraging (in)dependence for a tighter
    bound@'
...
