Search

• This paper presents a clustered routing algorithm with authentication capability. • This routing method prioritizes data packets based on their type. • This paper suggests a suitable clustering algorithm. • This scheme reduces end to end delay and improves packet delivery rate. • The proposed method compare with three routing methods indicates its superiority. Routing is challenging in vehicular ad hoc networks due to their features, such as high mobility of nodes and unstable wireless communication links. Therefore, it is an interesting issue for researchers. In addition, it is very important to design an authentication mechanism between the source node and the destination node because these networks are exposed to many attacks due to their features mentioned above. In this paper, we present a fuzzy logic-based routing method with authentication capability in vehicular ad hoc networks. The proposed routing method has three phases: clustering phase, routing phase between cluster head nodes, and authentication phase. In the first phase, vehicles are clustered using an efficient scheme. In the proposed method, we define two types of data packets: immediate and ordinary. Various data packets have different route discovery processes that are described in Phase 2. Note that any data packet type is divided into two groups: simple and secure. Simple data packets have no authentication mechanism. On the other hand, secure data packets use an authentication mechanism based on message authentication code (MAC) and symmetric key cryptography. We simulate the proposed method using NS2. Simulation results are compared with three routing protocols including, AODV, R 2 SCDT , and 3VSR. Experiments show that the proposed method outperforms others in terms of end-to-end delay, packet collision, packet delivery rate (PDR), packet loss rate (PLR), and throughput. However, it increases the routing overhead slightly. [ABSTRACT FROM AUTHOR]

• An adaptive HEVC video steganography algorithm is designed, which can effectively resist the PU shift-based steganalysis. • The introduction of multivariate STC allows for smaller modifications with the same embedding capacity. • The superiority of this algorithm over the state-of-the-art video steganography algorithm is verified through extensive experiments. Calibration-based steganalysis methods are a fatal threat to current HEVC steganography algorithms. The current steganography algorithms based on prediction unit (PU) still lack resistance to this type of steganalysis. The reason is that the improvements in HEVC codec provide more potential steganographic space as well as introduce more detectable distortion. Therefore, a HEVC video steganography method that has resistance to PU shift-based steganalysis is proposed in this paper. First, the PU shift phenomenon that exists in PU-based steganography is introduced. Then the existing calibration-based steganalysis method is enhanced. According to the encoding rules of HEVC, the distortion cost function according to the difference of rate distortion cost (RD cost) during recompression is designed, which aims to obtain better resistance to calibration-based steganalysis. Experimental results demonstrate that the steganography algorithm designed in this paper provides excellent resistance ability for calibration-based steganalysis. [ABSTRACT FROM AUTHOR]

As a recent cryptography protocol, Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK) allows one party to prove that it possesses certain information without revealing information to these untrusted proof provers. This mechanism has the ability to provide the function for constructing and verifying information integrity without privacy leaking. However, the computation kernels of zk-SNARK consume too much computing power and produce a significant performance bottleneck with the growing data volume and security requirement. In this paper, we take advantage of Graphic Processing Unit (GPU) to enhance zk-SNARK efficiency by accelerating the most time-consuming computation kernels: modular multiplication and Number-Theoretic Transform (NTT)/Inverse Number-Theoretic Transform (INTT) in Elliptic Curve Cryptography (ECC) pairing with two major improvements: (1) Adopting interval limbs multiply-add quaternary operation to directly accelerate ECC pairing by making full advantage of information entropy within the limited hardware bit width; (2) Data layout and shuffle methods in GPU global memory and shared memory for data space consistency maintenance accelerating NTT/INTT which indirectly works on ECC pairing. To the best of our knowledge, our work would be the first exploration to accelerate these improvements on GPU. The measured results show that our methods are able to accelerate modular multiplication and NTT/INNT by 1.22× and 4.67× times respectively compared with the previous GPU implementation. With these accelerated kernels, we are able to achieve 3.14× speedup for Groth16, which is the most efficient zk-SNARK implementation working on BLS12-381 ECC field. With the bottleneck tackled, our work will expand the deployment scenarios of zk-SNARK in Zero Knowledge Proof (ZKP). • To accelerate zk-SNARK, we propose one mathematical scheme and its implementation. • We improve Montgomery algorithm for modular exponentiation & NTT/INTT as ECC kernels. • Our mathematical scheme well exploits the utilization of hardware bitwidth. • We propose a large data transposition method for NTT/INTT parallelism in GPU memory. • The improved zk-SNARK & multiplication reduction based kernels are tested effective. [ABSTRACT FROM AUTHOR]

