A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Improved Constructions of PRFs Secure Against Related-Key Attacks
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
As a result, we achieve the first PRFs from lattices secure against an (almost) linear class of related-key functions. ...
Building cryptographic primitives that are secure against related-key attacks (RKAs) is a well-studied problem by practitioners and theoreticians alike. ...
Conclusions We construct the first lattice-based PRFs secure against a class of related-key attacks from an (almost) linear class of functions. ...
doi:10.1007/978-3-319-07536-5_4
fatcat:6tubyllv5bduxal5qmoljazg64
Ciphers Secure against Related-Key Attacks
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper studies the security of PRF-and PRP-constructions against related-key attacks. ...
As it turned out, the security of a scheme against related-key attacks greatly depends on the adversary's capabilities, namely on the set of key transformations available to her. ...
-In Section 3, we explore equivalent constructions for related-key secure PRFs, and we consider the composition of conventionally secure and related-key secure PRFs. ...
doi:10.1007/978-3-540-25937-4_23
fatcat:evqum7qqsrcoviup3jfozxzzfq
Towards Super-Exponential Side-Channel Security with Efficient Leakage-Resilient PRFs
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
On the other hand, we present tweaks for tree-based leakage-resilient PRFs that improve their efficiency and their security, by taking advantage of parallel implementations. ...
Our security analyses are based on worst-case attacks in a noise-free setting and suggest that under reasonable assumptions, the side-channel resistance of our construction grows super-exponentially with ...
Efficiently Exploiting Parallelism In this section, we study how parallelism improves the security against DPA attacks and the efficiency of a tree-based PRF. ...
doi:10.1007/978-3-642-33027-8_12
fatcat:zcsby2htsjezvhzithkrgkinca
Notions and relations for RKA-secure permutation and function families
2010
Designs, Codes and Cryptography
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We can exploit it to get various constructions secure against some classes of related-key attacks from known MAC algorithms. ...
of SPRP against some classes of related-key attacks (SPRP-RKA). ...
Also we thank anonymous referees for their constructive comments. ...
doi:10.1007/s10623-010-9414-8
fatcat:ajkmyhcgojfx3mryyogqjrnaiu
A Time-Success Ratio Analysis of wPRF-based Leakage-Resilient Stream Ciphers
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Second, we revisit the current proof techniques and answer the natural question of how far we are from meaningful and provable security guarantees, when instantiating weak PRFs with standard primitives ...
The aim of this paper is twofold. First, we present a clear comparison of quantitatively different security bounds in the literature. ...
We consider the security of AES256 as a weak PRF, and not a standard PRF, because of non-uniform attacks which show that no PRF with a k bit key can have s/ǫ ≈ 2 k security [DTT09] , at least unless we ...
arXiv:1505.06765v1
fatcat:ludquy3dejfg3o7zacskftkefy
Secret-key cryptography from ideal primitives: A systematic overview
2015
2015 IEEE Information Theory Workshop (ITW)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Secret-key constructions are often proved secure in a model where one or more underlying components are replaced by an idealized oracle accessible to the attacker. ...
This paper provides a systematic overview of what is achievable in this model, and how existing works fit into this view. ...
Very recently, the notion of PRF and PRP security against related-key attacks has also been shown to be attainable in [14] , [8] . ...
doi:10.1109/itw.2015.7133163
dblp:conf/itw/GaziT15
fatcat:savmeulb2reuposgktwxjq5jxi
The Exact PRF-Security of NMAC and HMAC
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
PRF against q queries of length at most blocks each. ...
-Our first contribution is a simpler and uniform proof for this fact: If f is an ε-secure PRF (against q queries) and a δ-non-adaptively secure PRF (against q queries), then NMAC f is an (ε + qδ)-secure ...
Moreover, security of the single-key version of HMAC requires the PRF to be secure under a specific class of related-key attacks. ...
doi:10.1007/978-3-662-44371-2_7
fatcat:73lqg3xzgnbdbk4oyf5x5c7yeu
Optimal PRFs from Blockcipher Designs
2017
IACR Transactions on Symmetric Cryptology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It shows strong resemblance with the optimally secure EDMD construction by Mennink and Neves (CRYPTO 2017), but the use of internal state values make their security analysis formally inapplicable. ...
We conjecture that our main proposal AES-PRF, AES with a feed-forward of the middle state, achieves close to optimal security. ...
The authors are thankful to the anonymous reviewers of FSE 2018 for their useful technical comments, to Pierre Karpman and Atul Luykx for preliminary discussions, to Tetsu Iwata and Yannick Seurin for ...
doi:10.13154/tosc.v2017.i3.228-252
dblp:journals/tosc/MenninkN17
fatcat:2xfj5naymrhypmfisq3tk7l4xu
Optimal PRFs from Blockcipher Designs
2017
IACR Transactions on Symmetric Cryptology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It shows strong resemblance with the optimally secure EDMD construction by Mennink and Neves (CRYPTO 2017), but the use of internal state values make their security analysis formally inapplicable. ...
We conjecture that our main proposal AES-PRF, AES with a feed-forward of the middle state, achieves close to optimal security. ...
The authors are thankful to the anonymous reviewers of FSE 2018 for their useful technical comments, to Pierre Karpman and Atul Luykx for preliminary discussions, to Tetsu Iwata and Yannick Seurin for ...
doi:10.46586/tosc.v2017.i3.228-252
fatcat:g67mmdob7vd3ferfjkw2dphxgu
The Related-Key Analysis of Feistel Constructions
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
However, irrespective of the number of rounds, no Feistel construction can resist related-key attacks where the keys can be offset by a constant. ...
In this paper we show that, under suitable reuse of round keys, security under related-key attacks can be provably attained. ...
Pooya Farshim was supported by grant Fi 940/4-1 of the German Research Foundation (DFG). ...
doi:10.1007/978-3-662-46706-0_14
fatcat:gg7huflgxvebdns7mcphyuma5u
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions
[chapter]
2010
Information Security and Cryptography
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We construct a block cipher based on PUF-PRFs that allows simultaneous protection against algorithmic and physical attackers, in particular against memory attacks. ...
PUFs enjoy their security from physical structures at submicron level and are very useful primitives to protect against memory attacks. ...
An improved and practical PUF-PRF construction. ...
doi:10.1007/978-3-642-14452-3_6
dblp:series/isc/ArmknechtMSST10
fatcat:676z7f56arfo5b7viqnlcdmdlu
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We construct a block cipher based on PUF-PRFs that allows simultaneous protection against algorithmic and physical attackers, in particular against memory attacks. ...
PUFs enjoy their security from physical structures at submicron level and are very useful primitives to protect against memory attacks. ...
An improved and practical PUF-PRF construction. ...
doi:10.1007/978-3-642-10366-7_40
fatcat:3h5uf4q6yrghrfsgrn42qgfhga
Secure Message Authentication Against Related-Key Attack
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Security against related-key attacks is an important criteria for modern cryptographic constructions. ...
We show that unlike PRFs, MACs can inherently tolerate related-key attacks against constant transformations. ...
Part of this work was done when Rishi was at the Centre of Excellence in Cryptology of Indian Statistical Institute, Kolkata. ...
doi:10.1007/978-3-662-43933-3_16
fatcat:yz3xlvuk4zcgvbets5efbfc5sm
Leakage-Resilient Symmetric Encryption via Re-keying
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The main advantage of the AES block cipher is that its implementations are generally heuristically-secure against SPA adversaries. ...
Indeed, in such analysis, the adversary queries the encryption box and from the knowledge of the plaintext/ciphertext, she can perform a divide-and-conquer key recovery attack. ...
Since the related keys leak, we replace all the invocations of the related weak PRFs φ 2 and φ 3 by truly random functions: R ← R n,n : K j ← $ for all keys generated from low keys c i ← φ(K i , r i ) ...
doi:10.1007/978-3-642-40349-1_27
fatcat:tmlge3hzsfbevl2rvhsjq54v2a
Retrofitting Leakage Resilient Authenticated Encryption to Microcontrollers
2020
Transactions on Cryptographic Hardware and Embedded Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The LR-PRF construction leverages frequent key changes and low data complexity together with key dependent noise from parallel hardware to protect against side-channel attacks. ...
In this work, we demonstrate how unprotected hardware AES engines of COTS microcontrollers can be efficiently protected against side-channel attacks by constructing a leakage resilient pseudo random function ...
Acknowledgments The work presented in this contribution was supported by the German Federal Ministry of Education and Research in the project ALESSIO through grant number 16KIS0629 and 16KIS0632. ...
doi:10.13154/tches.v2020.i4.365-388
dblp:journals/tches/UntersteinSSTIH20
fatcat:vly45rwqdzhrjagqernn7vhdva
« Previous
Showing results 1 — 15 out of 2,298 results