Results 11 to 20 of about 5,642 (158)

The random oracle model: a twenty-year retrospective [PDF]

Designs, Codes and Cryptography, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koblitz, Neal, Menezes, Alfred J.
openaire   +3 more sources

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.
Don, J., Fehr, S., Majenz, C., Schaffner, C.   +3 more
openaire   +5 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

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 ...
Farshim, Pooya, Mittelbach, Arno
openaire   +2 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, Barreto Paulo S. L. M., Boidje Brice Odilon, Cayrel Pierre-Louis, Dione Gilbert Ndollane, Gaj Kris, Gueye Cheikh Thiécoumba, Haeussler Richard, Klamti Jean Belo, N’diaye Ousmane, Nguyen Duc Tri, Persichetti Edoardo, Ricardini Jefferson E.   +12 more
doaj   +1 more source

Blockchain Certificateless Encryption Mechanism Based on National Secret Algorithm [PDF]

Jisuanji kexue
The 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

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

Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [PDF]

Quantum
Copy-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, Christian Majenz, Alexander Poremba   +2 more
doaj   +1 more source

Adaptive proofs of knowledge in the random oracle model [PDF]

IET Information Security, 2015
The authors define a notion of adaptive proofs of knowledge (PoKs) in the random oracle model (ROM). These are proofs where the malicious prover can adaptively issue multiple statements and proofs, and where the extractor is supposed to extract a witness for each statement.
Bernhard, David, Fischlin, Marc, Warinschi, Bogdan   +2 more
openaire   +5 more sources

Quantum Merkle Trees [PDF]

Quantum
Committing 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