Results 11 to 20 of about 6,908 (279)
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
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
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
Efficient All-or-Nothing Public Key Encryption With Authenticated Equality Test
IEEE Access, 2021 Public key encryption with equality test (PKEET for short) is a new cryptographic primitive which allows a proxy to check whether two ciphertexts encrypted under different public keys are of the same plaintext.
Zhi-Yan Zhao, Peng Zeng
doaj +1 more source
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 +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
Quantum query complexity of symmetric oracle problems [PDF]
Quantum, 2021 We study the query complexity of quantum learning problems in which the oracles form a group $G$ of unitary matrices. In the simplest case, one wishes to identify the oracle, and we find a description of the optimal success probability of a $t$-query ...
Daniel Copeland, Jamie Pommersheim
doaj +1 more source
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
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
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. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have classical access to the random oracle.
Boneh, D. +5 more
openaire +5 more sources