Results 231 to 240 of about 14,997,530 (270)

Incorporating Phylogeography and SDM Projection to Inform Conservation Efforts of the Foundation Seaweed Gloiopeltis furcata sensu lato in the North Pacific Under Climate Change

open access: yesEvolutionary Applications, Volume 19, Issue 9, September 2026.
ABSTRACT Understanding the impact of past climate events on population genetic structuring and range shifts may facilitate predictions of how species will respond to future climate change. Such integrative effort, however, remain rare for the North Pacific benthic ecosystem. Here, we obtained mtDNA cox1 and cpDNA rbcL sequences of 85 populations of the
Qi‐Qi Wang   +7 more
wiley   +1 more source

Noisy quantum learning theory. [PDF]

open access: yesNat Commun
Cotler J, Gong W, Kannan I.
europepmc   +1 more source

Non-Observable Quantum Random Oracle Model [PDF]

open access: yesLecture Notes in Computer Science, 2023
The random oracle model (ROM), introduced by Bellare and Rogaway (CCS 1993), enables a formal security proof for many (efficient) cryptographic primitives and protocols, and has been quite impactful in practice. However, the security model also relies on
Varun Maram, Daniel Masny
exaly   +5 more sources

Succinct Arguments in the Quantum Random Oracle Model [PDF]

open access: yesLecture Notes in Computer Science, 2019
Succinct non-interactive arguments (SNARGs) are highly efficient certificates of membership in non-deterministic languages. Constructions of SNARGs in the random oracle model are widely believed to be post-quantum secure, provided the oracle is instantiated with a suitable post-quantum hash function. No formal evidence, however, supports this belief.
Nicholas Spooner, Alessandro Chiesa
exaly   +5 more sources

Breaking Verifiable Delay Functions in the Random Oracle Model [PDF]

open access: yesLecture Notes in Computer Science
This work resolves the open problem of whether verifiable delay functions (VDFs) can be constructed in the random oracle model.A VDF is a cryptographic primitive that requires a long time to compute (even with parallelization), but produces a unique output that is efficiently and publicly verifiable. We prove that VDFs do not exist in the random oracle
Artur Riazanov   +2 more
exaly   +6 more sources

Home - About - Disclaimer - Privacy