Filters








2,650 Hits in 5.7 sec

All-or-Nothing Transform and Remotely Keyed Encryption Protocols [chapter]

Sang Uk Shin, Weon Shin, Kyung Hyune Rhee
<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;
By using all-or-nothing transform(AONT), RKE can be more dependent on the entire input and all encryption operation can be implemented only by using hash functions in the host.  ...  In proposed protocols, we use the cryptographic transform with all-or-nothing properties proposed by Rivest as encryption operation in the host.  ...  As All-Or-Nothing Transform(AONT) with all-or-nothing properties, we use an improved version of the AON hashing-3 proposed by Shin, et al [11] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-46588-1_13">doi:10.1007/978-3-540-46588-1_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pz4ee5vkwbavjaujunrto765um">fatcat:pz4ee5vkwbavjaujunrto765um</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502052200/https://link.springer.com/content/pdf/10.1007%2F978-3-540-46588-1_13.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/71/7c/717cb0dddd691441e3628e7ab36585294e9e6ba3.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-540-46588-1_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

When Hashes Collide

P. Gutmann, D. Naccache, C.C. Palmer
<span title="">2005</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kt7pnevei5bd5ed4soqmccmdte" style="color: black;">IEEE Security and Privacy</a> </i> &nbsp;
The two main uses of hash functions, besides simple hashing, are as pseudorandom functions (PRFs) and MACs (message authentication codes-specifically, a hashbased MAC, or HMAC).  ...  protocols that use MD5 and SHA-1 aren't affected by the recently published attacks-they only use the PRF and HMAC form of the hash functions, not the pure hash form.  ...  * voting member of the Board of Governors † nonvoting member of the Board of Governors E X E C U T I V E S T A F F  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/msp.2005.84">doi:10.1109/msp.2005.84</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6ssg3aq3cfgz5kb7esduf4wzey">fatcat:6ssg3aq3cfgz5kb7esduf4wzey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829103636/http://www.mathcs.emory.edu/~whalen/Hash/Hash_Articles/IEEE/When%20hashes%20collide%20%5Bapplied%20cryptography%5D.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/f2/09/f209898b06efd5154c9f82097ef54a85ffbda9b8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/msp.2005.84"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Flowchart description of security primitives for controlled physical unclonable functions

Boris Škorić, Marc X. Makkes
<span title="2010-08-03">2010</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pmp3fe6mtncjnmxpkeavdxh6sm" style="color: black;">International Journal of Information Security</a> </i> &nbsp;
Physical Unclonable Functions (PUFs) are physical objects that are unique, practically unclonable and that behave like a random function when subjected to a challenge.  ...  Their use has been proposed for authentication tokens and anti-counterfeiting.  ...  Acknowledgements We thank Stefan Katzenbeisser for useful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10207-010-0113-2">doi:10.1007/s10207-010-0113-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d3aqttudb5c3dljxvaiiy3356m">fatcat:d3aqttudb5c3dljxvaiiy3356m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120508173522/http://eprint.iacr.org/2009/328.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/c1/42/c14250feec6c15ec8274f6a3855f236dc0475426.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10207-010-0113-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

UMAC: Fast and Secure Message Authentication [chapter]

J. Black, S. Halevi, H. Krawczyk, T. Krovetz, P. Rogaway
<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;
The "cryptographic" work of UMAC is done using standard primitives of the user's choice, such as a block cipher or cryptographic hash function; no new heuristic primitives are developed here.  ...  ., HMAC-SHA1), and about twice as fast as times previously reported for the universal hash-function family MMH.  ...  The probability is over the random choice of hash function. As described in [28] , a universal hash-function family can be used to build a MAC.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48405-1_14">doi:10.1007/3-540-48405-1_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3wuhsz4wd5co5bobz5ile62hju">fatcat:3wuhsz4wd5co5bobz5ile62hju</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070118133236/http://fastcrypto.org:80/umac/umac_proc.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/c8/58/c8584c2f8b3d437b0e816e5a48b2508e14e6ae27.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-48405-1_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Key-Indistinguishable Message Authentication Codes [chapter]

Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
On the other hand, we also give a very simple and efficient construction based on a PRF which allows us to base KI MACs on some ideal primitives such as an ideal compression function (using HMAC) or block-cipher  ...  On the one hand, we show that KI MACs can be built from hash proof systems and certain weak PRFs allowing us to base security on such assumption as DDH, CDH and LWE.  ...  hash function following the 'hash and then MAC' paradigm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-10879-7_27">doi:10.1007/978-3-319-10879-7_27</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2uhjdyvxenewlje7xsihjhlclq">fatcat:2uhjdyvxenewlje7xsihjhlclq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151022131945/http://eprint.iacr.org/2014/107.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/71/f3/71f3b601928443c8438cc267f11ab1f63089860e.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-319-10879-7_27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 2290 of Mathematical Reviews Vol. , Issue 2003C [page]