Today, many users' extensive use of the Internet of Things (IoT) has made authentication an inevitable issue in the IoT. The currently existing authentication methods are subjected to many challenges by various factors such as the limited resources, the lack of authorization, and the need for a light-weighted authentication process. Therefore, it is essential to provide a security framework and protect the users' privacy at the lowest cost. This paper proposes a three-factor-based authentication scheme, called defense-in-depth, for the IoT environments on the blockchain platform. The proposed protocol applies mutual authentication with user authorization using smart card registration on a private blockchain without the need for a trustable server. The use of Elliptic-Curve Cryptography (ECC) and the analysis of the security of the proposed protocol using AVISPA tool, formal/informal security analysis altogether indicate that the proposed scheme is more secure and efficient in terms of computational and communications costs. • We have proposed a three-factor authentication protocol in IoT. • We have used a private blockchain to improve the security and transparency. • The proposed protocol is characterized by some security requirements. • The proposed protocol has been compared with other relevant protocols. [ABSTRACT FROM AUTHOR]

Abstract Although steganalysis has developed rapidly in recent years, it still faces many difficulties and challenges. Based on the theory of in-depth learning method and image-based general steganalysis, this paper makes a deep study of the hot and difficult problem of steganalysis feature expression, and tries to establish a new steganalysis paradigm from the idea of feature learning. The main contributions of this paper are as follows: 1. An innovative steganalysis paradigm based on in-depth learning is proposed. Based on the representative deep learning method CNN, the model is designed and adjusted according to the characteristics of steganalysis, which makes the proposed model more effective in capturing the statistical characteristics such as neighborhood correlation. 2. A steganalysis feature learning method based on global information constraints is proposed. Based on the previous research of steganalysis method based on CNN, this work focuses on the importance of global information in steganalysis feature expression. 3. A feature learning method for low embedding rate steganalysis is proposed. 4. A general steganalysis method for multi-class steganography is proposed. The ultimate goal of general steganalysis is to construct steganalysis detectors without distinguishing specific types of steganalysis algorithms. [ABSTRACT FROM AUTHOR]

Abstract As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that w min / w max > (q − 1) / q is a sufficient condition for a linear code over the finite field GF (q) to be minimal, where q is a prime power, w min and w max denote the minimum and maximum nonzero weights in the code, respectively. The first objective of this paper is to present a sufficient and necessary condition for linear codes over finite fields to be minimal. The second objective of this paper is to construct an infinite family of ternary minimal linear codes satisfying w min / w max ≤ 2 / 3. To the best of our knowledge, this is the first infinite family of nonbinary minimal linear codes violating Ashikhmin and Barg's condition. [ABSTRACT FROM AUTHOR]

The primary goal of image steganalysis is to detect subtle steganographic signals hidden within digital images. An essential aspect of digital image steganalysis involves the extraction of meaningful steganographic signal features. However, existing JPEG steganalysis networks have not delved deep enough into the research on extracting steganographic noise signals, especially in the preprocessing stage of the model. In this paper, we propose a novel approach called the D ilated B lind- S pot S teganalysis Network (DBS2Net), specifically designed for JPEG steganalysis. DBS2Net incorporates the dilated blind-spot convolutional network into the preprocessing stage to extract noise residuals, thereby enhancing detection accuracy. The blind-spot network estimates central outputs based on adjacent regions to effectively suppress semantic information and uses dilated convolutions to expand the receptive field. Additionally, we design the transition block to further enhance noise signals by mapping noise residuals extracted by the blind-spot network. In feature extraction, depth-wise separable convolutions are used to minimize the parameter count, while dual-view pooling layers compress features, resulting in improved detection performance. Experimental results validate the efficacy of this approach, and comprehensive analyses of JPEG steganographic noise support its success. In particular, DBS2Net outperforms state-of-the-art steganalysis methods, achieving superior detection accuracy with minimal model complexity. • Adapting denoising methods for steganalysis with enhancements. • Analyzing hidden information in images using blind-spot networks. • Utilizing transition blocks to map noise residuals and amplify subtle signals. • Employing depth-wise separable convolutions for noise reduction, maintaining lightweight models. • Enhancing detection accuracy with dual-view pooling layers, achieving state-of-the-art performance. [ABSTRACT FROM AUTHOR]

JPEG steganography hides secret messages by modifying DCT coefficients in cover images to ensure the undetectability. Currently, most JPEG steganography methods rely on the additive distortion model, assigning adaptive costs to individual coefficients. However, these costs are often designed within a single domain, either DCT or decompressed domain, thereby making the hiding behavior detectable by multi-domain steganalysis features. To improve the steganography security, this paper proposes an universal Dual-Domain JPEG Additive Distortion (DDJAD) framework, which minimize additive distortion in both JPEG and decompressed domain concurrently. A measure to reduce the perceptibility of coefficient modifications within pixel blocks is first formulated and then incorporated into the traditional JPEG steganography model. Finally, the new additive distortion model is solved by fine-tuning existing costs, illustrating the universality of the proposed method. Experimental results showcase the superiority of the proposed method over previous works across various quality factors and payloads, employing typical steganalysis features. • Paradigm Shift : Novel dual-domain model tackles JPEG steganography limits. • Innovative Framework : Enhanced security via new embedding framework. • Advanced Distortion Cost : Innovative cost addresses new paradigm challenges. • Steganalysis Resistance : Scheme superior in resisting steganalysis. [ABSTRACT FROM AUTHOR]

