|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{unsolved|Cryptography|'''''How to construct UOWHF of higher orders efficiently?'''''}}
| | Wilber Berryhill is [http://www.indosfriends.com/profile-253/info/ psychic readings online] what his spouse enjoys to contact him and he totally enjoys this name. Office supervising is exactly where her main income comes from but she's currently utilized for another 1. One of the things she loves most is canoeing and she's been doing it for fairly a while. I've usually cherished living in Kentucky but now I'm considering other options.<br><br>Feel free to visit my best psychic readings - [http://www.chk.woobi.co.kr/xe/?document_srl=346069 www.chk.woobi.co.kr] - web site; psychic chat online ([https://www.machlitim.org.il/subdomain/megila/end/node/12300 https://www.machlitim.org.il/]) |
| In [[cryptography]] a '''universal one-way hash function''' ('''UOWHF''', often pronounced "woof"), is a type of [[universal hashing|universal hash function]] of particular importance to [[cryptography]]. UOWHF's are proposed as an alternative to [[cryptographic hash function|collision-resistant hash functions]] (CRHFs). CRHFs have a strong collision-resistance property: that it is hard, given randomly chosen hash function parameters, to find any collision of the hash function. In contrast, UOWHFs require that it be hard to find a collision where one [[preimage]] is chosen independently of the hash function parameters.
| |
| | |
| The UOWHF family contains a finite number of hash functions with each
| |
| having the same probability of being used.
| |
| | |
| == Definition ==
| |
| | |
| The security property of a UOWHF is as follows. Let <math>A</math> be an algorithm that operates in two phases:
| |
| | |
| * Initially, <math>A</math> receives no input (or, just a security parameter) and chooses a value <math>x</math>.
| |
| * A hash function <math>H</math> is chosen from the family. <math>A</math> then receives <math>H</math> and must output <math>y \ne x</math> such that <math>H(x) = H(y)</math>.
| |
| | |
| Then for all polynomial-time <math>A</math> the probability that <math>A</math> succeeds is negligible.
| |
| | |
| == Applications ==
| |
| | |
| UOWHFs are thought to be less computationally expensive than CRHFs, and are most often used for efficiency purposes in schemes where the choice of the hash function happens at some stage of execution, rather than beforehand. For instance, the [[Cramer–Shoup cryptosystem]] uses a UOWHF as part of the validity check in its ciphertexts.
| |
| | |
| == See also ==
| |
| * [[Preimage attack]]
| |
| | |
| == Further reading ==
| |
| *{{cite book|last=Goldreich|first=Oded|title=Foundations of Cryptography|publisher=Cambridge University Press|date=2004|volume=2|url=http://www.wisdom.weizmann.ac.il/~oded/foc-vol2.html|authorlink=Oded Goldreich}}
| |
| | |
| == External links ==
| |
| * [[Moni Naor]] and [[Moti Yung]], '' "[http://www.wisdom.weizmann.ac.il/~naor/PAPERS/uowhf_abs.html Universal One-Way Hash Functions and their Cryptographic Applications]", 1989.''
| |
| | |
| [[Category:Cryptographic hash functions]]
| |
Wilber Berryhill is psychic readings online what his spouse enjoys to contact him and he totally enjoys this name. Office supervising is exactly where her main income comes from but she's currently utilized for another 1. One of the things she loves most is canoeing and she's been doing it for fairly a while. I've usually cherished living in Kentucky but now I'm considering other options.
Feel free to visit my best psychic readings - www.chk.woobi.co.kr - web site; psychic chat online (https://www.machlitim.org.il/)