<span title="">2003</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;
In this paper secure hash functions with an all-or-nothing property that is a version of the encryption mode proposed by Rivest are proposed.  ...  Harald Baier (Darmstadt) 2003c:94033 94A60 68P25 Shin, Sang Uk; Rhee, Kyung Hyune (KR-PUK-ECC; Pusan) A new design of the hash functions with all-or-nothing property.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2003-03_2003c/page/2290" 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_2003-03_2003c/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A Lightweight Mechanism for Dependable Communication in Untrusted Networks

Michael Rogers, Saleem Bhatti
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/64vpoz5fx5azda553iibjuf7h4" style="color: black;">37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN&#39;07)</a> </i> &nbsp;
do not need to share keys with the originator or destination, or to know their identities.  ...  Nodes perform only relatively lightweight operations per message, and only the originator and destination need to trust each other.  ...  As long as these properties are true for any specific MAC and hash function used to implement our protocol, we consider U-ACKs to be unforgeable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/dsn.2007.9">doi:10.1109/dsn.2007.9</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/dsn/RogersB07.html">dblp:conf/dsn/RogersB07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7upypemaszd55plyqusurj2soa">fatcat:7upypemaszd55plyqusurj2soa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808022848/http://www.inf.ufpr.br/aldri/disc/artigos/2008/lightweight.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/64/25/64257a22926474cee6d9e819b99466e0293f8060.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/dsn.2007.9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

SipHash: A Fast Short-Input PRF [chapter]

Jean-Philippe Aumasson, Daniel J. Bernstein
<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;
SipHash is simpler than MACs based on universal hashing, and faster on short inputs.  ...  We propose that hash tables switch to SipHash as a hash function.  ...  For comparison, weak secret hash functions and (weak or strong) public hash functions allow n to grow linearly with the volume of attacker communication.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-34931-7_28">doi:10.1007/978-3-642-34931-7_28</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7m47ds3szbaqde6xhsjlu3vehu">fatcat:7m47ds3szbaqde6xhsjlu3vehu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190309170414/http://pdfs.semanticscholar.org/fcc1/380c4f1ac076ae6323fd9faf1444d43fb012.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/fc/c1/fcc1380c4f1ac076ae6323fd9faf1444d43fb012.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-34931-7_28"> <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 Revisited: How to Construct a Hash Function [chapter]

Jean-Sébastien Coron, Yevgeniy Dodis, Cécile Malinaud, Prashant Puniya
<span title="">2005</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;
Under this notion, the arbitrary length hash function H must behave as a random oracle when the fixed-length building block is viewed as a random oracle or an ideal block-cipher.  ...  The compression function is usually designed from scratch or made out of a block-cipher. In this paper, we introduce a new security notion for hash-functions, stronger than collision-resistance.  ...  Acknowledgments: We would like to deeply thank Victor Shoup for his invaluable contribution to all aspects of this work. We also thank the anonymous referees for many useful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11535218_26">doi:10.1007/11535218_26</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n543i5e7wnef7kdpfo3z4sdaqu">fatcat:n543i5e7wnef7kdpfo3z4sdaqu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081118013925/http://www.gemplus.com/smart/rd/publications/pdf/CDMP05.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/22/3f/223fd51623290175cb503c6eb2e2d7e994d4b0d1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11535218_26"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Security considerations for incremental hash functions based on pair block chaining

Raphael C.-W. Phan, David Wagner
<span title="">2006</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e25s2ofdbnfb3j2rstrnkqsqfi" style="color: black;">Computers &amp; security</a> </i> &nbsp;
without having to re-hash the message as was the case in conventional hash functions.  ...  We then identify some design and implementation criteria for such incremental hash functions.  ...  Acknowledgement The first author is grateful to B.-M. Goi for helpful discussions on the PCIHF and comments on some initial ideas presented here.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.cose.2005.12.006">doi:10.1016/j.cose.2005.12.006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bamjkarbyvgghfu4xw6yp7uvum">fatcat:bamjkarbyvgghfu4xw6yp7uvum</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070609180521/http://www.cs.berkeley.edu/~daw/papers/inchash-cs06.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/06/63/0663240264b585892c6c5f394ad7f5bd3dbea5ed.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.cose.2005.12.006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

From Computationally-Proved Protocol Specifications to Implementations and Application to SSH

David Cadé, Bruno Blanchet
<span title="">2013</span> <i title="JoWUA"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wzskw2gcnneepegdm5qqr4h3qu" style="color: black;">Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications</a> </i> &nbsp;
We formally specify the protocol to prove, we prove this specification using the computationally-sound protocol verifier CryptoVerif, and we automatically translate it into an implementation in OCaml using  ...  We applied this approach to the SSH Transport Layer protocol: we proved the authentication of the server and the secrecy of the session keys in this protocol and verified that the generated implementation  ...  Acknowledgments This work was partly supported by the ANR project ProSe (decision ANR 2010-VERS-004). It was partly done while the authors were at École Normale Supérieure, Paris.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22667/jowua.2013.03.31.004">doi:10.22667/jowua.2013.03.31.004</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/jowua/CadeB13.html">dblp:journals/jowua/CadeB13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4v5farrgwbgobibgahki6m3p5m">fatcat:4v5farrgwbgobibgahki6m3p5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210102125942/http://isyou.info/jowua/papers/jowua-v4n1-1.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/93/87/9387c11f7e3ed58990451a6845d1325805b91997.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22667/jowua.2013.03.31.004"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Chaffinch: Confidentiality in the Face of Legal Threats [chapter]

