2,788 research outputs found

    Approximating Cumulative Pebbling Cost Is Unique Games Hard

    Get PDF
    The cumulative pebbling complexity of a directed acyclic graph GG is defined as cc(G)=minPiPi\mathsf{cc}(G) = \min_P \sum_i |P_i|, where the minimum is taken over all legal (parallel) black pebblings of GG and Pi|P_i| denotes the number of pebbles on the graph during round ii. Intuitively, cc(G)\mathsf{cc}(G) captures the amortized Space-Time complexity of pebbling mm copies of GG in parallel. The cumulative pebbling complexity of a graph GG is of particular interest in the field of cryptography as cc(G)\mathsf{cc}(G) is tightly related to the amortized Area-Time complexity of the Data-Independent Memory-Hard Function (iMHF) fG,Hf_{G,H} [AS15] defined using a constant indegree directed acyclic graph (DAG) GG and a random oracle H()H(\cdot). A secure iMHF should have amortized Space-Time complexity as high as possible, e.g., to deter brute-force password attacker who wants to find xx such that fG,H(x)=hf_{G,H}(x) = h. Thus, to analyze the (in)security of a candidate iMHF fG,Hf_{G,H}, it is crucial to estimate the value cc(G)\mathsf{cc}(G) but currently, upper and lower bounds for leading iMHF candidates differ by several orders of magnitude. Blocki and Zhou recently showed that it is NP\mathsf{NP}-Hard to compute cc(G)\mathsf{cc}(G), but their techniques do not even rule out an efficient (1+ε)(1+\varepsilon)-approximation algorithm for any constant ε>0\varepsilon>0. We show that for any constant c>0c > 0, it is Unique Games hard to approximate cc(G)\mathsf{cc}(G) to within a factor of cc. (See the paper for the full abstract.)Comment: 28 pages, updated figures and corrected typo

    Excited ionic and neutral fragments produced by dissociation of the N2(+)* H band

    Get PDF
    N I and N II fluorescent radiation was observed when N2 was irradiated by undispersed synchrotron radiation with an upper energy limit of approximately 200 eV. The excited fragments originate from dissociation of a band of excited ionic states of N2 lying between 34.7 and 44 eV

    Talent Development for Integration Web 3.0/NFT/SDG into UNSDGs

    Get PDF
    Sustainable Development mindset with servant leadership has been mentioned in past studies for transformations. Under covid-19, there is a need for new way of committed organizations to provide professional services, for example, business related training services with United Nations sustainable development goals (UNSDGs) and ESG (Environmental, Social and Governance). Moreover, digital art related business services may be a future area for the education sector too. It is time to explore attitudes, skills and values needed for a professional business servant leader to re-design workflow with transformations and services with innovations for driving economic growth

    On the Security of Proofs of Sequential Work in a Post-Quantum World

    Get PDF
    A Proof of Sequential Work (PoSW) allows a prover to convince a resource-bounded verifier that the prover invested a substantial amount of sequential time to perform some underlying computation. PoSWs have many applications including time-stamping, blockchain design, and universally verifiable CPU benchmarks. Mahmoody, Moran, and Vadhan (ITCS 2013) gave the first construction of a PoSW in the random oracle model though the construction relied on expensive depth-robust graphs. In a recent breakthrough, Cohen and Pietrzak (EUROCRYPT 2018) gave an efficient PoSW construction that does not require expensive depth-robust graphs. In the classical parallel random oracle model, it is straightforward to argue that any successful PoSW attacker must produce a long H\mathcal{H}-sequence and that any malicious party running in sequential time T1T-1 will fail to produce an H\mathcal{H}-sequence of length TT except with negligible probability. In this paper, we prove that any quantum attacker running in sequential time T1T-1 will fail to produce an H\mathcal{H}-sequence except with negligible probability -- even if the attacker submits a large batch of quantum queries in each round. The proof is substantially more challenging and highlights the power of Zhandry's recent compressed oracle technique (CRYPTO 2019). We further extend this result to establish post-quantum security of a non-interactive PoSW obtained by applying the Fiat-Shamir transform to Cohen and Pietrzak's efficient construction (EUROCRYPT 2018).Comment: 44 pages, 4 figure

    A two-dimensional model of low-Reynolds number swimming beneath a free surface

    Get PDF
    Biological organisms swimming at low Reynolds number are often influenced by the presence of rigid boundaries and soft interfaces. In this paper we present an analysis of locomotion near a free surface with surface tension. Using a simplified two-dimensional singularity model, and combining a complex variable approach with conformal mapping techniques, we demonstrate that the deformation of a free surface can be harnessed to produce steady locomotion parallel to the interface. The crucial physical ingredient lies in the nonlinear hydrodynamic coupling between the disturbance flow created by the swimmer and the free boundary problem at the fluid surface

    On the origin of high m magnetospheric waves

    Get PDF
    A survey of Advanced Rio-Imaging Experiment in Scandinavia data reveals evidence for a previously overlooked generation mechanism of high azimuthal wave number magnetospheric waves. Here we present observations of pulsating cosmic noise absorption with azimuthal wave numbers as high as 380, suggestive of precipitation modulation by magnetospheric waves. Dispersion relations of the small-scale precipitation pulsations are indicative of the proposed origin. Previous studies of magnetospheric waves, together with data from the Charge And Mass Magnetospheric Ion Composition Experiment (Magnetospheric Ion Composition Sensor) instrument aboard the Polar spacecraft, provide support for the theory

    Managing the Enriched Experience Network - Learning-Outcome Approach to the Experimental Design Life-Cycle

    Full text link
    Experimental design methods have long been used in scientific areas such as agriculture, biology and physics to minimise error and assure validity. Although most network researchers performing experiments with testbeds and simulations implicitly follow scientific method, until recently there has been little emphasis on improving experimental design methods. Traditional experimental design focuses on experiments where the scope and objectives are relatively constrained, however network research in innovative areas where there is little or no precedence often has changing objectives that evolve over time. We describe the learning-outcome approach to the experimental design life-cycle that applies the concepts of systems development life-cycle models used in software engineering, as well as learning taxonomies used in education. Our approach extends traditional experimental design by providing a more comprehensive and efficient way of decomposing an experimental research project into manageable stages that are designed rather than improvised, leading to a well-structured way of assessing the knowledge gained. We provide an insight into our experiences with this approach in the context of experimental research in management of Alcatel Australia's new-generation Enriched Experience Network
    corecore