Results 21 to 30 of about 94,999 (279)
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
RAFI: Robust Authentication Framework for IoT-Based RFID Infrastructure
Sensors, 2022 The Internet of Things (IoT) is a future trend that uses the Internet to connect a variety of physical things with the cyber world. IoT technology is rapidly evolving, and it will soon have a significant impact on our daily lives.
Vikas Kumar +5 more
doaj +1 more source
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
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
Quantum Depth in the Random Oracle Model
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023 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: (a) $\mathsf{BPP}^{\mathsf{QNC}^{\mathsf{BPP}}} \neq \mathsf{BQP}$.
Arora, Atul Singh +5 more
openaire +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
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
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
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