Richard Clayton, George Danezis
<span title="2002-12-18">2002</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 identify a weakness in Rivest's particular choice of his "package transform" as an "all-or-nothing" element within his scheme.  ...  The mechanism is an adaptation of Rivest's "chaffing and winnowing", which has the legal advantage of using authentication keys to provide privacy.  ...  Acknowledgements We would like to thank Dr Ross Anderson for his comments on drafts of this paper and for pointing out the simplification achieved by use of the BEAR cipher.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36415-3_5">doi:10.1007/3-540-36415-3_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/66lhhalarrglxmuvfdc7iwyphi">fatcat:66lhhalarrglxmuvfdc7iwyphi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20031205035335/http://www.cl.cam.ac.uk:80/~rnc1/Chaffinch.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/98/1e/981e5a0159b4ee37e5af4c8b32da5205339d4a07.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-36415-3_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Quantum-secure message authentication via blind-unforgeability [article]

Gorjan Alagic, Christian Majenz, Alexander Russell, Fang Song
<span title="2018-11-25">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In addition, we show that BU satisfies a composition property (Hash-and-MAC) using "Bernoulli-preserving" hash functions, a new notion which may be of independent interest.  ...  We then propose a new definition, which we call "blind-unforgeability" (or BU.) This notion matches "intuitive unpredictability" in all examples studied thus far.  ...  Let |ψ = x |x |f (x) denote the post-query state, and consider applying to |ψ the POVM {E p } p which identifies the property (but measures nothing else.)  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.03761v2">arXiv:1803.03761v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/efmdaf2mkfczfiecwxy2c2hgri">fatcat:efmdaf2mkfczfiecwxy2c2hgri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200908052535/https://arxiv.org/pdf/1803.03761v2.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/a0/7d/a07d742d52c52c7e81a9a716d63cc50bd00e368c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.03761v2" 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>

Multi-Property-Preserving Hash Domain Extension and the EMD Transform [chapter]

Mihir Bellare, Thomas Ristenpart
<span title="">2006</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 point out that the seemingly strong pseudorandom oracle preserving (PRO-Pr) property of hash function domain-extension transforms defined and implemented by Coron et. al. [12] can actually weaken our  ...  guarantees on the hash function, in particular producing a hash function that fails to be even collision-resistant (CR) even though the compression function to which the transform is applied is CR.  ...  Acknowledgments We would like to thank Thomas Shrimpton for valuable feedback on an earlier draft of this paper and Donghoon Chang for pointing out a mistake in an earlier proof of Lemma 5.1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11935230_20">doi:10.1007/11935230_20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xrvcfv4tqvgvvkioxdcvtaac7m">fatcat:xrvcfv4tqvgvvkioxdcvtaac7m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809152711/http://cseweb.ucsd.edu/~mihir/papers/hashdomext.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/e6/90/e6908ab9e6273cf55c902d8d286f36f0dfce4b04.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11935230_20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Mechanized Network Origin and Path Authenticity Proofs

Fuyuan Zhang, Limin Jia, Cristina Basescu, Tiffany Hyun-Jin Kim, Yih-Chun Hu, Adrian Perrig
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rau5643b7ncwvh74y6p64hntle" style="color: black;">Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS &#39;14</a> </i> &nbsp;
To the best of our knowledge, we are the first to formalize origin and path authenticity properties, and mechanize proofs that chained MACs can provide the desired authenticity properties.  ...  To analyze a source-routing protocol that uses chained MACs to provide origin and path validation, we construct Coq proofs to show that the protocol satisfies its desired properties.  ...  PVFS0 = mac(KD, (hash(pkt))) PVFSi = mac(KSi, (PVFSi−1)) OPVi = mac(KSi, (PVFSi−1, Ri−1, hash(pkt))) PVFD0 = PVFS0 PVFDi = mac(KDi, (PVFDi−1, Ri−1, hash(pkt))) The source S computes PVFS0, PVFD0, and all  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2660267.2660349">doi:10.1145/2660267.2660349</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ccs/ZhangJBKHP14.html">dblp:conf/ccs/ZhangJBKHP14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m333zqe7mvaflp6tf4o4edak6i">fatcat:m333zqe7mvaflp6tf4o4edak6i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815034913/http://www.cs.cmu.edu/~xia/resources/Documents/zhang_ccs14.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/bf/5b/bf5b116addb574a78f3439b23c9a757a3dee73da.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2660267.2660349"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 2,650 results