Results 31 to 40 of about 11,450 (279)
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
QuantumCommitting to information is a central task in cryptography, where a party (typically called a prover) stores a piece of information (e.g., a bit string) with the promise of not changing it.
Lijie Chen, Ramis Movassagh
doaj +1 more source
Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model [PDF]
International Journal of Electronics and Telecommunications, 2021 In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a ...
Mariusz Jurkiewicz
doaj +1 more source
Non-Observable Quantum Random Oracle Model [PDF]
, 2023 The random oracle model (ROM), introduced by Bellare and Rogaway (CCS 1993), enables a formal security proof for many (efficient) cryptographic primitives and protocols, and has been quite impactful in practice. However, the security model also relies on
Varun Maram, Daniel Masny, Navid Alamati
core
Online-Extractability in the Quantum Random-Oracle Model [PDF]
, 2022 We show the following generic result: When 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 ...
Fehr, S. +5 more
core +2 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 +1 more source
An ID-Based Linearly Homomorphic Signature Scheme and Its Application in Blockchain
IEEE Access, 2018 Identity-based cryptosystems mean that public keys can be directly derived from user identifiers, such as telephone numbers, email addresses, and social insurance number, and so on.
Qun Lin +5 more
doaj +1 more source
Prikladnaya Diskretnaya MatematikaThe random oracle model is an instrument used for proving that protocol has no structural flaws when settling with standard hash properties is impossible or fairly difficult. In practice, however, random oracles must be instantiated with some specific hash functions that are not random oracles.
Akhmetzyanova, L. R. +2 more
openaire +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. 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.
Dan Boneh +5 more
openaire +6 more sources
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 +3 more sources