Results 31 to 40 of about 90,649 (207)
Indifferentiable hash functions in the standard model
IET Information Security, 2021 Indifferentiability of iterated hash functions is seen as evidence that there are no structural flaws in the iteration structure of the algorithm. However, it is often overlooked that such considerations only hold in the random oracle model and do not ...
Juha Partala
doaj +1 more source
Tightly Secure PKE Combiner in the Quantum Random Oracle Model
Cryptography, 2022 The development of increasingly sophisticated quantum computers poses a long-term threat to current cryptographic infrastructure. This has spurred research into both quantum-resistant algorithms and how to safely transition real-world implementations and
Brian Goncalves, Atefeh Mashatan
doaj +1 more source
The Random Oracle Methodology, Revisited [PDF]
, 2000 We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions".
Canetti, Ran +2 more
core +7 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
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
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
The random oracle model: a twenty-year retrospective [PDF]
Designs, Codes and Cryptography, 2015 It has been roughly two decades since the random oracle model for reductionist security arguments was introduced and one decade since we first discussed the controversy that had arisen concerning its use. In this retrospective we argue that there is no evidence that the need for the random oracle assumption in a proof indicates the presence of a real ...
Neal Koblitz, Alfred Menezes
openaire +1 more source