In this paper we present new constructions of multi-party homomorphic secret sharing (HSS) based on a new primitive that we call homomorphic encryption with decryption to shares (HEDS). Our first scheme, which we call Scooby , is based on many popular fully homomorphic encryption (FHE) schemes with a linear decryption property. Scooby achieves an n -party HSS for general circuits with complexity O (| F | + log ⁡ n) , as opposed to O (n 2 ⋅ | F |) for the prior best construction based on multi-key FHE. Scooby relies on a trusted setup procedure, and can be based on (ring)-LWE with a super-polynomial modulus-to-noise ratio. In our second construction, Scrappy , assuming any generic FHE plus HSS for NC1-circuits, we obtain a HEDS scheme which does not require a super-polynomial modulus. While these schemes all require FHE, in another instantiation, Shaggy , we show how it is also possible to obtain multi-party HSS without FHE, instead relying on the DCR assumption to obtain 4-party HSS for constant-degree polynomials. [ABSTRACT FROM AUTHOR]

The Hasse–Weil bound is a deep result in mathematics and has found wide applications in mathematics, theoretical computer science, information theory etc. In general, the bound is tight and cannot be improved. However, for some special families of curves the bound could be improved substantially. In this paper, we focus on the Hasse–Weil bound for the curve defined by y p − y = f ( x ) over the finite field F q , where p is the characteristic of F q . In 1993, Moreno–Moreno [7] gave an improvement to the Hasse–Weil bound for this family of curves. Recently, Kaufman and Lovett [4, FOCS2011] showed that the Hasse–Weil bound can be improved for this family of curves with f ( x ) = g ( x ) + h ( x ) , where g ( x ) is a polynomial of degree ≪ q and h ( x ) is a sparse polynomial of arbitrary degree but bounded weight degree. The other recent improvement by Rojas-Leon and Wan [9, Math. Ann. 2011] shows that an extra p can be removed for this family of curves if p is very large compared with polynomial degree of f ( x ) and log p ⁡ q . In this paper, we focus on the most interesting case for applications, namely p = 2 . We show that the Hasse–Weil bound for this special family of curves can be improved if q = 2 n with odd n ⩾ 3 which is the same case where Serre [10] improved the Hasse–Weil bound. However, our improvement is greater than Serre's and Moreno–Morenao's improvements for this special family of curves. Furthermore, our improvement works for p = 2 compared with the requirement of large p by Rojas-Leon and Wan. In addition, our improvement finds interesting applications to character sums, cryptography and coding theory. The key idea behind is that this curve has the Hasse–Witt invariant 0 and we show that the Hasse–Weil bound can be improved for any curves with the Hasse–Witt invariant 0. The main tool used in our proof involves Newton polygon and some results in algebraic geometry. [ABSTRACT FROM AUTHOR]

We identify a canonical parameter in the Chinese Remainder Theorem (CRT) and call it the “Reconstruction Coefficient”, (denoted by “ R C ”); and introduce the notions of “Partial” and “Full” Reconstruction. If the R C can be determined efficiently, then arithmetic operations that are (relatively) harder to realize in RNS; including Sign Detection, Base change/extension and Scaling or division by a constant can also be implemented efficiently. This paper therefore focuses on and presents two distinct methods to efficiently evaluate the R C at long wordlengths. A straightforward application of these methods leads to ultra-fast sign-detection. An independent contribution of this paper is to illustrate non-trivial trade-offs between run-time computation vs. pre-computation and look-up. We show a simple method to select the moduli which leads to both the (i) number of RNS channels n ; as well as (ii) the largest channel modulus m n satisfying { O ( n ) , O ( m n ) } ⪅ N ≡ the full-precision bit-length. The net result is that for many canonical operations; exhaustive look-up covering all possible input values is feasible even at long cryptographic bit-lengths N . Under fairly general and realistic assumptions about the capabilities of current hardware, the memory needed for exhaustive look-up tables is shown to be bounded by a low degree polynomial of n . Moreover, both methods to compute R C can achieve a delay of O ( lg n ) in a RN system with n channels. To the best of our knowledge, no other method published to date has shown a path to achieve that lower bound on the execution delay. Further, small values of channel moduli make it ideal to implement each individual RNS channel on a simple core in a many-core processor or as a distributed node, and our algorithms require a limited number of inter-channel communications, averaging O ( n ) . Results from a multi-core GPU implementation corroborate the theory. [ABSTRACT FROM AUTHOR]

Quantum computing utilizes properties of quantum physics to build a fast-computing machine that can perform quantum computations. This will eventually lead to faster and more efficient calculations especially when we deal with complex problems. However, there is a downside related to this hardware revolution since the security of widely used cryptographic schemes, e.g., RSA encryption scheme, relies on the hardness of certain mathematical problems that are known to be solved efficiently by quantum computers, i.e., making these protocols insecure. As such, while quantum computers most likely will not be available any time in the near future, it's necessary to create alternative solutions before quantum computers become a reality. This paper therefore provides a comprehensive review of attacks and countermeasures in Post-Quantum Cryptography (PQC) to portray a roadmap of PQC standardization, currently led by National Institute of Standards and Technology (NIST). More specifically, there has been a rise in the side-channel attacks against PQC schemes while the NIST standardization process is moving forward. We therefore focus on the side-channel attacks and countermeasures in major post-quantum cryptographic schemes, i.e., the final NIST candidates. [ABSTRACT FROM AUTHOR]

