368 Hits in 4.7 sec

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  
For different instances of partial SPNs using MDS linear layers, we establish strong pseudorandom security as well as practical provable security against impossible differential attacks.  ...  the substitution layer replaced by an identity mapping, and put forward the first provable security analysis for such partial SPNs built upon dedicated linear layers.  ...  P-SPN: SP Networks with Partial Non-linear Layers To ease a comparison, we first recall the standard Substitution-Permutation Networks (SPNs).  ... 
doi:10.46586/tosc.v2021.i2.353-388 fatcat:uvgca5mycjekjfe7go7wmxxydy

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  
Such theoretical SPN models may employ non-linear diffusion layers, which enables beyond-birthday-bound provable security.  ...  Though, for the model of real world blockciphers, i.e., SPN models with linear diffusion layers, existing provable results are capped at birthday security up to 2n/2 adversarial queries, where n is the  ...  Regarding the SPN model with non-linear permutation layers, Dodis et al.  ... 
doi:10.13154/tosc.v2020.i3.305-326 dblp:journals/tosc/GaoGWWW20 fatcat:xg5qxnyk6fev3n7pqtqfqqisim

Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks [chapter]

Benoît Cogliati, Yevgeniy Dodis, Jonathan Katz, Jooyoung Lee, John Steinberger, Aishwarya Thiruvengadam, Zhe Zhang
2018 Lecture Notes in Computer Science  
Finally, our non-linear SPNs can be made tweakable by incorporating the tweak into the permutation layer, and provide good multi-user security.  ...  Moreover, 2-round non-linear SPNs can achieve "beyondbirthday" (up to 2 2n/3 adversarial queries) security, and, as the number of non-linear rounds increases, our bounds are meaningful for the number of  ...  Benoît Cogliati was partially supported by the European Union's H2020 Programme under grant agreement number ICT-644209.  ... 
doi:10.1007/978-3-319-96884-1_24 fatcat:u7z372fmpfd33k65wn3lvra5qy

Cryptanalysis of SP Networks with Partial Non-Linear Layers [chapter]

Achiya Bar-On, Itai Dinur, Orr Dunkelman, Virginie Lallemand, Nathan Keller, Boaz Tsaban
2015 Lecture Notes in Computer Science  
In this paper we present generic techniques for differential and linear cryptanalysis of SP networks with partial non-linear layers, including an automated characteristic search tool and dedicated key-recovery  ...  Design of SP networks in which the non-linear layer is applied to only a part of the state in each round was suggested by Gérard et al. at CHES 2013.  ...  Introduction Most block ciphers are either SP networks that apply linear and non-linear layers to the entire state in every encryption round, or (generalized) Feistel structures that apply partial linear  ... 
doi:10.1007/978-3-662-46800-5_13 fatcat:bkacq6zt2jckzfy5obgdc2iep4

Enig: Player Replaceable Finality Layers with Optimal Validity [article]

Simon Holmgaard Kamp, Jesper Buus Nielsen, Søren Eller Thomsen, Daniel Tschudi
2022 IACR Cryptology ePrint Archive  
We present two new provably secure finality layers for Nakamoto style blockchains. One is for partially synchronous networks and the other is for networks with periods of synchrony.  ...  Both finality layers improve on all existing provably secure finality layers in terms of communication complexity or security.  ...  Properties of Enig in Partial Synchrony with SPS The consistency of Enig SPS follows immediately from the consistency property of wBA. Proof.  ... 
dblp:journals/iacr/KampNTT22 fatcat:ogxsnd72gbaffiox7agdsoy6xy

Wide Tweakable Block Ciphers Based on Substitution-Permutation Networks: Security Beyond the Birthday Bound [article]

Benoît Cogliati, Jooyoung Lee
2018 IACR Cryptology ePrint Archive  
Second, we prove beyond-the-birthday-bound security for 2-round non-linear SPNs with independent S-boxes and independent round keys.  ...  As an application of our results, SPNs can be used to build provably secure wide tweakable block ciphers from several public permutations, or from a block cipher.  ...  Specifically, we focus on non-linear tweakable SPNs; the permutation layer accepts tweaks, while it is non-linear in the state, the key and the tweak.  ... 
dblp:journals/iacr/CogliatiL18 fatcat:orp536z2ivd5pn2keq4h4ii6te

Adversarial Examples - A Complete Characterisation of the Phenomenon [article]

Alexandru Constantin Serban, Erik Poll, Joost Visser
2019 arXiv   pre-print
We aim to cover all the important concerns in this field of study: (1) the conjectures on the existence of adversarial examples, (2) the security, safety and robustness implications, (3) the methods used  ...  We provide a complete characterisation of the phenomenon of adversarial examples - inputs intentionally crafted to fool machine learning models.  ...  In practice, each hidden layer applies a linear and a non-linear (activation) transformation to its input.  ... 
arXiv:1810.01185v2 fatcat:ybtxdm7refakxfyec2wjonzehu

Design Strategies for ARX with Provable Bounds: Sparx and LAX [chapter]

Daniel Dinu, Léo Perrin, Aleksei Udovenko, Vesselin Velichkov, Johann Großschädl, Alex Biryukov
2016 Lecture Notes in Computer Science  
together with sparse linear layers.  ...  In contrast to the WTS, that prescribes the use of small and efficient S-boxes at the expense of heavy linear layers with strong mixing properties, the LTS advocates the use of large (ARX-based) S-Boxes  ...  The provable security of LAX against linear cryptanalysis is left as an open problem.  ... 
doi:10.1007/978-3-662-53887-6_18 fatcat:6ubu2y7ding4bb5fhd6233mja4

