Results 11 to 20 of about 106,354 (248)
Quantum Random Oracle Model for Quantum Public-Key Encryption
IEEE Access, 2019 Random oracle model is a general security analysis tool for rigorous security proof and effective cryptographic protocol design. In the quantum world, the attempts of constructing a quantum random oracle (QRO) have been made, such as quantum-accessible ...
Tao Shang, Ranyiliu Chen, Qi Lei
doaj +3 more sources
On the Oracle Properties of Bayesian Random Forest for Sparse High-Dimensional Gaussian Regression
Mathematics, 2023 Random forest (RF) is a widely used data prediction and variable selection technique. However, the variable selection aspect of RF can become unreliable when there are more irrelevant variables than relevant ones.
Oyebayo Ridwan Olaniran +1 more
doaj +3 more sources
Random Oracles in a Quantum World [PDF]
, 2011 The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems.
C.H. Bennett +25 more
core +3 more sources
Efficient All-or-Nothing Public Key Encryption With Authenticated Equality Test
IEEE Access, 2021 Public key encryption with equality test (PKEET for short) is a new cryptographic primitive which allows a proxy to check whether two ciphertexts encrypted under different public keys are of the same plaintext.
Zhi-Yan Zhao, Peng Zeng
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
A Quantum Random Walk Search Algorithm [PDF]
, 2002 Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts.
A. Childs +8 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
A Machine-Checked Formalization of the Generic Model and the Random Oracle Model [PDF]
, 2004 Most approaches to the formal analyses of cryptographic protocols make the perfect cryptography assumption, i.e. the hypothese that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key.
A. Fiat +25 more
core +6 more sources