JPEG steganography is an important branch of information hiding. However, with the development of deep learning-based steganalysis models, steganography is facing great challenges. To better resist these steganalysis models, this paper proposes a deep JPEG steganography framework based on sparse adversarial attacks. According to the vulnerability of deep steganalysis models to adversarial attacks, sparse adversarial attacks are introduced into the deep JPEG steganographic structure to improve the security of stego images. In addition, to resist steganalysis from JPEG and spatial domains, both JPEG and spatial domain steganalysis models are involved in adversarial training. Finally, to further enhance the imperceptibility of adversarial stego images, the visual perception loss is designed from the perspective of human eyes. Experimental results indicate that compared with the existing methods, the proposed method has higher imperceptibility and security and can resist modern deep steganalysis models in both JPEG and spatial domains to a certain extent. The source code is available at https://github.com/imagecbj/SAE-JS. [ABSTRACT FROM AUTHOR]

• Adaptive coding is introduced to design mapping rules for PU partition modes. • The block with the lowest total cost is selected as the second-layer embedding cover. • An adaptive double-layer embedding strategy is designed to obtain better performance. High Efficiency Video Coding (HEVC) is well-known as an internationally popular video coding standard, and HEVC-based steganography has received increasing attention. In this paper, a new adaptive HEVC video information hiding method based on Prediction Unit (PU) partition mode and double-layer embedding strategy is proposed. Double-layer embedding is a method to complete the first-layer embedding using the mapping rules of PU partition mode, and to perform the second-layer embedding after the first-layer embedding. The cost assignment function designed in this paper can accurately evaluate the second-layer data embedding distortion. The frame position, motion properties and block size of PU are taken into consideration for the second-layer data embedding, and the syndrome-trellis codes (STCs) are used to minimize the embedding distortion. Experimental results show that the proposed adaptive double-layer embedding algorithm has better embedding efficiency and less embedding distortion in most cases. [ABSTRACT FROM AUTHOR]

Text In this paper, we have studied the third order variations on the Fibonacci universal code and we have displayed tables GH a ( 3 ) ( n ) we have defined for − 20 ≤ a ≤ − 2 and 1 ≤ n ≤ 100 . Also, we have compared with the third order variations on the Fibonacci universal code and the second order variations on the Fibonacci universal code [2] in terms of cryptography and we have found that the third order variations on the Fibonacci universal code are more advantageous than the second order variations on the Fibonacci universal code. Video For a video summary of this paper, please visit http://youtu.be/i2A4LZl9nNE . [ABSTRACT FROM AUTHOR]

We call an abelian variety over a finite field F q super-isolated if its (F q -rational) isogeny class contains a single isomorphism class. In this paper, we use the Honda-Tate theorem to characterize super-isolated ordinary simple abelian varieties by certain algebraic integers. Our main result is that for a fixed dimension g ≥ 3 , there are finitely many such varieties over all finite fields. [ABSTRACT FROM AUTHOR]

Visual cryptography scheme can divide the secret image into several shares. It can be used to enhance the secure transmission of the secret image on the Internet. Most schemes cannot fully restore the secret color image and generate meaningful shares. This paper proposes two new schemes by using color XOR to solve these problems. The first proposed scheme generates meaningless shares. The second proposed scheme can generate n − 1 meaningful shares and a meaningless share. Based on the first proposed scheme, n − 1 shares are modified to color QR codes in the second proposed scheme. These color QR codes can be decoded by the general decoder instead of the standard decoder. All shares are performed the color XOR to restore the secret color image completely. This paper uses some experiments to test two proposed schemes. Experimental results show that the two proposed schemes are feasible. • This paper proposes two schemes that can completely restore the secret image. • The QR code is used as the share in the proposed scheme. • This paper proposes two pixel-non-expansible schemes. [ABSTRACT FROM AUTHOR]

Abstract: Rotation symmetric Boolean functions have been extensively studied in the last dozen years or so because of their importance in cryptography and coding theory. Until recently, very little was known about the basic question of when two such functions are affine equivalent. The simplest case of quadratic rotation symmetric functions which are generated by cyclic permutations of the variables in a single monomial was only settled in a 2009 paper of Kim, Park and Hahn. The much more complicated analogous problem for cubic functions was solved for permutations using a new concept of patterns in a 2010 paper of Cusick, and it is conjectured that, as in the quadratic case, this solution actually applies for all affine transformations. The patterns method enables a detailed analysis of the affine equivalence classes for various special classes of cubic rotation symmetric functions in n variables. Here the case of functions generated by a single monomial and having variables, where is prime, is examined in detail, and in particular, a formula for the number of classes is proved. [Copyright &y& Elsevier]

