Results 11 to 20 of about 95,474 (182)
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
The random oracle model: a twenty-year retrospective [PDF]
Designs, Codes and Cryptography, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koblitz, Neal, Menezes, Alfred J.
openaire +3 more sources
A New Identification Scheme based on Syndrome Decoding Problem with Provable Security against Quantum Adversaries [PDF]
Journal of Universal Computer Science, 2019 Recently, in order to guarantee security against quantum adversaries, several identification (ID) schemes based on computational problems which are supposed to be hard even for quantum computers have been proposed. However, their security are only proven
Bagus Santoso, Chunhua Su
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
Journal of King Saud University: Computer and Information Sciences, 2022 A group signature allows a group member who signs the message on behalf of the other group members. Any recipient also verifies the signature without knowing the signer.
Meryem Soysaldı Şahin, Sedat Akleylek
doaj +1 more source
Online-Extractability in the Quantum Random-Oracle Model
, 2022 We 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 almost certainty.
Don, J. +3 more
openaire +5 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
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
Modeling Random Oracles Under Unpredictable Queries [PDF]
, 2016 In recent work, Bellare, Hoang, and Keelveedhi (CRYPTO 2013) introduced a new abstraction called Universal Computational Extractors (UCEs), and showed how they can replace random oracles (ROs) across a wide range of cryptosystems. We formulate a new framework, called Interactive Computational Extractors (ICEs), that extends UCEs by viewing them as ...
Farshim, Pooya, Mittelbach, Arno
openaire +2 more sources
Finite mixture regression: A sparse variable selection by model selection for clustering [PDF]
, 2014 We consider a finite mixture of Gaussian regression model for high- dimensional data, where the number of covariates may be much larger than the sample size. We propose to estimate the unknown conditional mixture density by a maximum likelihood estimator,
Devijver, Emilie
core +4 more sources