Results 231 to 240 of about 6,908 (279)
Evidence-informed policy for monitoring SDG 3 in the Legal Amazon region: A rapid review. [PDF]
Rev Panam Salud PublicaRola RCF +3 more
europepmc +1 more source
Scalable geometric learning with correlation-based functional brain networks. [PDF]
Sci RepYou K, Lee Y, Park HJ.
europepmc +1 more source
The Random Oracle Controversy [PDF]
, 2021 Over the course of the previous chapters we have seen how random oracles allow for the creation of elegant and efficient schemes which can furthermore be proven secure in the random oracle model. In this chapter we have a closer look at what it means to have a security proof in the random oracle model rather than in the standard model.
Marc Fischlin, Arno Mittelbach
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2021
Random oracles are a very powerful tool. As we have seen, they simultaneously give rise to one-way functions, collision-resistant hash functions, pseudorandom generators, symmetric encryption schemes, and more.
Marc Fischlin, Arno Mittelbach
openaire +2 more sources
Random oracles are a very powerful tool. As we have seen, they simultaneously give rise to one-way functions, collision-resistant hash functions, pseudorandom generators, symmetric encryption schemes, and more.
Marc Fischlin, Arno Mittelbach
openaire +2 more sources
2021
In the previous chapter we looked at dedicated forms of hash functions that we categorized as non-cryptographic hash functions. Their common denominator is that we can prove the existence of constructions that fulfill the properties (e.g., pairwise independence) without having to rely on unproven assumptions.
Marc Fischlin, Arno Mittelbach
openaire +2 more sources
In the previous chapter we looked at dedicated forms of hash functions that we categorized as non-cryptographic hash functions. Their common denominator is that we can prove the existence of constructions that fulfill the properties (e.g., pairwise independence) without having to rely on unproven assumptions.
Marc Fischlin, Arno Mittelbach
openaire +2 more sources
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009
This work focuses on a vulnerability of hash functions due to sloppy usages or implementations in the real world. If our cryptographic research community succeeded in the development of a perfectly secure random function as the random oracle, it might be broken in some sense by invalid uses.
Kazuo Ohta +2 more
openaire +1 more source
This work focuses on a vulnerability of hash functions due to sloppy usages or implementations in the real world. If our cryptographic research community succeeded in the development of a perfectly secure random function as the random oracle, it might be broken in some sense by invalid uses.
Kazuo Ohta +2 more
openaire +1 more source