Abstract: Two-party authenticated key agreement protocols using pairings have gained much attention in the cryptographic community. Several protocols of this type where proposed in the past of which many were found to be flawed. This resulted in attacks or the inability to conform to security attributes. In this paper, we propose an efficient identity-based authenticated key agreement protocol employing pairings which employs a variant of a signature scheme and conforms to security attributes. Additionally, existing competitive and the proposed protocol are compared regarding efficiency and security. The criteria for efficiency are defined in this paper, whereas the criteria for security are defined by the fulfilment of security attributes from literature. [Copyright &y& Elsevier]

• A carrier-less text steganography based on CNN-LSTM network is proposed. • SSH scheme based on beam search can be applied in model sharing situation. • HH scheme for model-free extraction with hash function is proposed. • The tradeoff between text quality and embedded capacity can be balanced. • The proposed schemes achieve high text quality, invisibility, and security. It is a challenge to conduct natural language steganography on Online interactive platforms such as photo-sharing websites since the stego texts should be consistent with the content of the images. In this paper, a novel natural language steganographic framework based on an end-to-end generative network is proposed. A Convolution Neural Network (CNN) combined with Long Short-Term Memory (LSTM) is trained to generate stego descriptions. Word by Word Hiding (WWH) and Sentence by Sentence Hiding (SSH) schemes are proposed to achieve various embedding capacity under the premise of sharing model between the sender and the receiver. Furthermore, a blind extraction scheme called Hash Hiding (HH) is proposed in case that the model is unavailable for data extraction. Comparative experiments show the superiority of the proposed framework. It is verified that the proposed framework is an effective carrier-less steganographic framework with competitive embedding capacity, considerable text quality, and good reversibility. [ABSTRACT FROM AUTHOR]

A new (k , n) threshold secret image sharing scheme with two decoding options is introduced in this paper. The proposed scheme combines color-black-and-white visual cryptography scheme (CBW-VCS) and polynomial based secret image sharing (PSIS) together, to offer stacking-to-see decryption and lossless image reconstruction. To construct the color shares, a general (k , n) threshold CBW-VCS is firstly given. A grayscale secret image is converted to a p -radix image and a binary image. The p -radix image is encrypted by the (k , n) PSIS under mod p operation, and n p -radix shadows are obtained. Then, a color share generation algorithm with data embedding is proposed to construct n color shares. Theoretical analysis and sufficient experiments are provided to show the effectiveness and advantages of the proposed scheme. [ABSTRACT FROM AUTHOR]

Abstract In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with a view towards applications to cryptography. [ABSTRACT FROM AUTHOR]

Highlights • A binary image steganography with higher security and image quality is proposed. • A new distortion measurement for both security and image quality is proposed. • The whole image is used to construct a more flexible message-carrier. • The proposed method outperforms the previous state-of-the-art methods. Abstract Most state-of-the-art binary image steganography methods depend on the content of the image to determine where to embed secret messages, which is capacity-limited and indicates that their distortion measurement may be not precise enough. In this paper, we propose a kind of distortion measurement that is not only based on the discrimination effects after flipping the pixels but also depends on the visual effects of flipping corresponding pixels, which is called joint distortion measurement. Instead of selecting suitable position to embed secret messages, we then employ the syndrome-trellis code to minimize the embedding distortion and get messages embedded. And experimental results have demonstrated that the proposed distortion measurement has higher performance and the steganography scheme can achieve stronger statistical security with high capacity and image quality. [ABSTRACT FROM AUTHOR]

In this paper, two classes of permutation trinomials with Niho-type exponents are proposed. The coefficients in the first class are completely determined, and a sufficient condition is established to characterize the coefficients in the second class. [ABSTRACT FROM AUTHOR]

In this paper, we present some sufficient and necessary conditions for a 1-Lipschitz function over F q [ [ T ] ] to be ergodic, and constructions of ergodic functions over F q [ [ T ] ] , thus generalize the existing results of the case q = 2 , which are parallel to the pioneering work of Anashin and others, in the case of Z 2 . We describe the ergodic functions only in terms of Van der Put basis, which might be good enough for application considerations. [ABSTRACT FROM AUTHOR]

