Filters








22 Hits in 1.8 sec

Connecting tweakable and multi-key blockcipher security

Jooyoung Lee, Atul Luykx, Bart Mennink, Kazuhiko Minematsu
2017 Designs, Codes and Cryptography  
We show an equivalence between blockcipher multi-key security and tweakable blockcipher security.  ...  In this work, we formalize the multi-key security of tweakable blockciphers in case of general key derivation functions.  ...  Tweakable Blockciphers Versus Multi-Key Security By introducing KDF's in the definition of multi-key security of blockciphers, the connection between multi-key security and tweakable security of blockciphers  ... 
doi:10.1007/s10623-017-0347-3 fatcat:slpezhutubfhllxafjxo7pwsvm

Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security

Yusuke Naito
2017 IACR Transactions on Symmetric Cryptology  
However, the existing efficient blockcipher-based TBCs are secure up to the birthday bound, where the underlying keyed blockcipher is a secure strong pseudorandom permutation.  ...  In this paper, we present a TBC, XKX, that offers efficient blockcipher-based AE schemes with BBB security, by combining with efficient TBC-based AE schemes such as ΘCB3 and  ...  Acknowledgements We would like to thank Jérémy Jean and the anonymous reviewers for their comments and suggestions.  ... 
doi:10.46586/tosc.v2017.i2.1-26 fatcat:7hacsjdldne5lmzuj5ljrbqrgi

Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security

Yusuke Naito
2017 IACR Transactions on Symmetric Cryptology  
However, the existing efficient blockcipher-based TBCs are secure up to the birthday bound, where the underlying keyed blockcipher is a secure strong pseudorandom permutation.  ...  almost xor universal hash function, and the hash value is xor-ed with the input and output blocks of a blockcipher with the nonce-dependent key (from Liskov et al.).  ...  Acknowledgements We would like to thank Jérémy Jean and the anonymous reviewers for their comments and suggestions.  ... 
doi:10.13154/tosc.v2017.i2.1-26 dblp:journals/tosc/000117 fatcat:kiiogdydxjd5hp75ubnfxk3fja

Modes of Operation Suitable for Computing on Encrypted Data

Dragos Rotaru, Nigel P. Smart, Martijn Stam
2017 IACR Transactions on Symmetric Cryptology  
In doing this conversion we examine the associated security proofs of PMAC and OTR, and show that they carry over to this new setting.  ...  In particular the modes are highly parallel, and do not require evaluation of the inverse of the underlying PRF.  ...  A key application of blockciphers and PRFs is to authenticate and encrypt data.  ... 
doi:10.13154/tosc.v2017.i3.294-324 dblp:journals/tosc/RotaruSS17 fatcat:shef7sk2pba57kb5dy5nugrlia

Modes of Operation Suitable for Computing on Encrypted Data

Dragos Rotaru, Nigel P. Smart, Martijn Stam
2017 IACR Transactions on Symmetric Cryptology  
In doing this conversion we examine the associated security proofs of PMAC and OTR, and show that they carry over to this new setting.  ...  In particular the modes are highly parallel, and do not require evaluation of the inverse of the underlying PRF.  ...  A key application of blockciphers and PRFs is to authenticate and encrypt data.  ... 
doi:10.46586/tosc.v2017.i3.294-324 fatcat:ums2prp45jhkpnulf2grrbfmwq

Salvaging Weak Security Bounds for Blockcipher-Based Constructions [chapter]

Thomas Shrimpton, R. Seth Terashima
2016 Lecture Notes in Computer Science  
The ICM-KOA provides a conceptual bridge between ideal ciphers and tweakable blockciphers (TBC): blockcipher-based constructions secure in the ICM-KOA have TBC-based analogs that are secure under standard-model  ...  , or when a large number of connections need to be kept secure.  ...  Connection to TBC-based constructions A tweakable blockcipher E is a (strong) TPRP if a keyed instance of E is computationally indistinguishable from an ideal cipher.  ... 
doi:10.1007/978-3-662-53887-6_16 fatcat:6hzbulnrfjaflmjj32spfgxozu

Multi-key Analysis of Tweakable Even-Mansour with Applications to Minalpher and OPP

Zhiyuan Guo, Wenling Wu, Renzhang Liu, Liting Zhang
2017 IACR Transactions on Symmetric Cryptology  
In the present paper, we evaluate the multi-key security of TEM-1, one of the most commonly used one-round tweakable Even-Mansour schemes (formally introduced at CRYPTO 2015), which is constructed from  ...  The tweakable Even-Mansour construction generalizes the conventional Even-Mansour scheme through replacing round keys by strings derived from a master key and a tweak.  ...  This work is supported by the National Basic Research Program of China (No.2013CB338002) and National Natural Science Foundation of China (No.61272476, No.61672509, No.61572484).  ... 
doi:10.46586/tosc.v2016.i2.288-306 fatcat:2dg5ktpl3vavzmvl6vcpxkq23q

Multi-key Analysis of Tweakable Even-Mansour with Applications to Minalpher and OPP

Zhiyuan Guo, Wenling Wu, Renzhang Liu, Liting Zhang
2017 IACR Transactions on Symmetric Cryptology  
In the present paper, we evaluate the multi-key security of TEM-1, one of the most commonly used one-round tweakable Even-Mansour schemes (formally introduced at CRYPTO 2015), which is constructed from  ...  The tweakable Even-Mansour construction generalizes the conventional Even-Mansour scheme through replacing round keys by strings derived from a master key and a tweak.  ...  This work is supported by the National Basic Research Program of China (No.2013CB338002) and National Natural Science Foundation of China (No.61272476, No.61672509, No.61572484).  ... 
doi:10.13154/tosc.v2016.i2.288-306 dblp:journals/tosc/GuoWLZ16 fatcat:besakbj35bgbpm2mfqfocmmwda