Parallel Authenticated Encryption for Misuse Resistance using EME with Linear Mixing

Smriti Pathak
2017 International Journal of Advanced Research in Computer Science and Software Engineering  
the property of the binary field we are additionally show that the construction with linear mixing does not offer SPRP security though we have a tendency to perform all the operations during a prime field  ...  Wherever a masked plaintext is encrypted in ECB mode of, then a non-linear mixing is performed so once again associate encryption is performed in ECB mode that is covert to provide the cipher text. exploitation  ...  In the non-linear mixing, the block cipher is again used. EME is proved to provide SPRP security in the standard, provable security model assuming that the underlying block cipher is SPRP secure.  ... 
doi:10.23956/ijarcsse/v7i7/0212 fatcat:4wtum6ynpzapji3wzj4oi36r7a

An attack on the proactive RSA signature scheme in the URSA ad hoc network access control protocol

Stanislaw Jarecki, Nitesh Saxena, Jeong Hyun Yi
2004 Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks - SASN '04  
Recently, Luo, et al. in a series of papers [17, 14, 13, 18, 15] proposed a set of protocols for providing ubiquitous and robust access control [URSA] in mobile ad hoc networks without relying on a centralized  ...  The proposed proactive RSA signature scheme is assumed secure as long as no more than an allowed threshold of participating members is simultaneously corrupted at any point in the lifetime of the scheme  ...  It turns out that if polynomial secret-sharing in the URSA scheme is replaced with additive sharing in the first layer (with a second layer of polynomial sharing, as in the provably secure RSA schemes  ... 
doi:10.1145/1029102.1029105 dblp:conf/sasn/JareckiSY04 fatcat:sauilwslizgv7caiaf4praljsu

Table of contents

2020 IEEE Transactions on Information Forensics and Security  
He 2706 Enhancing Physical Layer Security of Random Caching in Large-Scale Multi-Antenna Heterogeneous Wireless Networks .................................................... W. W. C. Liu, Y. Fu, T.  ...  Shin 1959 On the Discreteness of the Worst Jamming Distribution for SP-OFDM ............................... Y. Liang and T.  ... 
doi:10.1109/tifs.2019.2940363 fatcat:hnt75fw6nbduzh2c4x4wxdsey4

Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis [chapter]

Bing Sun, Zhiqiang Liu, Vincent Rijmen, Ruilin Li, Lei Cheng, Qingju Wang, Hoda Alkhzaimi, Chao Li
2015 Lecture Notes in Computer Science  
is useful in provable security of block ciphers against impossible differential cryptanalysis.  ...  More specifically, constructing a zero correlation linear hull of a Feistel structure with SP -type round function where P is invertible, is equivalent to constructing an impossible differential of the  ...  differentials of both Feistel structures with SP -type round functions and SPN structures, which is useful in provable security of block ciphers against impossible differential cryptanalysis.  ... 
doi:10.1007/978-3-662-47989-6_5 fatcat:opgemjrhl5hhrp5hbtrdww56da

A Brief Review on Methodology of Cryptanalysis

K V Srinivasa Rao, M M Naidu, R. Satya Prasad
2019 International Journal of Scientific Research in Computer Science Engineering and Information Technology  
When it comes to the claimed security margins, the design approaches will follow certain security models as in provable security or practical security or a mixture of both.  ...  This Paper will explore the basic definitions of prominent cryptanalysis methods that targets the specific structure of a cipher namely differential and linear cryptanalysis and their different variants  ...  This is not the case for the non-linear layer. The differences will propagate through this layer with certain probability.  ... 
doi:10.32628/cseit195412 fatcat:ic27eb2sc5f7vici7x7vfkgvoq

Heuristic Tool for Linear Cryptanalysis with Applications to CAESAR Candidates [chapter]

Christoph Dobraunig, Maria Eichlseder, Florian Mendel
2015 Lecture Notes in Computer Science  
The majority of these only deal with differential characteristics.  ...  In this work, we present a heuristic search tool which is capable of finding linear characteristics even for primitives with a relatively large state, and without a strongly aligned structure.  ...  Propagation in SP networks. We want to find linear characteristics for SP networks.  ... 
doi:10.1007/978-3-662-48800-3_20 fatcat:4aw2s2bnq5fyxiinmxfim55aya

Understanding Rare Spurious Correlations in Neural Networks [article]

Yao-Yuan Yang and Chi-Ning Chou and Kamalika Chaudhuri
2022 arXiv   pre-print
We introduce spurious patterns correlated with a fixed class to a few training examples and find that it takes only a handful of such examples for the network to learn the correlation.  ...  Neural networks are known to use spurious correlations such as background information for classification.  ...  Acknowledgments and Disclosure of Funding We thank Angel Hsing-Chi Hwang for providing thoughtful comments on the paper. This work was supported by NSF under CNS 1804829 and ARO MURI W911NF2110317.  ... 
arXiv:2202.05189v2 fatcat:lltohdv2lbgjjnbya72varuaz4
« Previous Showing results 1 — 15 out of 368 results