Abstract: We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that preserves security in a general cryptographic sense. Reactive means that the system can interact with its users multiple times, e.g., in many concurrent protocol runs or a multi-round game. In terms of distributed systems, reactive simulatability is a type of refinement that preserves particularly strong properties, in particular confidentiality. A core feature of reactive simulatability is composability, i.e., the real system can be plugged in instead of the ideal system within arbitrary larger systems; this is shown in follow-up papers, and so is the preservation of many classes of individual security properties from the ideal to the real systems. A large part of this paper defines a suitable system model. It is based on probabilistic IO automata (PIOA) with two main new features: One is generic distributed scheduling. Important special cases are realistic adversarial scheduling, procedure-call-type scheduling among colocated system parts, and special schedulers such as for fairness, also in combinations. The other is the definition of the reactive runtime via a realization by Turing machines such that notions like polynomial-time are composable. The simple complexity of the transition functions of the automata is not composable. As specializations of this model we define security-specific concepts, in particular a separation between honest users and adversaries and several trust models. The benefit of IO automata as the main model, instead of only interactive Turing machines as usual in cryptographic multi-party computation, is that many cryptographic systems can be specified with an ideal system consisting of only one simple, deterministic IO automaton without any cryptographic objects, as many follow-up papers show. This enables the use of classic formal methods and automatic proof tools for proving larger distributed protocols and systems that use these cryptographic systems. [Copyright &y& Elsevier]

Permutation polynomials with low c -differential uniformity and boomerang uniformity have wide applications in cryptography. In this paper, by utilizing the Weil sums technique and solving some certain equations over F 2 n , we determine the c -differential uniformity and boomerang uniformity of these permutation polynomials: (1) f 1 (x) = x + Tr 1 n (x 2 k + 1 + 1 + x 3 + x + u x) , where n = 2 k + 1 , u ∈ F 2 n with Tr 1 n (u) = 1 ; (2) f 2 (x) = x + Tr 1 n (x 2 k + 3 + (x + 1) 2 k + 3) , where n = 2 k + 1 ; (3) f 3 (x) = x − 1 + Tr 1 n ((x − 1 + 1) d + x − d) , where n is even and d is a positive integer. The results show that the involutions f 1 (x) and f 2 (x) are APcN functions for c ∈ F 2 n ﹨ { 0 , 1 }. Moreover, the boomerang uniformity of f 1 (x) and f 2 (x) can attain 2 n. Furthermore, we generalize some previous works and derive the upper bounds on the c -differential uniformity and boomerang uniformity of f 3 (x). [ABSTRACT FROM AUTHOR]

Recently, a new concept called the c -differential uniformity was proposed by Ellingsen et al. (2020), which generalizes the notion of differential uniformity measuring the resistance against differential cryptanalysis. Since then, finding functions having low c -differential uniformity has attracted the attention of many researchers. However it seems that, at this moment, there are not many non-monomial permutations having low c -differential uniformity. In this paper, we present new classes of (almost) perfect c -nonlinear non-monomial permutations over a binary field. [ABSTRACT FROM AUTHOR]

In (k , n) progressive secret image sharing (PSIS) schemes, a secret image is shared into n shadows in such way that: (1) fewer than k - 1 shadows get no information on the secret image; (2) k to n shadows can progressively recover the secret image. In most PSIS schemes, the shadows are noise-like images which would cause suspicious of attackers. The combination of secret image sharing and steganography can share a secret image into meaningful shadow images that can reduce attention of attackers. However most existing secret image sharing schemes with meaningful shadow images do not possess progressive property, a group of shadow images can either reconstruct entire secret image or get nothing on it. In this paper, we construct a new (k , n) PSIS with meaningful shadow images using GEMD and RGEMD. The property of progressive reconstruction is proved both in theoretical analysis and experimental results. The approaches of GEMD and RGEMD enable our Scheme high embedding capacity and resistance of RS detection. Comparing with other PSISs with meaningful shadow images, our Scheme has advantages in shadow size and shadow visual quality. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel steganalytic scheme based on local texture pattern (LTP) to detect binary image steganography. We first assess how the expanded LTPs capture embedding distortions exactly. Considering curse of dimensionality when expanding LTPs, we employ Manhattan distance to measure the pixels correlation in a 5 × 5 sized block and select the pixels with closely correlation to remove some LTPs that are not interested. Although the stego image can maintain good visual quality, steganography scheme changes the inter-pixels correlation of binary image. Therefore we utilize totally 8192 LTPs histogram to define a 8192-dimensional steganalytic feature set. Original images and stego images are classified by ensemble classifier. Experimental results show that the proposed steganalytic method can more effectively detect state-of-the-art binary image steganography schemes compared with other steganalytic schemes. [ABSTRACT FROM AUTHOR]

The subset sum problem is an important theoretical problem with many applications, such as in coding theory, cryptography, graph theory and other fields. One of the many aspects of this problem is to answer the solvability of the k -subset sum problem. It has been proven to be NP-hard in general. However, if the evaluation set has some special algebraic structure, it is possible to obtain some good conclusions. Zhu, Wan and Keti proposed partial results of this problem over two special kinds of evaluation sets. We generalize their conclusions in this paper, and propose asymptotical results of the solvability of the k -subset sum problem by using estimates of additive character sums over the evaluation set, together with the Brun sieve and the new sieve proposed by Li and Wan. We also apply the former two examples as application of our results. [ABSTRACT FROM AUTHOR]

