Atomic Resonance and Scattering

Contains reports on eight research projects.National Science Foundation (Grant PHY83-06273)National Bureau of Standards (Grant NB83-NAHA-4058)National Science Foundation (Grant PHY84-11483)Joint Services Electronics Program (Contract DAAG29-83-K-0003)U.S. Navy - Office of Naval Research (Contract NO0014-79-C-0183)U.S. Navy - Office of Naval Research (Contract N00014-83-K-0695)National Science Foundation (Grant PHY83-07172-A01

Atomic Resonance and Scattering

Contains reports on nine research projects.National Science Foundation (Grant PHY79-09743)National Science Foundation (Grant PHY82-10486)Joint Services Electronics Program (Contract DAAG29-83-K-0003)U.S. Navy - Office of Naval Research (Contract N00014-79-C-0183)National Bureau of Standards (Grant NB83-NAHA-4058)National Science Foundation (Grant CHE79-02967-A04)National Science Foundation (Grant PHY83-07172)Joint Services Electronics Program (Grant DAAG29-83-K-0003

Interactive Oracle Proofs

We initiate the study of a proof system model that naturally combines two well-known models: interactive proofs (IPs) and probabilistically-checkable proofs (PCPs). An *interactive oracle proof* (IOP) is an interactive proof in which the verifier is not required to read the prover\u27s messages in their entirety; rather, the verifier has oracle access to the prover\u27s messages, and may probabilistically query them. IOPs simultaneously generalize IPs and PCPs. Thus, IOPs retain the expressiveness of PCPs, capturing NEXP rather than only PSPACE, and also the flexibility of IPs, allowing multiple rounds of communication with the prover. These degrees of freedom allow for more efficient PCP-like interactive protocols, because the prover does not have to compute the parts of a PCP that are not requested by the verifier. As a first investigation into IOPs, we offer two main technical contributions. First, we give a compiler that maps any public-coin IOP into a non-interactive proof in the random oracle model. We prove that the soundness of the resulting proof is tightly characterized by the soundness of the IOP against *state restoration attacks*, a class of rewinding attacks on the IOP verifier. Our compiler preserves zero knowledge, proof of knowledge, and time complexity of the underlying IOP. As an application, we obtain blackbox unconditional ZK proofs in the random oracle model with quasilinear prover and polylogarithmic verifier, improving on the result of Ishai et al.\ (2015). Second, we study the notion of state-restoration soundness of an IOP: we prove tight upper and lower bounds in terms of the IOP\u27s (standard) soundness and round complexity; and describe a simple adversarial strategy that is optimal across all state restoration attacks. Our compiler can be viewed as a generalization of the Fiat--Shamir paradigm for public-coin IPs (CRYPTO~\u2786), and of the CS proof constructions of Micali (FOCS~\u2794) and Valiant (TCC~\u2708) for PCPs. Our analysis of the compiler gives, in particular, a unified understanding of all of these constructions, and also motivates the study of state restoration attacks, not only for IOPs, but also for IPs and PCPs

Characteristics of suicidal male and female soldiers in various military forces

The gender paradox in suicidality is a documented phenomenon, the existence of which has been established by many studies in recent decades. However, despite being repeatedly shown to exist in civilian populations, it has not been researched much in military settings. This paper aims to explore the existence of the gender paradox in various military forces around the world, as reflected in the published literature and to assess the need for further investigation of the subject