Filters

19,210 Hits in 5.8 sec

### Page 4422 of Mathematical Reviews Vol. , Issue 95g [page]

<span title="">1995</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Section 4 presents proofs of new lower bounds on the number of hash functions in certain types of universal classes and gives the basic construction for authentication codes from universal classes of hash  ...  “Non-block-cipher-based hash functions include a spectrum of many different proposals based on one-way functions from differ- ent branches of mathematics.  ...
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1995-07_95g/page/4422" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1995-07_95g/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

### Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? [chapter]

Daniel R. Simon
<span title="">1998</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Thus any proof that such functions can be derived from these weaker primitives is necessarily non-relativizing; in particular, no provable construction of a collision-intractable hash function can exist  ...  hash functions.  ...  Note that a universal one-way hash function family is itself automatically a universal one-way hash function.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0054137">doi:10.1007/bfb0054137</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oq6qfgldnfesfgdz4wjoxvarmi">fatcat:oq6qfgldnfesfgdz4wjoxvarmi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190222021757/http://pdfs.semanticscholar.org/3087/0bd03634fc8fba34b3ae2cd959d822a40f1b.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/30/87/30870bd03634fc8fba34b3ae2cd959d822a40f1b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0054137"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

### A Composition Theorem for Universal One-Way Hash Functions [chapter]

Victor Shoup
<span title="">2000</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash xed-length messages.  ...  The new construction is extremely simple and is also very e cient, yielding shorter keys than previously proposed composition constructions.  ...  Introduction In this paper we consider the problem of constructing universal one-way hash functions (UOWHFs). The notion of a UOWHF was introduced by Naor and Yung 7] .  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45539-6_32">doi:10.1007/3-540-45539-6_32</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/23xnwdeysvb3fhx7sawp2oxme4">fatcat:23xnwdeysvb3fhx7sawp2oxme4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307155516/http://pdfs.semanticscholar.org/e2bf/0fd81a5fbd92288ca4ac83a7afe40a9c3d90.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e2/bf/e2bf0fd81a5fbd92288ca4ac83a7afe40a9c3d90.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45539-6_32"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

### Quantum Communications Based on Quantum Hashing [article]

Alexander Vasiliev
<span title="2016-03-07">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Based on the characteristic polynomial presentation of Boolean functions and quantum hashing technique we present a method for computing Boolean functions in the quantum one-way communication model, where  ...  The combination of binary functions on non-binary quantum hash function is done via polynomial presentation, which we have called a characteristic of a Boolean function.  ...  ACKNOWLEDGEMENTS The work is performed according to the Russian Government Program of Competitive Growth of Kazan Federal University.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1312.1661v2">arXiv:1312.1661v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kiq6l3pcefeodabh5asckethyu">fatcat:kiq6l3pcefeodabh5asckethyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929205232/https://arxiv.org/ftp/arxiv/papers/1312/1312.1661.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/00/08/000874e44f521ffe58c36d9ffb167316e27efe3d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1312.1661v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

### The State of Cryptographic Hash Functions [chapter]

Bart Preneel
<span title="">1999</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This paper describes the state of the art for cryptographic hash functions. Different definitions are compared, and the few theoretical results on hash functions are discussed.  ...  A brief overview is presented of the most important constructions, and some open problems are presented.  ...  Then we look at some related concepts, namely message authentication codes (MACs), universal one-way hash functions (UOWHFs) and universal hash functions.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48969-x_8">doi:10.1007/3-540-48969-x_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ij3gpzve7bc7jny2jrijlmuuem">fatcat:ij3gpzve7bc7jny2jrijlmuuem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706105520/https://www.esat.kuleuven.be/cosic/publications/article-374.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c4/e4/c4e484bf35bb44b7677b5c80d7cc1329f56315d5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48969-x_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

### Merkle-Damgård Construction Method and Alternatives: A Review

Harshvardhan Tiwari
<span title="">2017</span> <i title="University of Zagreb, Faculty of organization and informatics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uudmsuemlfhphimk5nzwudlaki" style="color: black;">Journal of Information and Organizational Sciences</a> </i> &nbsp;
Merkle-Damgård construction showed that the security of hash function depends on the security of the compression function.  ...  Several attacks on Merkle-Damgård construction based hash functions motivated researchers to propose different cryptographic constructions to enhance the security of hash functions against the differential  ...  Introduction Cryptographic hash function is a one-way and compression function that converts an arbitrary length message to a fixed length hash value.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://doaj.org/article/d297099bed4449efaf9859d6b8ef172d">doaj:d297099bed4449efaf9859d6b8ef172d</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uwue3iswfvhcjbrgk4w6rj3y7i">fatcat:uwue3iswfvhcjbrgk4w6rj3y7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200622042847/https://hrcak.srce.hr/file/281168" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7a/bf/7abf5eb51960c26dfe5fedbd0404c97ab4df5277.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