In this paper a steganographic method is proposed to improve the capacity of the hidden secret data and to provide an imperceptible stego-image quality. The proposed steganography algorithm is based on the wavelet packet decomposition (WPD) and neutrosophic set. First, an original image is decomposed into wavelet packet coefficients. Second, the generalized parent–child relationships of spatial orientation trees for wavelet packet decomposition are established among the wavelet packet subbands. An edge detector based on the neutrosophic set named (NSED) is then introduced and applied on a number of subbands. This leads to classify each wavelet packet tree into edge/non-edge tree to embed more secret bits into the coefficients in the edge tree than those in the non-edge tree. The embedding is done based on the least significant bit substitution scheme. Experimental results demonstrate that the proposed method achieves higher embedding capacity with better imperceptibility compared to the published steganographic methods. [ABSTRACT FROM AUTHOR]

Pseudo-random number generators (PRNGs) are important to applications ranging from cryptography to Monte-Carlo methods. Consequently, many PRNG architectures have been proposed, including some optimized for FPGA, e.g the LUT-SR family of PRNGs which utilize embedded FPGA shift registers, and self-programmable cellular automaton (SPCA) PRNGs. However, LUT-SR and other PRNGs do not utilize key features of modern Xilinx FPGAs: embedded carry chains and splittable Look-Up Tables (LUTs), i.e., 6-input LUTs which can operate as two 5-input LUTs which share inputs. In this paper we explore the SPCA structure and derive a set of parameter constraints which allow a SPCA PRNG to produce 2 random bits per LUT in every clock cycle on modern Xilinx FPGAs. We determine this to be the maximum logic density achievable for SPCA, and propose an architectural improvement of SPCA to enable further density increase by making use of FPGA embedded carry chains as a method to compute an additional random bit per LUT in each clock cycle. The resulting Split-LUT-Carry SPCA (SLC-SPCA) PRNG achieves 6x improvement in logic density compared to LUT-SR, and a 1.5x density increase compared to SPCA. We evaluate the randomness of SLC-SPCA utilizing the NIST Statistical Test Suite, and we provide a power and energy comparison of LUT-SR and SLC-SPCA on a Xilinx Zynq 7020 FPGA device. Our results indicate that SLC-SPCA generates 3x more bits per clock at approximately the same power dissipation as LUT-SR, and consequently 3x less energy to generate 1 gigabit of random data. SLC-SPCA is also 1.5x more energy-efficient than a SPCA PRNG. [ABSTRACT FROM AUTHOR]

Conventional approaches for encryption are unsuitable for simultaneously achieving reliability and confidentiality. Threshold-based secret sharing scheme deals with the problem of sharing a secret information into a group of n users and secret can be recovered only when a sufficient users come together, we can reconstruct a secret information from t , where t < n . There is a requirement to evolve a secure secret sharing scheme so that the reconstruction is possible only when all shares are available. In this paper, we propose a secure ( n , n ) -Multi Secret Sharing (MSS) scheme using Chinese Remainder Theorem (CRT). The proposed scheme shares secret information among n users and for recovery all n users are needed, if one of the user is absent then we could not reconstruct the secret information. The proposed scheme does not reveals the partial secret information, as the randomness in shares is more. The proposed scheme outperforms the existing techniques in terms of randomness and security. [ABSTRACT FROM AUTHOR]

The traditional data publishing methods will remove the sensitive attributes and generate the abundant records to achieve the goal of privacy protection. In the big data environment, the requirement of utilizing data (e.g., data mining) become more and more various, which is beyond the scope of the traditional method. This paper provides a cryptographic data publishing system that preserves the data integrity (i.e., the original data structure is preserved) and achieves anonymity without deletion of any attribute or utilization of redundancy. The security analysis shows that our system is secure under our proposed security model. [ABSTRACT FROM AUTHOR]

Almost perfect nonlinear (APN) functions on finite fields of characteristic two have been studied by many researchers. Such functions have useful properties and applications in cryptography, finite geometries and so on. However, APN functions on finite fields of odd characteristic do not satisfy desired properties. In this paper, we modify the definition of APN function in the case of odd characteristic, and study its properties. [ABSTRACT FROM AUTHOR]

This article describes the design of a compact 8-bit coprocessor for the Advanced Encryption standard (AES) (encryption, decryption, and key expansion) and the cryptographic hash function Grøstl. Our Arithmetic and Logic Unit has only one instruction that allows for implementing AES encryption, AES decryption, AES key expansion, and Grøstl at all levels of security (i.e. 128-, 192-, and 256-bit encryption keys; 256- and 512-bit message digests). A fully autonomous implementation of Grøstl and AES on a Virtex-6 FPGA requires 169 slices and a single 36k memory block, and achieves a competitive throughput (up to 217 Mbits/s and 92 Mbits/s for encryption and hashing, respectively). The proposed coprocessor is well-suited for resource-constrained embedded systems, where several security protocols rely only on block ciphers and hash functions. One can exploit the design philosophy presented in this paper in order to design a unified architecture for other algorithms. [ABSTRACT FROM AUTHOR]

