Results 241 to 250 of about 4,491,165 (327)
Using GNN property predictors as molecule generators. [PDF]
Nat CommunTherrien F, Sargent EH, Voznyy O.
europepmc +1 more source
IGTG&R: An Intent Analysis-Guided Unit Test Generation and Refinement Framework. [PDF]
Entropy (Basel)Liu X, Zhang Y.
europepmc +1 more source
Generic Oracles と Random Oracles について : 特に、相対化BPPの部分クラスたちの分離(数学基礎論およびその応用)
, 1995 正史 工藤, 尚夫 田中
openalex +1 more source
Isomorphism conjecture fails relative to a random oracle
, 1989 Stuart A. Kurtz +2 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Online-Extractability in the Quantum Random-Oracle Model
IACR Cryptology ePrint Archive, 2021We show the following generic result. Whenever a quantum query algorithm in the quantum random-oracle model outputs a classical value $t$ that is promised to be in some tight relation with $H(x)$ for some $x$, then $x$ can be efficiently extracted with ...
Jelle Don +3 more
semanticscholar +1 more source
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009
This work focuses on a vulnerability of hash functions due to sloppy usages or implementations in the real world. If our cryptographic research community succeeded in the development of a perfectly secure random function as the random oracle, it might be broken in some sense by invalid uses.
Kazuki YONEYAMA +2 more
openaire +1 more source
This work focuses on a vulnerability of hash functions due to sloppy usages or implementations in the real world. If our cryptographic research community succeeded in the development of a perfectly secure random function as the random oracle, it might be broken in some sense by invalid uses.
Kazuki YONEYAMA +2 more
openaire +1 more source
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model
IACR Cryptology ePrint Archive, 2019The famous Fiat-Shamir transformation turns any public-coin three-round interactive proof, i.e., any so-called \(\Sigma {\text {-protocol}}\), into a non-interactive proof in the random-oracle model.
Jelle Don +3 more
semanticscholar +1 more source
2021
Random oracles are a very powerful tool. As we have seen, they simultaneously give rise to one-way functions, collision-resistant hash functions, pseudorandom generators, symmetric encryption schemes, and more.
Arno Mittelbach, Marc Fischlin
openaire +1 more source
Random oracles are a very powerful tool. As we have seen, they simultaneously give rise to one-way functions, collision-resistant hash functions, pseudorandom generators, symmetric encryption schemes, and more.
Arno Mittelbach, Marc Fischlin
openaire +1 more source