### Merkle-Damgård Construction Method and Alternatives

Harshvardhan Tiwari
<span title="2017-12-14">2017</span> <i title="Faculty of Organisation and Informatics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uudmsuemlfhphimk5nzwudlaki" style="color: black;">Journal of Information and Organizational Sciences</a> </i> &nbsp;
Merkle-Damgård construction showed that the security of hash function depends on the security of the compression function.  ...  Several attacks on Merkle-Damgård construction based hash functions motivated researchers to propose different cryptographic constructions to enhance the security of hash functions against the differential  ...  Introduction Cryptographic hash function is a one-way and compression function that converts an arbitrary length message to a fixed length hash value.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.31341/jios.41.2.9">doi:10.31341/jios.41.2.9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cfps47y2pfbmncprc7ejtevule">fatcat:cfps47y2pfbmncprc7ejtevule</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180412091631/https://jios.foi.hr/index.php/jios/article/viewFile/1070/787" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9f/bc/9fbcf2e7ae40ee2c8aaa77fa1ab66cbf8152dba4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.31341/jios.41.2.9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

### A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions

T. MATSUDA, N. ATTRAPADUNG, G. HANAOKA, K. MATSUURA, H. IMAI
<span title="2008-05-01">2008</span> <i title="Institute of Electronics, Information and Communications Engineers (IEICE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xosmgvetnbf4zpplikelekmdqe" style="color: black;">IEICE transactions on information and systems</a> </i> &nbsp;
In this paper, we construct a signature scheme which has the same properties as the BSW scheme but does not rely on collision resistant hash functions.  ...  The sizes of signatures obtained from the modified schemes are the same as the original ones for DSA and PSS-RSA, and shorter by a hash-key than the original one for the Cramer-Shoup scheme.  ...  In [26] , it was proved that a collision resistant hash function cannot be constructed from any one-way functions in a black-box manner, while it was already shown in [25] that a universal one-way hash  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/ietisy/e91-d.5.1466">doi:10.1093/ietisy/e91-d.5.1466</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5p5yjm4w65fr5gbpp3scavu7ii">fatcat:5p5yjm4w65fr5gbpp3scavu7ii</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030084909/https://www.jstage.jst.go.jp/article/transinf/E91.D/5/E91.D_5_1466/_pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/5f/d45fcff0b116fd5295fa2ec99ceef5823080682a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/ietisy/e91-d.5.1466"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

### The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions [chapter]

Scott Ames, Rosario Gennaro, Muthuramakrishnan Venkitasubramaniam
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The end result is a UOWHF construction from regular one-way functions with an O(n log n) key.  ...  This paper presents the Generalized Randomized Iterate of a (regular) one-way function f and show that it can be used to build Universal One-Way Hash Function (UOWHF) families with O(n 2 ) key length.  ...  Constructions of Universal One-Way Hash Functions In this section, we show how to construct second preimage resistant functions from regular one-way functions.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-34961-4_11">doi:10.1007/978-3-642-34961-4_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/motsd4mllfdh3h4dblc23xjsou">fatcat:motsd4mllfdh3h4dblc23xjsou</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190219042747/http://pdfs.semanticscholar.org/15c2/f7af250ccc0eb379332a4a7bbc429c4a3b0a.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/15/c2/15c2f7af250ccc0eb379332a4a7bbc429c4a3b0a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-34961-4_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

### (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond [chapter]

Yu Yu, Dawu Gu, Xiangxue Li, Jian Weng
<span title="">2015</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We revisit the problem of black-box constructions of universal one-way hash functions (UOWHFs) from several (from specific to more general) classes of one-way functions (OWFs), and give respective constructions  ...  In addition, we show how to transform any one-way function that is far from regular (but only weakly regular on a noticeable fraction of domain) into an almost-regular one-way function.  ...  [1] presented an elegant construction based on any almost-regular OWFs 11 , where no knowledge is required about the regularity of the OWF.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-48000-7_11">doi:10.1007/978-3-662-48000-7_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tw3dzlzfv5hgxaahn5qz2llsv4">fatcat:tw3dzlzfv5hgxaahn5qz2llsv4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150318071433/http://eprint.iacr.org/2014/393.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/36/21/3621026cb53e2130e15b6e21ae81d6f30945a7d5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-48000-7_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

### Almost random graphs with simple hash functions

