Results 21 to 30 of about 14,997,530 (270)
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}$.
Atul Singh Arora +5 more
openaire +5 more sources
A Random Oracle for All of Us [PDF]
, 2022 We introduce the notion of a universal random oracle. Analogously to a classical random oracle it idealizes hash functions as random functions. However, as opposed to a classical random oracle which is created freshly and independently for each adversary,
Schmalz, Tobias +5 more
core +2 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
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
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 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
How Risky Is the Random-Oracle Model? [PDF]
, 2009 RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instantiations proposed in the literature for such cases are weaker than a random oracle, including the proposals by Bellare and Rogaway from 1993 and 1996, and the ones implicit in ...
Gaëtan Leurent, Phong Q. Nguyen
openaire +2 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.
J.W. Don (Jelle) +3 more
openaire +6 more sources
DAGS: Key encapsulation using dyadic GS codes
Journal of Mathematical Cryptology, 2018 Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes.
Banegas Gustavo +12 more
doaj +1 more source
The random oracle model: a twenty-year retrospective [PDF]
Designs, Codes and Cryptography, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neal Koblitz, Alfred J. Menezes
openaire +2 more sources