Results 21 to 30 of about 6,908 (279)
Combiners for Backdoored Random Oracles [PDF]
, 2018 We formulate and study the security of cryptographic hash functions in the backdoored random-oracle (BRO) model, whereby a big brother designs a “good” hash function, but can also see arbitrary functions of its table via backdoor capabilities. This model captures intentional (and unintentional) weaknesses due to the existence of collision-finding or ...
Balthazar Bauer +2 more
openaire +3 more sources
Bad oracles in higher computability and randomness [PDF]
Israel Journal of Mathematics, 2021 Many constructions in computability theory rely on "time tricks". In the higher setting, relativising to some oracles shows the necessity of these. We construct an oracle~$A$ and a set~$X$, higher Turing reducible to~$X$, but for which $ (A)\ne X$ for any higher functional~$ $ which is consistent on all oracles. We construct an oracle~$A$ relative to
Noam Greenberg +2 more
openaire +3 more sources
Active Learning in Physics: From 101, to Progress, and Perspective
Advanced Quantum Technologies, EarlyView., 2023 In this review, the concept of active learning is introduced to the physicists at the level of beginner without requirement on background in machine learning. It includes most of the latest applications of active learning in branches of physics, covering but not being limited to quantum information, high energy physics, and condensed matter physics. It
Yongcheng Ding +3 more
wiley +1 more source
The random oracle hypothesis is false
Journal of Computer and System Sciences, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard Chang +6 more
openaire +3 more sources
Practically secure quantum position verification
New Journal of Physics, 2021 We discuss quantum position verification (QPV) protocols in which the verifiers create and send single-qubit states to the prover. QPV protocols using single-qubit states are known to be insecure against adversaries that share a small number of entangled
Siddhartha Das, George Siopsis
doaj +1 more source
Limits on the Usefulness of Random Oracles [PDF]
Journal of Cryptology, 2013 In their seminal work, Impagliazzo and Rudich (STOC'89) showed that no key-agreement protocol exists in the random-oracle model, yielding that key agreement cannot be black-box reduced to one-way functions. In this work, we generalize their result, showing that, to a large extent, no-private-input, semi-honest, two-party functionalities that can be ...
Eran Omri, Hila Zarosim, Iftach Haitner
openaire +4 more sources
Uselessness for an Oracle model with internal randomness [PDF]
Quantum Information and Computation, 2014 We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can be solved by a quantum algorithm using a single query; we show that such infinity-vs-one separations between ...
Harrow, Aram W., Rosenbaum, David J.
openaire +4 more sources
Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model [PDF]
International Journal of Electronics and Telecommunications, 2021 In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a ...
Mariusz Jurkiewicz
doaj +1 more source
, 2021 Ziel dieser Arbeit ist es, Random Oracle zu instanziieren, ohne dabei Sicherheit zu verlieren, die im Random Oracle Modell bewiesen wurde. Das dies mit Funktionsfamilien nicht geht ist eine wohl bekannte Aussage, die zuerst von Halevi et al. (IACR’1998) gezeigt wurde.
openaire +3 more sources
Limits of random oracles in secure computation [PDF]
Proceedings of the 5th conference on Innovations in theoretical computer science, 2014 The seminal result of Impagliazzo and Rudich (STOC 1989) gave a black-box separation between one-way functions and public-key encryption: informally, a public-key encryption scheme cannot be constructed using one-way functions as the sole source of computational hardness.
Manoj Prabhakaran +2 more
openaire +3 more sources