Results 61 to 70 of about 778 (85)
Sherlock Holmes zero-knowledge protocols secure against active attackers
We present two simple zero-knowledge interactive proofs that can be instantiated with many of the standard decisional or computational hardness assumptions.
Teşeleanu George
doaj +1 more source
From Random Numbers to Random Objects. [PDF]
Zolfaghari B, Bibak K, Koshiba T.
europepmc +1 more source
Analysis of collision probability in Merkle trees in the random oracle model
This work analyzes the probability of collisions in Merkle graphs, with a focus on a specific class of attacks in balanced Merkle trees. To provide a tractable model, each hash function is modeled as an independent random oracle with finite input space ...
Corsi Alessandro +2 more
doaj +1 more source
On the security of the Courtois-Finiasz-Sendrier signature
We prove that a variant of the Courtois-Finiasz-Sendrier signature is strongly existentially unforgeable under chosen message attack in the random oracle model, assuming hardness of the Permuted Goppa Syndrome Decoding Problem (also known as the ...
Morozov Kirill +3 more
doaj +1 more source
Rumour prevention in social networks with layer 2 blockchains. [PDF]
Thakur S, Breslin JG.
europepmc +1 more source
Orienteering with One Endomorphism. [PDF]
Arpin S +5 more
europepmc +1 more source
Functional encryption for set intersection in the multi-client setting. [PDF]
Lee K, Seo M.
europepmc +1 more source
A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis. [PDF]
Azimi SA +5 more
europepmc +1 more source
Caps and progression-free sets in Z m n. [PDF]
Elsholtz C, Pach PP.
europepmc +1 more source
There are many group-based cryptosystems in which the security is related to the conjugacy search problem or the simultaneous conjugacy search problem in their underlying platform groups.
Kahrobaei Delaram +4 more
doaj +1 more source

