Physical Insights on the Ambiguous Metal-Graphene Interface and Proposal for Improved Contact Resistance

The ambiguous behavior of metal-graphene interface has been addressed in this paper using density functional theory and nonequilibrium Green's function formalism. For the first time, the fundamental chemistry of metal-graphene interface, in particular role of sp-hybridized and sp(2)-hybridized carbon atoms, has been emphasized and discussed in detail in this paper. It was discovered that the sp-hybridized sites at the edge of a graphene monolayer contribute to 40% of current conduction when compared with sp(2)-hybridized atom sites in the graphene-metal overlap region. Moreover, we highlighted the insignificance of an additional metal layer, i.e., sandwiched contact, due to lacking sp-hybridized carbon sites. A fundamental way of defining the contact resistance, while keeping chemical bonding in mind, has been proposed. The bonding insight has been further used to propose the novel ways of interfacing metal with graphene, which results in a 40% reduction in contact resistance.

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

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 , where denotes the upper bound on the underlying random oracle calls and , 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 . 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.