Martin Dietzfelbinger, Philipp Woelfel
<span title="">2003</span> <i title="ACM Press"> Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC &#39;03 </i> &nbsp;
We describe a simple randomized construction for generating pairs of hash functions h 1 , h 2 from a universe U to ranges V = [m] = {0, 1, . . . , m − 1} and W = [m] so that for every key set S ⊆ U with  ...  The main new technique is the combined analysis of the graph structure and the inner structure of the hash functions, as well as a new way of looking at the cycle structure of random (multi)graphs.  ...  Acknowledgements We thank Rasmus Pagh for many interesting discussions regarding cuckoo hashing and uniform hashing as well as for valuable comments on the manuscript.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/780632.780634">doi:10.1145/780632.780634</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ugodygo3sfbj3b45bhgcpybq3e">fatcat:ugodygo3sfbj3b45bhgcpybq3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808153041/http://pages.cpsc.ucalgary.ca/~woelfel/paper/rgraphs/rgraphs.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b5/5c/b55c39fda5cb95e4d39a59c6b0078925da2d58f5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/780632.780634"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

### Almost random graphs with simple hash functions

Martin Dietzfelbinger, Philipp Woelfel
<span title="">2003</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC &#39;03</a> </i> &nbsp;
We describe a simple randomized construction for generating pairs of hash functions h 1 , h 2 from a universe U to ranges V = [m] = {0, 1, . . . , m − 1} and W = [m] so that for every key set S ⊆ U with  ...  The main new technique is the combined analysis of the graph structure and the inner structure of the hash functions, as well as a new way of looking at the cycle structure of random (multi)graphs.  ...  Acknowledgements We thank Rasmus Pagh for many interesting discussions regarding cuckoo hashing and uniform hashing as well as for valuable comments on the manuscript.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/780542.780634">doi:10.1145/780542.780634</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/DietzfelbingerW03.html">dblp:conf/stoc/DietzfelbingerW03</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k3atjyrrbbcxveb422a67jjduy">fatcat:k3atjyrrbbcxveb422a67jjduy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808153041/http://pages.cpsc.ucalgary.ca/~woelfel/paper/rgraphs/rgraphs.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b5/5c/b55c39fda5cb95e4d39a59c6b0078925da2d58f5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/780542.780634"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

### One-way functions are necessary and sufficient for secure signatures

J. Rompel
<span title="">1990</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC &#39;90</a> </i> &nbsp;
Their construction of a one-way hash function is as follows: Given f:~---*~" a one-way permutation, pick a random h : E ~ ~ E n-1 from a 2-universal family of hash functions.  ...  However, arbitrary one-way functions must be managed much more carefully. The bulk of this paper is concerned with building a one-way hash function given any one-way function.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/100216.100269">doi:10.1145/100216.100269</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/Rompel90.html">dblp:conf/stoc/Rompel90</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zt4kemcboff3lchczf4j74fsci">fatcat:zt4kemcboff3lchczf4j74fsci</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160315102702/http://www.cs.princeton.edu/courses/archive/spr08/cos598D/Rompel.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3e/ec/3eec40ebf83726d61ebba59ca97ae316a21e51e8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/100216.100269"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

### Cryptography with constant computational overhead

Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08</a> </i> &nbsp;
Our hash functions can be used to construct message authentication schemes with constant overhead from any one-way function. • Under an intractability assumption that generalizes a previous assumption  ...  This construction does not rely on any unproven assumptions and is of independent interest.  ...  We thank Omer Reingold for pointing out the construction of constant-overhead PRFs.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1374376.1374438">doi:10.1145/1374376.1374438</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/IshaiKOS08.html">dblp:conf/stoc/IshaiKOS08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/llsycwqmbndejlj57fpvjgvcdy">fatcat:llsycwqmbndejlj57fpvjgvcdy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809094933/http://web.cs.ucla.edu/~rafail/PUBLIC/91.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/d3/7cd3e868dca5a7e379b7f57910b41f33b5dcc912.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1374376.1374438"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

### Domain Extension for Enhanced Target Collision-Resistant Hash Functions [chapter]

Ilya Mironov
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We prove a new composition theorem for eTCR, and demonstrate that eTCR compression functions exist if and only if one-way functions do.  ...  We answer the question of Reyhanitabar et al. from FSE'09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear key expansion.  ...  The crucial intermediate step of the construction, proposed by Naor and Yung, is universal one-way hash functions (UOWHFs), also known as target collision-resistant (TCR) hashes.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13858-4_9">doi:10.1007/978-3-642-13858-4_9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3dfop6yderbphclg77xmez3wla">fatcat:3dfop6yderbphclg77xmez3wla</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20101226174551/http://research.microsoft.com/en-us/people/mironov/etcr.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e1/6d/e16d9fe720ef6149aad94eb46f9bc99c9bc9b50f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13858-4_9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 19,210 results