Beyond-Birthday-Bound Security for 4-round Linear Substitution-Permutation Networks

Yuan Gao, Chun Guo, Meiqin Wang, Weijia Wang, Jiejing Wen
2020 IACR Transactions on Symmetric Cryptology  
In this paper, we overcome this birthday barrier and prove that a 4-round SPN with linear diffusion layers and independent round keys is secure up to 22n/3 queries.  ...  s conditions for birthday security. These provides additional theoretic supports for real world SPN blockciphers.  ...  They showed that two rounds of such tweakable non-linear SPNs are secure tweakable blockciphers [LRW11] up to roughly 2 2n/3 adversarial queries.  ... 
doi:10.13154/tosc.v2020.i3.305-326 dblp:journals/tosc/GaoGWWW20 fatcat:xg5qxnyk6fev3n7pqtqfqqisim

Fast Message Franking: From Invisible Salamanders to Encryptment [chapter]

Yevgeniy Dodis, Paul Grubbs, Thomas Ristenpart, Joanne Woodage
2018 Lecture Notes in Computer Science  
Given this connection, we can exploit previous work on ruling out fixed-key blockcipher-based CR hashing [34, 35, 37].  ...  We are inspired by (and will later exploit connections to) the definitions of rate from the blockcipher-based hash function literature [9, 34, 35].  ... 
doi:10.1007/978-3-319-96884-1_6 fatcat:oixsx5op45f7zlqht2inyauoka

Disk encryption: do we need to preserve length?

Debrup Chakraborty, Cuauhtemoc Mancillas López, Palash Sarkar
2017 Journal of Cryptographic Engineering  
The notion of a tweakable enciphering scheme (TES) has been formalised as the appropriate primitive for disk encryption and it has been argued that they provide the maximum security possible for a tag-less  ...  We provide the full specification of BCTR, prove its security and also report an efficient implementation in reconfigurable hardware.  ...  Using known techniques, it is possible to generate the key h using the block-cipher key and still obtain a secure construction, but this would mean one more blockcipher call or a storage of key related  ... 
doi:10.1007/s13389-016-0147-0 fatcat:6xqudl2ekjdxlf6b7i7ptlw45a

On the Composition of Single-Keyed Tweakable Even-Mansour for Achieving BBB Security

Avik Chakraborti, Mridul Nandi, Suprita Talnikar, Kan Yasuda
2020 IACR Transactions on Symmetric Cryptology  
Our first construction requires only one instance of an RP and requires only one key.  ...  In this work, we extend research in this direction by providing two new BBB-secure constructions by composing the tweakable Even-Mansour appropriately.  ...  Avik Chakraborti, Mridul Nandi and Suprita Talnikar are supported by the project "Study and Analysis of IoT Security" under Government of India at R.C.Bose Centre for Cryptology and Security, Indian Statistical  ... 
doi:10.13154/tosc.v2020.i2.1-39 dblp:journals/tosc/ChakrabortiNTY20 fatcat:nlub7np6wbat7n7cenwfevzgxa

Provable Security of SP Networks with Partial Non-Linear Layers

Chun Guo, François-Xavier Standaert, Weijia Wang, Xiao Wang, Yu Yu
2021 IACR Transactions on Symmetric Cryptology  
structure partial SPNs, i.e., Substitution-Permutation Networks (SPNs) with parts of the substitution layer replaced by an identity mapping, and put forward the first provable security analysis for such  ...  Motivated by the recent trend towards low multiplicative complexity blockciphers (e.g., Zorro, CHES 2013; LowMC, EUROCRYPT 2015; HADES, EUROCRYPT 2020; MALICIOUS, CRYPTO 2020), we study their underlying  ...  turns difficult for SPRPs using field multiplications (e.g., [NR99] ) or tweakable blockciphers (e.g., [BLN18] ).  ... 
doi:10.46586/tosc.v2021.i2.353-388 fatcat:uvgca5mycjekjfe7go7wmxxydy

Towards Low-Energy Leakage-Resistant Authenticated Encryption from the Duplex Sponge Construction

Chun Guo, Olivier Pereira, Thomas Peters, François-Xavier Standaert
2020 IACR Transactions on Symmetric Cryptology  
Based on this, we propose a new 1-pass AE mode TETSponge, which carefully combines a tweakable block cipher that must have strong protections against side-channel attacks and is scarcely used, and a duplex-style  ...  cryptography standardization process highlights the importance of resistance to side-channel attacks, which has renewed the interest for Authenticated Encryption schemes (AEs) with light(er)-weight sidechannel secure  ...  This work has been funded in parts by the European Union through the ERC project SWORD (724725), and the European Union and Walloon Region FEDER USERMedia project 501907-379156.  ... 
doi:10.13154/tosc.v2020.i1.6-42 dblp:journals/tosc/GuoPPS20 fatcat:rqfvudal2re6znqzn7umrtdxnm

The Oribatida v1.3 Family of Lightweight Authenticated Encryption Schemes

Arghya Bhattacharjee, Cuauhtemoc Mancillas López, Eik List, Mridul Nandi
2021 Journal of Mathematical Cryptology  
We prove its security under nonce-respecting and Int-RUP adversaries. We show that our Int-RUP bound is tight and show general attacks on previous constructions.  ...  However, their security is upper bounded by O(σ 2/2 c ) bits, where σ are the number of calls and c is the hidden capacity of the state.  ...  We the authors hereby declare that we have no conflict of interest in connection with evaluated manuscripts.  ... 
doi:10.1515/jmc-2020-0018 fatcat:i4bgdxscfbcb7hju5p7ihoyomy
« Previous Showing results 1 — 15 out of 22 results