Results 31 to 40 of about 4,491,165 (327)
Indifferentiability of the Sponge Construction with a Restricted Number of Message Blocks
IACR Transactions on Symmetric Cryptology, 2023 The sponge construction is a popular method for hashing. Quickly after its introduction, the sponge was proven to be tightly indifferentiable from a random oracle up to ≈ 2c/2 queries, where c is the capacity.
Charlotte Lefevre
doaj +1 more source
On the Power of Conditional Samples in Distribution Testing [PDF]
, 2013 In this paper we define and examine the power of the {\em conditional-sampling} oracle in the context of distribution-property testing. The conditional-sampling oracle for a discrete distribution $\mu$ takes as input a subset $S \subset [n]$ of the ...
Chakraborty, Sourav +3 more
core +2 more sources
Sequential Hashing with Minimum Padding
Cryptography, 2018 This article presents a sequential domain extension scheme with minimum padding for hashing using a compression function. The proposed domain extension scheme is free from the length extension property.
Shoichi Hirose
doaj +1 more source
Random Oracle Reducibility [PDF]
, 2011 We discuss a reduction notion relating the random oracles in two cryptographic schemes A and B. Basically, the random oracle of scheme B reduces to the one of scheme A if any hash function instantiation of the random oracle (possibly still oracle based) which makes A secure also makes B secure. In a sense, instantiating the random oracle in scheme B is
Paul Baecher, Marc Fischlin
openaire +1 more source
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 +2 more sources
Discrete choice, permutations, and reconstruction [PDF]
, 2018 In this paper we study the well-known family of Random Utility Models, developed over 50 years ago to codify rational user behavior in choosing one item from a finite set of options. In this setting each user draws i.i.d. from some distribution a utility
Chierichetti, Flavio +2 more
core +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 +2 more sources
Using intelligence techniques to automate Oracle testing [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2023 The software development life cycle includes software testing as a critical step. Oracle testing is necessary to determine if a particular test case detects an error because the purpose of testing is to ensure that the application adheres to its ...
Nour Sulaiman, safwan hasson
doaj +1 more source
Calibrating nonconvex penalized regression in ultra-high dimension [PDF]
, 2013 We investigate high-dimensional nonconvex penalized regression, where the number of covariates may grow at an exponential rate. Although recent asymptotic theory established that there exists a local minimum possessing the oracle property under general ...
Kim, Yongdai, Li, Runze, Wang, Lan
core +1 more source
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