Results 1 to 10 of about 106,354 (248)
The random oracle methodology, revisited [PDF]
Journal of the ACM, 2004 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".The main result of this article is a negative one: There exist signature and encryption schemes ...
Canetti, Ran +2 more
core +13 more sources
Practically secure quantum position verification
New Journal of Physics, 2021 We discuss quantum position verification (QPV) protocols in which the verifiers create and send single-qubit states to the prover. QPV protocols using single-qubit states are known to be insecure against adversaries that share a small number of entangled
Siddhartha Das, George Siopsis
doaj +2 more sources
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
Quantum Search Approaches to Sampling-Based Motion Planning
IEEE Access, 2023 In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms.
Paul Lathrop +2 more
doaj +1 more source
Infinite Computations with Random Oracles [PDF]
Notre Dame Journal of Formal Logic, 2017 We consider the following problem for various infinite time machines. If a real is computable relative to large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable?
Schlicht, Philipp, Carl, Merlin
openaire +4 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
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
Indifferentiability of the Sponge Construction with a Restricted Number of Message Blocks
IACR Transactions on Symmetric Cryptology, 2023 The sponge construction is a popular method for hashing. Quickly after its introduction, the sponge was proven to be tightly indifferentiable from a random oracle up to ≈ 2c/2 queries, where c is the capacity.
Charlotte Lefevre
doaj +1 more source
An Improved Scheme for Blockchain Oracle Based on Schnorr Signature [PDF]
Jisuanji gongchengBlockchain oracle is a type of middleware that provides trustworthy guarantee for on-chain data, effectively addressing the trust problem of on- and off-chain data transmission.
Huaiyong CUI, Shaohua ZHANG, Chao LI, Bingrong DAI
doaj +1 more source
Identity-Based Partially Blind Signature Scheme: Cryptanalysis and Construction
IEEE Access, 2021 Blind signature is a special type of digital signature, the signer cannot see the specific content signed. However, blindness may cause users to abuse their rights.
Yuhong Jiang, Lunzhi Deng, Bingqin Ning
doaj +1 more source