Results 11 to 20 of about 5,964 (223)
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
Provably Secure Covert Communication on Blockchain
Cryptography, 2018 Blockchain is a public open ledger that provides data integrity in a distributed manner. It is the underlying technology of cryptocurrencies and an increasing number of related applications, such as smart contracts. The open nature of blockchain together
Juha Partala
doaj +1 more source
Blockchain Certificateless Encryption Mechanism Based on National Secret Algorithm [PDF]
Jisuanji kexueThe blockchain has attracted widespread attention because of its distributed,non-tamperable and inherent immutability features.However,the international cryptographic algorithm used in the blockchain has certain backdoor security risks.Based on the ...
XIANG Yanjie, HUANG Xiaofang, XIANG Kefeng, ZHENG Ji’nan
doaj +1 more source
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [PDF]
QuantumCopy-protection allows a software distributor to encode a program in such a way that it can be evaluated on any input, yet it cannot be "pirated" – a notion that is impossible to achieve in a classical setting.
Andrea Coladangelo +2 more
doaj +1 more source
Non Observability in the Random Oracle Model [PDF]
, 2013 Security proofs in the Random Oracle Model (ROM) often make use of the fact that the queries made by the adversary to the oracle are observable as well as the responses to those queries can be programmed. While, the issue of programmability of query responses has received attention in the literature, to the best of our knowledge, observability of the ...
Prabhanjan Ananth, Raghav Bhaskar
openaire +2 more sources
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
The Random Oracle Model and the Ideal Cipher Model Are Equivalent [PDF]
, 2008 The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al.showed that security in the random oracle model implies security in the ideal cipher model; namely they showed that a random oracle can be replaced by a block cipher-based ...
CORON, Jean-Sébastien +2 more
openaire +3 more sources
Modeling Random Oracles Under Unpredictable Queries [PDF]
, 2016 In recent work, Bellare, Hoang, and Keelveedhi (CRYPTO 2013) introduced a new abstraction called Universal Computational Extractors (UCEs), and showed how they can replace random oracles (ROs) across a wide range of cryptosystems. We formulate a new framework, called Interactive Computational Extractors (ICEs), that extends UCEs by viewing them as ...
Pooya Farshim, Arno Mittelbach
openaire +3 more sources
Attacks on One Designated Verifier Proxy Signature Scheme
Journal of Applied Mathematics, 2012 In a designated verifier proxy signature scheme, there are three participants, namely, the original signer, the proxy signer, and the designated verifier.
Baoyuan Kang
doaj +1 more source