• No results found

[PDF] Top 20 Cryptographic Hashing From Strong One-Way Functions

Has 10000 "Cryptographic Hashing From Strong One-Way Functions" found on our website. Below are the top 20 most common "Cryptographic Hashing From Strong One-Way Functions".

Cryptographic  Hashing  From  Strong  One-Way  Functions

Cryptographic Hashing From Strong One-Way Functions

... As an interesting special case, the notion of correlation intractability that we achieve in Theo- rem 6.3 is powerful enough to capture nontrivial cases of the Fiat-Shamir paradigm for converting (constant round, ... See full document

51

Worst-Case  Hardness  for  LPN   and  Cryptographic  Hashing  via  Code  Smoothing

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing

... of cryptographic primitives assuming the hardness of LWE ...to one-way functions and public-key encryption (and primitives that can be constructed generically from ...function ... See full document

16

Adaptive One-way Functions and Applications

Adaptive One-way Functions and Applications

... introducing strong, but general, hardness ...preposterous. One cri- terion in determining the acceptability of a cryptographic assumption A is to consider (1) what the assumption is used for (for ... See full document

18

Coin Flipping of Any Constant Bias Implies One-Way Functions

Coin Flipping of Any Constant Bias Implies One-Way Functions

... of one-way functions is typically proven by looking at the primitive core function — an efficiently computable function (not necessarily unique) whose inver- sion on uniformly chosen outputs implies ... See full document

10

Hardness  of  Non-Interactive  Differential  Privacy  from  One-Way  Functions

Hardness of Non-Interactive Differential Privacy from One-Way Functions

... powerful cryptographic primitives like iO, leaving little room to utilize more structured complexity assumptions to obtain hardness for simple ...of one-way functions, we believe our results ... See full document

27

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions

... secure one-way function based on a worst-case complexity assumption, we view the following as additional contributions of this paper: the introduction of the class of cyclic lattices as a source of ... See full document

29

Simple  composition  theorems  of  one-way  functions --  proofs   and  presentations

Simple composition theorems of one-way functions -- proofs and presentations

... One-way functions are both central to cryptographic theory and a clear example of its complexity as a ...theory. From the aim to understand theories, proofs, and communicability of ... See full document

18

CBEAM:  Efficient  Authenticated  Encryption  from  Feebly  One-Way $\phi$  Functions

CBEAM: Efficient Authenticated Encryption from Feebly One-Way $\phi$ Functions

... φ functions in cryptographic primitives such as hashes and authenticated ...These functions have fascinating and at- tractive properties such as “feeble one-wayness”; the Boolean complexity of ... See full document

19

On  the  Existence  of  Extractable  One-Way  Functions

On the Existence of Extractable One-Way Functions

... tractable functions with other components in a larger cryptographic scheme or protocol, an adversary A may gather information z from other components and use it as additional auxiliary input when ... See full document

42

How  to  Watermark  Cryptographic  Functions

How to Watermark Cryptographic Functions

... (and one-way ...marked functions and if they reveal functions whose format is different from that of original functions, then we can decide that they are suspicious ... See full document

22

(Almost)  Optimal  Constructions  of  UOWHFs  from 1-to-1,  Regular  One-way  Functions   and  Beyond

(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-way Functions and Beyond

... universal hashing (see Lemma ...when hashing any X of min-entropy (or R´ enyi entropy) no less than a into (a−d)- bit strings, the resulting output distribution will be 2 −Ω(d) -close (in terms of ... See full document

30

ABSTRACT: Hashing function is the One of the most frequent way for finding the nearest match in the large data

ABSTRACT: Hashing function is the One of the most frequent way for finding the nearest match in the large data

... ABSTRACT: Hashing function is the One of the most frequent way for finding the nearest match in the large data ...sets. From the last decades number of researcher has been work on the ... See full document

5

Building  Quantum-One-Way  Functions  from  Block  Ciphers:  Davies-Meyer   and  Merkle-Damgrd  Constructions

Building Quantum-One-Way Functions from Block Ciphers: Davies-Meyer and Merkle-Damgrd Constructions

... for cryptographic schemes. These tools include “one-way to hiding” lemma and quantum random oracle programming by Unruh [30,29], the rank method and oracle indistinguishability frameworks by Zhandry ... See full document

60

Providing password security by salted password hashing using Bcrypt 
		algorithm

Providing password security by salted password hashing using Bcrypt algorithm

... algorithm, cryptographic protocol and cryptography algorithm are used to secure password and data ...are cryptographic hash functions can be used. Hashing password is better method then ... See full document

6

Xtings -160: A Strong Diffusion Property Novel Hashing Algorithm

Xtings -160: A Strong Diffusion Property Novel Hashing Algorithm

... of cryptographic hash function on stored ...a one-way property making it difficult for a ciphertext to ...7] Hashing algorithms such as MD5 (Message Digest 5) by Ronald Rivest of Massachusetts ... See full document

5

Cube attacks on cryptographic hash functions

Cube attacks on cryptographic hash functions

... While one segment of the cryptographic community was improving the speed of the MD5 attack, others were devising ways of applying it to demon- strate new weaknesses in computer security ... See full document

66

The  Randomized  Iterate  Revisited -  Almost  Linear  Seed  Length  PRGs  from  A  Broader  Class  of  One-way  Functions

The Randomized Iterate Revisited - Almost Linear Seed Length PRGs from A Broader Class of One-way Functions

... optimally from known(-almost)-regular one-way functions, ...underlying one-way functions (and at the same time improving the efficiency of the resulting pseudorandom ... See full document

24

Compositions  of  linear  functions   and  applications  to  hashing

Compositions of linear functions and applications to hashing

... hash functions, including our function, over hash functions in the SHA fam- ily is that computing any Cayley hash function H can be easily parallelized due to the homomorphic property H(AB) = H(A)H(B) and ... See full document

8

Optimising hashing functions with genetic algorithms

Optimising hashing functions with genetic algorithms

... Optimising Hashing Functions with Genetic Algorithms with the software I am using, which optimises by minimising the evaluation function, the performance measure is best thought of as a [r] ... See full document

30

A  Fast  Single-Key  Two-Level  Universal  Hash  Function

A Fast Single-Key Two-Level Universal Hash Function

... calls. From the work of Gueron and Kounavis [10] one obtains that for n = 128, 2 pclmulqdq calls are sufficient for the reduction while for n = 256, 4 pclmulqdq calls are ... See full document

23

Show all 10000 documents...