The Strassen algorithm for multiplying 2 × 2 matrices requires seven multiplications and 18 additions. The recursive use of this algorithm for matrices of dimension n yields a total arithmetic complexity of ( 7 n 2.81 − 6 n 2 ) for n = 2 k . Winograd showed that using seven multiplications for this kind of matrix multiplication is optimal. Therefore, any algorithm for multiplying 2 × 2 matrices with seven multiplications is called a Strassen-like algorithm. Winograd also discovered an additively optimal Strassen-like algorithm with 15 additions. This algorithm is called the Winograd's variant, whose arithmetic complexity is ( 6 n 2.81 − 5 n 2 ) for n = 2 k and ( 3.73 n 2.81 − 5 n 2 ) for n = 8 ⋅ 2 k , which is the best-known bound for Strassen-like multiplications. This paper proposes a method that reduces the complexity of Winograd's variant to ( 5 n 2.81 + 0.5 n 2.59 + 2 n 2.32 − 6.5 n 2 ) for n = 2 k . It is also shown that the total arithmetic complexity can be improved to ( 3.55 n 2.81 + 0.148 n 2.59 + 1.02 n 2.32 − 6.5 n 2 ) for n = 8 ⋅ 2 k , which, to the best of our knowledge, improves the best-known bound for a Strassen-like matrix multiplication algorithm. [ABSTRACT FROM AUTHOR]

We consider a problem of automated orchestration of security-aware services under additional constraints. The problem of finding a mediator to compose secured services has been reduced in previous works to the problem of solving deducibility constraints similar to those employed for cryptographic protocol analysis. We extend in this paper the mediator synthesis procedure (i.e. a solution for the orchestration problem) by allowing additional non-disclosure policies that express the fact that some data is not accessible to the mediator at a given point of its execution. We present a decision procedure that answers the question whether a mediator satisfying these policies can be effectively synthesized. The approach presented in this work extends the constraint solving procedure for cryptographic protocol analysis in a significant way as to be able to handle negation of deducibility constraints. It applies to all subterm convergent theories and therefore covers several interesting theories in formal security analysis including encryption, hashing, signature and pairing; it is also expressive enough for some RBAC policies. A variant of this procedure for Dolev Yao theory has been implemented in Cl-Atse, a protocol analysis tool based on constraint solving. [ABSTRACT FROM AUTHOR]

The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the generalized Hamming weights of three classes of linear codes constructed through defining sets and determine them partly for some cases. Particularly, in the semiprimitive case we solve a problem left in Yang et al. (2015) [30] . [ABSTRACT FROM AUTHOR]

Regular tree languages are a popular device for reachability analysis over term rewrite systems, with many applications like analysis of cryptographic protocols, or confluence and termination analysis. At the heart of this approach lies tree automata completion, first introduced by Genet for left-linear rewrite systems. Korp and Middeldorp introduced so-called quasi-deterministic automata to extend the technique to non-left-linear systems. In this paper, we introduce the simpler notion of state-compatible automata, which are slightly more general than quasi-deterministic, compatible automata. This notion also allows us to decide whether a regular tree language is closed under rewriting, a problem which was not known to be decidable before. The improved precision has a positive impact in applications which are based on reachability analysis, namely termination and confluence analysis. Our results have been formalized in the theorem prover Isabelle/HOL. This allows to certify automatically generated proofs that are using tree automata techniques. [ABSTRACT FROM AUTHOR]

Recently, using compressive sensing (CS) as a cryptosystem has drawn attention due to its compressibility and low-complexity during the sampling process. However, when applying such cryptosystem to images, how to protect the privacy of the image while keeping efficiency becomes a challenge. In this paper, we propose a novel image coding scheme that achieves combined compression and encryption under a parallel compressive sensing framework, where both the CS sampling and the CS reconstruction are performed in parallel. In this way, the efficiency can be guaranteed. On the other hand, for security, the resistance to chosen plaintext attack (CPA) is realized with the help of the cooperation between a nonlinear chaotic sensing matrix construction process and a counter mode operation. Furthermore, the defect of energy information leakage in CS-based cryptosystem is also overcome by a diffusion procedure. Experimental and analysis results show the scheme achieves effectiveness, efficiency and high security simultaneously. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel joint image compression and encryption scheme based on JPEG standard. We realize image encryption at JPEG’s transformation stage. Instead of only using 8 × 8 discrete cosine transform (DCT) for transformation, we generate new orthogonal transforms by embedding an extra rotation angle of π to different stages’ butterflies in 8 × 8 DCT’s flow-graph, and then apply them alternatively for transformation according to a predefined secret key. By carefully controlling the number of rotation angles embedded, the quality control of encrypted images can also be achieved. The encryption algorithm is further enhanced by performing block permutation before the entropy encoding stage. Extensive experiments have been conducted to show the good protection and compression performance of our encryption schemes. Finally, a detailed security analysis is provided to show the encryption schemes’ resistance to various cryptanalysis methods, such as brute-force attack, key sensitivity analysis, replacement attack and statistical attack. [ABSTRACT FROM AUTHOR]