Paper published in a book (Scientific congresses, symposiums and conference proceedings)
Key Wrapping with a Fixed Permutation
Khovratovich, Dmitry
2014In Topics in Cryptology - {CT-RSA} 2014 - The Cryptographer's Track at the {RSA} Conference 2014, San Francisco, CA, USA, February 25-28, 2014. Proceedings
Peer reviewed
 

Files


Full Text
kw.pdf
Author preprint (448.63 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Abstract :
[en] We present an efficient key wrapping scheme that uses a single public permutation as the basic element. As the scheme does not rely on block ciphers, it can be used on a resource-constrained device where such a permutation comes from an implemented hash function, regular (SHA-3/Keccak) or lightweight one (Quark, Photon). The scheme is capable of wrapping keys up to 1400 bits long and processing arbitrarily long headers. Our scheme easily delivers the security level of 128 bits or higher with the master key of the same length. We use the security notion from the concept of Deterministic Authenticated Encryption (DAE) introduced by Rogaway and Shrimpton. Though the permutation is inevitably modeled as a random permutation, the resulting proof of security is short and easy to verify and hence provide a reasonable alternative to authentication modes based on block ciphers
Disciplines :
Computer science
Author, co-author :
Khovratovich, Dmitry ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Language :
English
Title :
Key Wrapping with a Fixed Permutation
Publication date :
2014
Event name :
RSA conference 2014, Cryptography Track
Event date :
from 25-02-2014 to 1-03-2014
Audience :
International
Main work title :
Topics in Cryptology - {CT-RSA} 2014 - The Cryptographer's Track at the {RSA} Conference 2014, San Francisco, CA, USA, February 25-28, 2014. Proceedings
ISBN/EAN :
978-3-319-04851-2
Collection name :
Lecture Notes in Computer Science, vol. 8366
Pages :
481-499
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 19 January 2015

Statistics


Number of views
83 (1 by Unilu)
Number of downloads
201 (1 by Unilu)

Scopus citations®
 
0
Scopus citations®
without self-citations
0

Bibliography


Similar publications



Contact ORBilu