Results 41 to 50 of about 11,478 (298)
Non-adaptive programmability of random oracle [PDF]
, 2015 Random Oracles serve as an important heuristic for proving security of many popular and important cryptographic primitives. But, at the same time they are criticized due to the impossibility of practical instantiation.
Bhattacharyya, Rishiraj; id_orcid +1 more
core +1 more source
Barriers for Succinct Arguments in the Random Oracle Model [PDF]
, 2020 We establish barriers on the efficiency of succinct arguments in the random oracle model. We give evidence that, under standard complexity assumptions, there do not exist succinct arguments where the argument verifier makes a small number of queries to ...
Alessandro Chiesa, Eylon Yogev
core +1 more source
ID-based transitive signature schemes without random oracle
Tongxin xuebao, 2010 Based on waters’ signature scheme,the first identity-based transitive signature scheme was proposed and proved secure against attacks in the standard model.Compared with current transitive signature schemes,the unforgeability of the signature’s ...
MA Xiao-long1 +4 more
doaj +2 more sources
Prikladnaya Diskretnaya MatematikaThe random oracle model is an instrument used for proving that protocol has no structural flaws when settling with standard hash properties is impossible or fairly difficult. In practice, however, random oracles must be instantiated with some specific hash functions that are not random oracles.
Akhmetzyanova, L. R. +2 more
openaire +3 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 +3 more sources
Oracle Recording for Non-Uniform Random Oracles, and its Applications [PDF]
, 2023 In Crypto 2019, Zhandry showed how to define compressed oracles, which record quantum superposition queries to the quantum random oracle. In this paper, we extend Zhandry\u27s compressed oracle technique to non-uniformly distributed functions with ...
Minki Hhan, Aaram Yun
core
Quantum Depth in the Random Oracle Model [PDF]
, 2022 We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a random oracle: (
Gheorghiu, Alexandru +11 more
core +2 more sources
Oracle inequalities for weighted group lasso in high-dimensional misspecified Cox models
Journal of Inequalities and Applications, 2020 We study the nonasymptotic properties of a general norm penalized estimator, which include Lasso, weighted Lasso, and group Lasso as special cases, for sparse high-dimensional misspecified Cox models with time-dependent covariates.
Yijun Xiao +3 more
doaj +1 more source
Organic Materials of Tomorrow: Horizons of Artificial Intelligence
Advanced Materials, EarlyView.This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena +3 more
wiley +1 more source
Security of discrete log cryptosystems in the random oracle and the generic model [PDF]
, 1999 We introduce novel security proofs that use combinatorial counting arguments rather than reductions to the discrete logarithm or to the Diffie-Hellman problem. Our security results are sharp and clean with no polynomial reduction times involved.
Jakobsson, Markus, Schnorr, Claus Peter
core