To see the other types of publications on this topic, follow the link: Symmetric-key primitive.
Journal articles on the topic 'Symmetric-key primitive'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Symmetric-key primitive.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Jang, Kyungbae, Yujin Oh, Hyunji Kim, and Hwajeong Seo. "Quantum Implementation of AIM: Aiming for Low-Depth." Applied Sciences 14, no. 7 (March 27, 2024): 2824. http://dx.doi.org/10.3390/app14072824.
Full textAbstract:
Security vulnerabilities in the symmetric-key primitives of a cipher can undermine the overall security claims of the cipher. With the rapid advancement of quantum computing in recent years, there is an increasing effort to evaluate the security of symmetric-key cryptography against potential quantum attacks. This paper focuses on analyzing the quantum attack resistance of AIM, a symmetric-key primitive used in the AIMer digital signature scheme. We present the first quantum circuit implementation of AIM and estimate its complexity (such as qubit count, gate count, and circuit depth) with respect to Grover’s search algorithm. For Grover’s key search, the most important optimization metric is depth, especially when considering parallel search. Our implementation gathers multiple methods for a low-depth quantum circuit of AIM in order to reduce the Toffoli depth and full depth (such as the Karatsuba multiplication and optimization of inner modules; Mer, LinearLayer).
2
Shaukat Jamal, Sajjad, Dawood Shah, Abdulaziz Deajim, and Tariq Shah. "The Effect of the Primitive Irreducible Polynomial on the Quality of Cryptographic Properties of Block Ciphers." Security and Communication Networks 2020 (September 24, 2020): 1–14. http://dx.doi.org/10.1155/2020/8883884.
Full textAbstract:
Substitution boxes are the only nonlinear component of the symmetric key cryptography and play a key role in the cryptosystem. In block ciphers, the S-boxes create confusion and add valuable strength. The majority of the substitution boxes algorithms focus on bijective Boolean functions and primitive irreducible polynomial that generates the Galois field. For binary field F2, there are exactly 16 primitive irreducible polynomials of degree 8 and it prompts us to construct 16 Galois field extensions of order 256. Conventionally, construction of affine power affine S-box is based on Galois field of order 256, depending on a single degree 8 primitive irreducible polynomial over ℤ2. In this manuscript, we study affine power affine S-boxes for all the 16 distinct degree 8 primitive irreducible polynomials over ℤ2 to propose 16 different 8×8 substitution boxes. To perform this idea, we introduce 16 affine power affine transformations and, for fixed parameters, we obtained 16 distinct S-boxes. Here, we thoroughly study S-boxes with all possible primitive irreducible polynomials and their algebraic properties. All of these boxes are evaluated with the help of nonlinearity test, strict avalanche criterion, bit independent criterion, and linear and differential approximation probability analyses to measure the algebraic and statistical strength of the proposed substitution boxes. Majority logic criterion results indicate that the proposed substitution boxes are well suited for the techniques of secure communication.
3
Challa, RatnaKumari, and VijayaKumari Gunta. "A Modified Symmetric Key Fully Homomorphic Encryption Scheme Based on Read-Muller Code." Baghdad Science Journal 18, no. 2(Suppl.) (June 20, 2021): 0899. http://dx.doi.org/10.21123/bsj.2021.18.2(suppl.).0899.
Full textAbstract:
Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security. We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly. We make an effort to prove the security of the scheme under indistinguishability under chosen-plaintext attack (IND-CPA) through a game-based security proof. The security proof gives a mathematical analysis and its complexity of hardness. Also, it presents security analysis against all the known attacks with respect to the message expansion and homomorphic operations.
4
Partala, Juha. "Algebraic generalization of Diffie–Hellman key exchange." Journal of Mathematical Cryptology 12, no. 1 (March 1, 2018): 1–21. http://dx.doi.org/10.1515/jmc-2017-0015.
Full textAbstract:
AbstractThe Diffie–Hellman key exchange scheme is one of the earliest and most widely used public-key primitives. Its underlying algebraic structure is a cyclic group and its security is based on the discrete logarithm problem (DLP). The DLP can be solved in polynomial time for any cyclic group in the quantum computation model. Therefore, new key exchange schemes have been sought to prepare for the time when quantum computing becomes a reality. Algebraically, these schemes need to provide some sort of commutativity to enable Alice and Bob to derive a common key on a public channel while keeping it computationally difficult for the adversary to deduce the derived key. We suggest an algebraically generalized Diffie–Hellman scheme (AGDH) that, in general, enables the application of any algebra as the platform for key exchange. We formulate the underlying computational problems in the framework of average-case complexity and show that the scheme is secure if the problem of computing images under an unknown homomorphism is infeasible. We also show that a symmetric encryption scheme possessing homomorphic properties over some algebraic operation can be turned into a public-key primitive with the AGDH, provided that the operation is complex enough. In addition, we present a brief survey on the algebraic properties of existing key exchange schemes and identify the source of commutativity and the family of underlying algebraic structures for each scheme.
5
Álvarez, Rafael, Alicia Andrade, and Antonio Zamora. "Optimizing a Password Hashing Function with Hardware-Accelerated Symmetric Encryption." Symmetry 10, no. 12 (December 3, 2018): 705. http://dx.doi.org/10.3390/sym10120705.
Full textAbstract:
Password-based key derivation functions (PBKDFs) are commonly used to transform user passwords into keys for symmetric encryption, as well as for user authentication, password hashing, and preventing attacks based on custom hardware. We propose two optimized alternatives that enhance the performance of a previously published PBKDF. This design is based on (1) employing a symmetric cipher, the Advanced Encryption Standard (AES), as a pseudo-random generator and (2) taking advantage of the support for the hardware acceleration for AES that is available on many common platforms in order to mitigate common attacks to password-based user authentication systems. We also analyze their security characteristics, establishing that they are equivalent to the security of the core primitive (AES), and we compare their performance with well-known PBKDF algorithms, such as Scrypt and Argon2, with favorable results.
6
Alzahrani, Bander A., Ahmed Barnawi, and Shehzad Ashraf Chaudhry. "A Resource-Friendly Authentication Protocol for UAV-Based Massive Crowd Management Systems." Security and Communication Networks 2021 (November 5, 2021): 1–12. http://dx.doi.org/10.1155/2021/3437373.
Full textAbstract:
As a part of the smart city revolution, crowd management is an emerging trend and it can enhance the quality of life. Unmanned ariel vehicles (UAVs) can help in making the crowd management process more efficient and more accurate. UAVs can monitor and collect environmental-related surveillance data and share real-time information with each other and with the decision makers. However, the battery-operated UAVs communicate over the open public channel making the privacy and security of the UAVs a crucial element in mission-critical applications. The weaknesses of the existing scheme pave the way to design a new lightweight authentication scheme for UAV environments. In this article, we present a symmetric key primitive-based scheme and provide authentication among a user and a UAV through an intermediate control center. Due to usage of symmetric key and elliptic curve cryptography, the proposed scheme fulfils the performance requirements of the UAVs. The security of the proposed scheme is substantiated through BAN logic, along with a discussion on security features extended by the proposed scheme. The performance and security comparisons show that the proposed scheme provides adequate security and efficiency and can be practically deployed in real UAV environments.
7
Bulbul, Salim Sabah, Zaid Ameen Abduljabbar, Duaa Fadhel Najem, Vincent Omollo Nyangaresi, Junchao Ma, and Abdulla J. Y. Aldarwish. "Fast Multi-User Searchable Encryption with Forward and Backward Private Access Control." Journal of Sensor and Actuator Networks 13, no. 1 (February 2, 2024): 12. http://dx.doi.org/10.3390/jsan13010012.
Full textAbstract:
Untrusted servers are servers or storage entities lacking complete trust from the data owner or users. This characterization implies that the server hosting encrypted data may not enjoy full trust from data owners or users, stemming from apprehensions related to potential security breaches, unauthorized access, or other security risks. The security of searchable encryption has been put into question by several recent attacks. Currently, users can search for encrypted documents on untrusted cloud servers using searchable symmetric encryption (SSE). This study delves deeply into two pivotal concepts of privacy within dynamic searchable symmetric encryption (DSSE) schemes: forward privacy and backward privacy. The former serves as a safeguard against the linkage of recently added documents to previously conducted search queries, whereas the latter guarantees the irretrievability of deleted documents in subsequent search inquiries. However, the provision of fine-grained access control is complex in existing multi-user SSE schemes. SSE schemes may also incur high computation costs due to the need for fine-grained access control, and it is essential to support document updates and forward privacy. In response to these issues, this paper suggests a searchable encryption scheme that uses simple primitive tools. We present a multi-user SSE scheme that efficiently controls access to dynamically encrypted documents to resolve these issues, using an innovative approach that readily enhances previous findings. Rather than employing asymmetric encryption as in comparable systems, we harness low-complexity primitive encryption tools and inverted index-based DSSE to handle retrieving encrypted files, resulting in a notably faster system. Furthermore, we ensure heightened security by refreshing the encryption key after each search, meaning that users are unable to conduct subsequent searches with the same key and must obtain a fresh key from the data owner. An experimental evaluation shows that our scheme achieves forward and Type II backward privacy and has much faster search performance than other schemes. Our scheme can be considered secure, as proven in a random oracle model.
8
kumar, N. Shantha, and Dr Hareesh K. "A Primitive Proposal of an Algorithm for IP and Mac Based Data Aggregation and message authentication in Wireless Sensor Networks." International Journal of Soft Computing and Engineering 9, no. 4 (November 5, 2019): 14–17. http://dx.doi.org/10.35940/ijsce.c3322.109119.
Full textAbstract:
In wireless sensor networks(WSN) ,authentication of messages is the highly important function in preventing threats from un wanted , un authorized and corrupt messages from being sent. There are various message verification and authentication methods have been proposed as well as developed based on cryptography technology such as symmetric key cryptographic systems or public-key cryptographic systems. Also there are many different techniques available based on polynomial-based schemes, elliptic curve cryptography (ECC) and so on. All the above said methods have its own merits and demerits. In this research work a new method of authenticating the message by its IP and MAC address (together encrypting) and analysing the encrypted message to find the authenticity of the message and the node which has sent the message at collecting node will be carried out.
9
Ludyawati, Ludyawati, Muhammad Khudzaifah, and Erna Herawati. "Penggabungan Metode Vigènere Cipher dan ElGamal Pada Pengamanan Pesan Rahasia." Jurnal Riset Mahasiswa Matematika 2, no. 6 (September 1, 2023): 247–56. http://dx.doi.org/10.18860/jrmm.v2i6.22041.
Full textAbstract:
Vigènere Cipher is a symmetric cryptographic algorithm that uses the same type of key in the encryption and decryption process. The security of the Vigènere Cipher method lies in the modulo calculation used. ElGamal is an asymmetric cryptographic algorithm that uses two different types of keys in the encryption and decryption process. The security of the ElGamal algorithm lies in the complexity of calculating large prime numbers. The Vigènere Cipher and ElGamal have their advantages and disadvantages. The researchers are interested in combining the advantages of the two methods. In this study, two locks were carried out in the encryption and decryption process. The encryption process uses a public key and the decryption process uses a public key and a secret key . The key used comes from key formation using the ElGamal algorithm. The key security formed from the ElGamal algorithm lies in the large prime , the primitive root of the prime number , and the random integer which comes from the last three digits of Student Number. The conclusion of this study is that the combination of the Vigènere Cipher and ElGamal methods can increase the security of secret messages because it produces a ciphertext with twice the size ) of the original message.
10
Huang, Jing Lian, Zhuo Wang, and Mei Rong He. "Algebraic Immunity, Correlation Immunity and other Cryptographic Properties of Quadratic Rotation Symmetric Boolean Functions." Advanced Materials Research 989-994 (July 2014): 2593–98. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.2593.
Full textAbstract:
Boolean functions with a variety of secure cipher properties are the key factors to design cryptosystem with the ability to resist multiple cipher attacks and good safety performance. In this paper, using the derivative of the Boolean functions and the e-derivative defined by ourselves as the main research tools, we study algebraic immunity, correlation immunity and other cryptographic properties of the quadratic rotation symmetric Boolean functions. We determine the quadratic rotation symmetric Boolean functions which are H Boolean functions, and the range of weight distribution of the quadratic rotation symmetry H Boolean functions. Besides, we get the compatibility among propagation, balance, correlation immunity and algebraic immunity of the quadratic rotation symmetry H Boolean functions, and also focus on the relationship of balance, correlation immunity and dimension. Furthermore, we check the existence of the cubic rotation symmetry H Boolean functions, and obtain the relationship between existence and dimension of the cubic rotation symmetry H Boolean functions. Moreover, we obtain a more convenient method for solving annihilator. Such researches are important in cryptographic primitive designs, and have significance and role in the theory and application range of cryptosystems.
11
Ueno, Rei, Naofumi Homma, Akiko Inoue, and Kazuhiko Minematsu. "Fallen Sanctuary: A Higher-Order and Leakage-Resilient Rekeying Scheme." IACR Transactions on Cryptographic Hardware and Embedded Systems 2024, no. 1 (December 4, 2023): 264–308. http://dx.doi.org/10.46586/tches.v2024.i1.264-308.
Full textAbstract:
This paper presents a provably secure, higher-order, and leakage-resilient (LR) rekeying scheme named LR Rekeying with Random oracle Repetition (LR4), along with a quantitative security evaluation methodology. Many existing LR primitives are based on a concept of leveled implementation, which still essentially require a leak-free sanctuary (i.e., differential power analysis (DPA)-resistant component(s)) for some parts. In addition, although several LR pseudorandom functions (PRFs) based on only bounded DPA-resistant components have been developed, their validity and effectiveness for rekeying usage still need to be determined. In contrast, LR4 is formally proven under a leakage model that captures the practical goal of side-channel attack (SCA) protection (e.g., masking with a practical order) and assumes no unbounded DPA-resistant sanctuary. This proof suggests that LR4 resists exponential invocations (up to the birthday bound of key size) without using any unbounded leak-free component, which is the first of its kind. Moreover, we present a quantitative SCA success rate evaluation methodology for LR4 that combines the bounded leakage models for LR cryptography and a state-of-the-art information-theoretical SCA evaluation method. We validate its soundness and effectiveness as a DPA countermeasure through a numerical evaluation; that is, the number of secure calls of a symmetric primitive increases exponentially by increasing a security parameter under practical conditions.
12
Nawaz, Yasir, and Lei Wang. "Block Cipher in the Ideal Cipher Model: A Dedicated Permutation Modeled as a Black-Box Public Random Permutation." Symmetry 11, no. 12 (December 5, 2019): 1485. http://dx.doi.org/10.3390/sym11121485.
Full textAbstract:
Designing a secure construction has always been a fascinating area for the researchers in the field of symmetric key cryptography. This research aimed to make contributions to the design of secure block cipher in the ideal cipher model whose underlying primitive is a family of n − b i t to n − b i t random permutations indexed by secret key. Our target construction of a secure block ciphers denoted as E [ s ] is built on a simple XOR operation and two block cipher invocations, under the assumptions that the block cipher in use is a pseudorandom permutation. One out of these two block cipher invocations produce a subkey that is derived from the secret key. It has been accepted that at least two block cipher invocations with XOR operations are required to achieve beyond birthday bound security. In this paper, we investigated the E [ s ] instances with the advanced proof technique and efficient block cipher constructions that bypass the birthday-bound up to 2 n provable security was achieved. Our study provided new insights to the block cipher that is beyond birthday bound security.
13
Vizár, Damian. "The State of the Authenticated Encryption." Tatra Mountains Mathematical Publications 67, no. 1 (September 1, 2016): 167–90. http://dx.doi.org/10.1515/tmmp-2016-0038.
Full textAbstract:
Abstract Ensuring confidentiality and integrity of communication remains among the most important goals of cryptography. The notion of authenticated encryption marries these two security goals in a single symmetric-key, cryptographic primitive. A lot of effort has been invested in authenticated encryption during the fifteen years of its existence. The recent Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR) has boosted the research activity in this area even more. As a result, the area of authenticated encryption boasts numerous results, both theoretically and practically oriented, and perhaps even greater number of constructions of authenticated encryption schemes. We explore the current landscape of results on authenticated encryption. We review the CEASAR competition and its candidates, the most popular construction principles, and various design goals for authenticated encryption, many of which appeared during the CAESAR competition. We also take a closer look at the candidate Offset Merkle-Damgård (OMD).
14
Jang, Kyoungbae, Seungju Choi, Hyeokdong Kwon, Hyunji Kim, Jaehoon Park, and Hwajeong Seo. "Grover on Korean Block Ciphers." Applied Sciences 10, no. 18 (September 14, 2020): 6407. http://dx.doi.org/10.3390/app10186407.
Full textAbstract:
The Grover search algorithm reduces the security level of symmetric key cryptography with n-bit security level to O(2n/2). In order to evaluate the Grover search algorithm, the target block cipher should be efficiently implemented in quantum circuits. Recently, many research works evaluated required quantum resources of AES block ciphers by optimizing the expensive substitute layer. However, few works were devoted to the lightweight block ciphers, even though it is an active research area, nowadays. In this paper, we present optimized implementations of every Korean made lightweight block ciphers for quantum computers, which include HIGHT, CHAM, and LEA, and NSA made lightweight block ciphers, namely SPECK. Primitive operations for block ciphers, including addition, rotation, and exclusive-or, are finely optimized to achieve the optimal quantum circuit, in terms of qubits, Toffoli gate, CNOT gate, and X gate. To the best of our knowledge, this is the first implementation of ARX-based Korean lightweight block ciphers in quantum circuits.
15
Ge, Xuyang, Tim Li, Yuqing Wang, and Melinda S. Peng. "Tropical Cyclone Energy Dispersion in a Three-Dimensional Primitive Equation Model: Upper-Tropospheric Influence*." Journal of the Atmospheric Sciences 65, no. 7 (July 1, 2008): 2272–89. http://dx.doi.org/10.1175/2007jas2431.1.
Full textAbstract:
Abstract The three-dimensional (3D) Rossby wave energy dispersion of a tropical cyclone (TC) is studied using a baroclinic primitive equation model. The model is initialized with a symmetric vortex on a beta plane in an environment at rest. The vortex intensifies while becoming asymmetric and moving northwestward because of the beta effect. A synoptic-scale wave train forms in its wake a few days later. The energy-dispersion-induced Rossby wave train has a noticeable baroclinic structure with alternating cyclonic–anticyclonic–cyclonic (anticyclonic–cyclonic–anticyclonic) circulations in the lower (upper) troposphere. A key feature associated with the 3D wave train development is a downward propagation of the relative vorticity and kinetic energy. Because of the vertical differential inertial stability, the upper-level wave train develops faster than the lower-level counterpart. The upper anticyclonic circulation rapidly induces an intense asymmetric outflow jet in the southeast quadrant, and then further influences the lower-level Rossby wave train. On one hand, the outflow jet exerts an indirect effect on the lower-level wave train strength through changing TC intensity and structure. On the other hand, it triggers downward energy propagation that further enhances the lower-level Rossby wave train. A sudden removal of the diabatic heating may initially accelerate the energy dispersion through the increase of the radius of maximum wind and the reduction of the lower-level inflow. The latter may modulate the group velocity of the Rossby wave train through the Doppler shift effect. The 3D numerical results illustrate more complicated Rossby wave energy dispersion characteristics than 2D barotropic dynamics.
16
Roeser, T., S. Stein, and M. Kessel. "Nuclear beta-catenin and the development of bilateral symmetry in normal and LiCl-exposed chick embryos." Development 126, no. 13 (July 1, 1999): 2955–65. http://dx.doi.org/10.1242/dev.126.13.2955.
Full textAbstract:
Studies in Xenopus laevis and zebrafish suggest a key role for beta-catenin in the specification of the axis of bilateral symmetry. In these organisms, nuclear beta-catenin demarcates the dorsalizing centers. We have asked whether beta-catenin plays a comparable role in the chick embryo and how it is adapted to the particular developmental constraints of chick development. The first nuclear localization of beta-catenin is observed in late intrauterine stages of development in the periphery of the blastoderm, the developing area opaca and marginal zone. Obviously, this early, radially symmetric domain does not predict the future organizing center of the embryo. During further development, cells containing nuclear beta-catenin spread under the epiblast and form the secondary hypoblast. The onset of hypoblast formation thus demarcates the first bilateral symmetry in nuclear beta-catenin distribution. Lithium chloride exposure also causes ectopic nuclear localization of beta-catenin in cells of the epiblast in the area pellucida. Embryos treated before primitive streak formation become completely radialized, as shown by the expression of molecular markers, CMIX and GSC. Lithium treatments performed during early or medium streak stages cause excessive development of the anterior primitive streak, node and notochord, and lead to a degeneration of prospective ventral and posterior structures, as shown by the expression of the molecular markers GSC, CNOT1, BMP2 and Ch-Tbx6L. In summary, we found that in spite of remarkable spatiotemporal differences, beta-catenin acts in the chick in a manner similar to that in fish and amphibia.
17
Boura, Christina, Patrick Derbez, and Margot Funk. "Related-Key Differential Analysis of the AES." IACR Transactions on Symmetric Cryptology 2023, no. 4 (December 8, 2023): 215–43. http://dx.doi.org/10.46586/tosc.v2023.i4.215-243.
Full textAbstract:
The Advanced Encryption Standard (AES) is considered to be the most important and widely deployed symmetric primitive. While the cipher was designed to be immune against differential and other classical attacks, this immunity does not hold in the related-key setting, and various related-key attacks have appeared over time. This work presents tools and algorithms to search for related-key distinguishers and attacks of differential nature against the AES. First, we propose two entirely different approaches to find optimal truncated differential characteristics and bounds on the minimum number of active S-boxes for all variants of the AES. In the first approach, we propose a simple MILP model that handles better linear inconsistencies with respect to the AES system of equations and that compares particularly well to previous tool-based approaches to solve this problem. The main advantage of this tool is that it can easily be used as the core algorithm to search for any attack on AES exploiting related-key differentials. Then, we design a fast and low-memory algorithm based on dynamic programming that has a very simple to understand complexity analysis and does not depend on any generic solver. This second algorithm provides us useful insight on the related-key differential search problem for AES and shows that the search space is not as big as one would expect. Finally, we build on the top of our MILP model a fully automated tool to search for the best differential MITM attacks against the AES. We apply our tool on AES-256 and find an attack on 13 rounds with only two related keys. This attack can be seen as the best known cryptanalysis against this variant if only 2 related keys are permitted.
18
Lee, Byoungcheon. "Stateless Re-Association in WPA3 Using Paired Token." Electronics 10, no. 2 (January 19, 2021): 215. http://dx.doi.org/10.3390/electronics10020215.
Full textAbstract:
In Wi-Fi Protected Access 3 (WPA3), a secure connection is established in two sequential stages. Firstly, in the authentication and association stage, a pairwise master key (PMK) is generated. Secondly, in the post-association stage, a pairwise transient key (PTK) is generated from PMK using the traditional 4-way handshake protocol. To reduce the heavy load of the first stage, PMK caching can be used. If the client and AP are previously authenticated and have a PMK cache, the first heavy stage can be skipped and the cached PMK can be used to directly execute the 4-way handshake. However, PMK caching is a very primitive technology to manage shared key between a client and AP and there are many limitations; AP has to manage a stateful cache for a large number of clients, cache lifetime is limited, etc. Paired token (PT)is a new secondary credential scheme that provides stateless pre-shared key (PSK) in a client-server environment. The server issues a paired token (public token and secret token) to an authenticated client where the public token has the role of signed identity and the secret token is a kind of shared secret. Once a client is equipped with PT, it can be used for many symmetric key-based cryptographic applications such as authentication, authorization, key establishment, etc. In this paper, we apply the PT approach to WPA3 and try to replace the PMK caching with the one-time authenticated key establishment using PT. At the end of a successful full handshake, AP securely issues PT to the client. Then, in subsequent re-association requests, the client and AP can compute the same one-time authenticated PMK using PT in a stateless way. Using this kind of stateless re-association technology, AP can provide a high performance Wi-Fi service to a larger number of clients.
19
Miraj, Muhammad Armaghan Faisal, Naveed Ahsan, Hamza Tariq, Shan Shahzad, and Rana Faizan Saleem. "Fracture Pattern Analysis of the Upper Cretaceous-Eocene Carbonates along with the Ghumawan Dome, Hazara Basin." International Journal of Economic and Environmental Geology 12, no. 3 (November 16, 2021): 6–10. http://dx.doi.org/10.46660/ijeeg.vol12.iss3.2021.612.
Full textAbstract:
Deformational history of the Hazara basin indicates a primitive collision of the two landmasses that undergoes an episodic deformation with NE-SW structural trend. Panjal Thrust (PT) and Main Boundary Thrust (MBT) demarcate the northern and southern extremities of the basin, respectively. The area bounded between these two thrusts is the core consideration of the present research. Different stratigraphic units juxtapose along the Hazara Kashmir Syntaxes (HKS), while the strike-slip component is indicated by imbrication due to thrusts. The study is amied to analyze the paleo-stresses along with developed fracture patterns. Field data were collected via Circle Inventory Method from various localities of the Ghumawan dome, Hazara basin. The zones of upper Cretaceous to Eocene carbonates were mainly targeted during the data collection. Win-Tensor was the key software that helps to analyze the paleo-stresses and fracture pattern of the study area. NW-trending fracture pattern was observed with a highly non-symmetric to dense fracture pattern. The local thrust system lead to severely de-shape the study area. N-S oriented σ1 indicated the compressional tectonic conditionthat prevailed during deformation of this area. Some segments also show extensional features i.e. normal faulting.
20
Huang, Haiping, Qinglong Huang, Fu Xiao, Wenming Wang, Qi Li, and Ting Dai. "An Improved Broadcast Authentication Protocol for Wireless Sensor Networks Based on the Self-Reinitializable Hash Chains." Security and Communication Networks 2020 (September 1, 2020): 1–17. http://dx.doi.org/10.1155/2020/8897282.
Full textAbstract:
Broadcast authentication is a fundamental security primitive in wireless sensor networks (WSNs), which is a critical sensing component of IoT. Although symmetric-key-based μTESLA protocol has been proposed, some concerns about the difficulty of predicting the network lifecycle in advance and the security problems caused by an overlong long hash chain still remain. This paper presents a scalable broadcast authentication scheme named DH-μTESLA, which is an extension and improvement of μTESLA and Multilevel μTESLA, to achieve several vital properties, such as infinite lifecycle of hash chains, security authentication, scalability, and strong tolerance of message loss. The proposal consists of the t,n-threshold-based self-reinitializable hash chain scheme (SRHC-TD) and the d-left-counting-Bloom-filter-based authentication scheme (AdlCBF). In comparison to other broadcast authentication protocols, our proposal achieves more security properties such as fresh node’s participation and DoS resistance. Furthermore, the reinitializable hash chain constructed in SRHC-TD is proved to be secure and has less computation and communication overhead compared with typical solutions, and efficient storage is realized based on AdlCBF, which can also defend against DoS attacks.
21
Miraj, Muhammad Armaghan Faisal, Naveed Ahsan, Hamza Tariq, Shan Shahzad, and Rana Faizan Saleem. "Fracture Pattern Analysis of the Upper Cretaceous-Eocene Carbonates along with the Ghumawan Dome, Hazara Basin." International Journal of Economic and Environmental Geology 12, no. 3 (March 11, 2023): 6–10. http://dx.doi.org/10.46660/ijeeg.v12i3.55.
Full textAbstract:
Deformational history of the Hazara basin indicates a primitive collision of the two landmasses that undergoes an episodic deformation with NE-SW structural trend. Panjal Thrust (PT) and Main Boundary Thrust (MBT) demarcate the northern and southern extremities of the basin, respectively. The area bounded between these two thrusts is the core consideration of the present research. Different stratigraphic units juxtapose along the Hazara Kashmir Syntaxes (HKS), while the strike-slip component is indicated by imbrication due to thrusts. The study is amied to analyze the paleo-stresses along with developed fracture patterns. Field data were collected via Circle Inventory Method from various localities of the Ghumawan dome, Hazara basin. The zones of upper Cretaceous to Eocene carbonates were mainly targeted during the data collection. Win-Tensor was the key software that helps to analyze the paleo-stresses and fracture pattern of the study area. NW-trending fracture pattern was observed with a highly non-symmetric to dense fracture pattern. The local thrust system lead to severely de-shape the study area. N-S oriented σ1 indicated the compressional tectonic condition that prevailed during deformation of this area. Some segments also show extensional features i.e. normal faulting.
22
Selby, John H., Carlo Maria Scandolo, and Bob Coecke. "Reconstructing quantum theory from diagrammatic postulates." Quantum 5 (April 28, 2021): 445. http://dx.doi.org/10.22331/q-2021-04-28-445.
Full textAbstract:
A reconstruction of quantum theory refers to both a mathematical and a conceptual paradigm that allows one to derive the usual formulation of quantum theory from a set of primitive assumptions. The motivation for doing so is a discomfort with the usual formulation of quantum theory, a discomfort that started with its originator John von Neumann. We present a reconstruction of finite-dimensional quantum theory where all of the postulates are stated in diagrammatic terms, making them intuitive. Equivalently, they are stated in category-theoretic terms, making them mathematically appealing. Again equivalently, they are stated in process-theoretic terms, establishing that the conceptual backbone of quantum theory concerns the manner in which systems and processes compose. Aside from the diagrammatic form, the key novel aspect of this reconstruction is the introduction of a new postulate, symmetric purification. Unlike the ordinary purification postulate, symmetric purification applies equally well to classical theory as well as quantum theory. Therefore we first reconstruct the full process theoretic description of quantum theory, consisting of composite classical-quantum systems and their interactions, before restricting ourselves to just the ‘fully quantum’ systems as the final step. We propose two novel alternative manners of doing so, ‘no-leaking’ (roughly that information gain causes disturbance) and ‘purity of cups’ (roughly the existence of entangled states). Interestingly, these turn out to be equivalent in any process theory with cups & caps. Additionally, we show how the standard purification postulate can be seen as an immediate consequence of the symmetric purification postulate and purity of cups. Other tangential results concern the specific frameworks of generalised probabilistic theories (GPTs) and process theories (a.k.a. CQM). Firstly, we provide a diagrammatic presentation of GPTs, which, henceforth, can be subsumed under process theories. Secondly, we argue that the ‘sharp dagger’ is indeed the right choice of a dagger structure as this sharpness is vital to the reconstruction.
23
Cao, Jing, Zuowei Wang, and Alexei Likhtman. "Determining Tube Theory Parameters by Slip-Spring Model Simulations of Entangled Star Polymers in Fixed Networks." Polymers 11, no. 3 (March 14, 2019): 496. http://dx.doi.org/10.3390/polym11030496.
Full textAbstract:
Dynamical properties of branched polymer melts are determined by the polymer molecular weights and architectures containing junction points. Relaxation of entangled symmetric star polymers proceeds via arm-retraction and constraint release (CR). In this work, we investigate arm-retraction dynamics in the framework of a single-chain slip-spring model without CR effect where entanglements are treated as binary contacts, conveniently modeled as virtual “slip-links”, each involving two neighboring strands. The model systems are analogous to isolated star polymers confined in a permanent network or a melt of very long linear polymers. We find that the distributions of the effective primitive path lengths are Gaussian, from which the entanglement molecular weight N e , a key tube theory parameter, can be extracted. The procured N e value is in good agreement with that obtained from mapping the middle monomer mean-square displacements of entangled linear chains in slip-spring model to the tube model prediction. Furthermore, the mean first-passage (FP) times of destruction of original tube segments by the retracting arm end are collected in simulations and examined quantitatively using a theory recently developed in our group for describing FP problems of one-dimensional Rouse chains with improbable extensions. The asymptotic values of N e as obtained from the static (primitive path length) and dynamical (FP time) analysis are consistent with each other. Additionally, we manage to determine the tube survival function of star arms μ ( t ) , or equivalently arm end-to-end vector relaxation function ϕ ( t ) , through the mean FP time spectrum τ ( s ) of the tube segments after careful consideration of the inner-most entanglements, which shows reasonably good agreement with experimental data on dielectric relaxation.
24
Sakan, Kairat, Saule Nyssanbayeva, Nursulu Kapalova, Kunbolat Algazy, Ardabek Khompysh, and Dilmukhanbet Dyusenbayev. "Development and analysis of the new hashing algorithm based on block cipher." Eastern-European Journal of Enterprise Technologies 2, no. 9 (116) (April 30, 2022): 60–73. http://dx.doi.org/10.15587/1729-4061.2022.252060.
Full textAbstract:
This paper proposes the new hash algorithm HBC-256 (Hash based on Block Cipher) based on the symmetric block cipher of the CF (Compression Function). The algorithm is based on the wipe-pipe construct, a modified version of the Merkle-Damgard construct. To transform the block cipher CF into a one-way compression function, the Davis-Meyer scheme is used, which, according to the results of research, is recognized as a strong and secure scheme for constructing hash functions based on block ciphers. The symmetric CF block cipher algorithm used consists of three transformations (Stage-1, Stage-2, and Stage-3), which include modulo two addition, circular shift, and substitution box (four-bit S-boxes). The four substitution boxes are selected from the “golden” set of S-boxes, which have ideal cryptographic properties. The HBC-256 scheme is designed to strike an effective balance between computational speed and protection against a preimage attack. The CF algorithm uses an AES-like primitive as an internal transformation. The hash image was tested for randomness using the NIST (National Institute of Standards and Technology) statistical test suite, the results were examined for the presence of an avalanche effect in the CF encryption algorithm and the HBC-256 hash algorithm itself. The resistance of HBC-256 to near collisions has been practically tested. Since the classical block cipher key expansion algorithms slow down the hash function, the proposed algorithm is adapted for hardware and software implementation by applying parallel computing. A hashing algorithm was developed that has a sufficiently large freedom to select the sizes of the input blocks and the output hash digest. This will make it possible to create an almost universal hashing algorithm and use it in any cryptographic protocols and electronic digital signature algorithms
25
Zaverucha, Gregory M., and Douglas R. Stinson. "Anonymity in shared symmetric key primitives." Designs, Codes and Cryptography 57, no. 2 (January 20, 2010): 139–60. http://dx.doi.org/10.1007/s10623-009-9357-0.
Full text
26
Datta, Nilanjan, Shreya Dey, Avijit Dutta, and Sougata Mandal. "Cascading Four Round LRW1 is Beyond Birthday Bound Secure." IACR Transactions on Symmetric Cryptology 2023, no. 4 (December 8, 2023): 365–90. http://dx.doi.org/10.46586/tosc.v2023.i4.365-390.
Full textAbstract:
In CRYPTO’02, Liskov et al. introduced the concept of a tweakable block cipher, a novel symmetric key primitive with promising applications. They put forth two constructions for designing such tweakable block ciphers from conventional block ciphers: LRW1 and LRW2. While subsequent efforts extended LRW2 to achieve security beyond the birthday bound (e.g., cascaded LRW2 in CRYPTO’12 by Landecker et al.), the extension of LRW1 remained unexplored until Bao et al.’s work in EUROCRYPT’20 that considered cascaded LRW1, a one-round extension of LRW1 - entailing masking the LRW1 output with the given tweak and re-encrypting it with the same block cipher. They showed that CLRW1 offers security up to 22n/3 queries. However, this result was challenged by Khairallah’s recent birthday bound distinguishing attack on cascaded LRW1, effectively refuting the security claim of Bao et al. Consequently, a pertinent research question emerges: How many rounds of cascaded LRW1 are required to obtain security beyond the birthday bound? This paper addresses this question by establishing that cascading LRW1 for four rounds suffices to ensure security beyond the birthday bound. Specifically, we demonstrate that 4 rounds of CLRW1 guarantees security for up to 23n/4 queries. Our security analysis is based from recent advancements in the mirror theory technique for tweakable random permutations, operating within the framework of the Expectation Method.
27
Ruf, Armin, Tim Tetaz, Brigitte Schott, Catherine Joseph, and Markus G. Rudolph. "Quadruple space-group ambiguity owing to rotational and translational noncrystallographic symmetry in human liver fructose-1,6-bisphosphatase." Acta Crystallographica Section D Structural Biology 72, no. 11 (October 28, 2016): 1212–24. http://dx.doi.org/10.1107/s2059798316016715.
Full textAbstract:
Fructose-1,6-bisphosphatase (FBPase) is a key regulator of gluconeogenesis and a potential drug target for type 2 diabetes. FBPase is a homotetramer of 222 symmetry with a major and a minor dimer interface. The dimers connectedviathe minor interface can rotate with respect to each other, leading to the inactive T-state and active R-state conformations of FBPase. Here, the first crystal structure of human liver FBPase in the R-state conformation is presented, determined at a resolution of 2.2 Å in a tetragonal setting that exhibits an unusual arrangement of noncrystallographic symmetry (NCS) elements. Self-Patterson function analysis and various intensity statistics revealed the presence of pseudo-translation and the absence of twinning. The space group isP41212, but structure determination was also possible in space groupsP43212,P4122 andP4322. All solutions have the same arrangement of threeC2-symmetric dimers spaced by 1/3 along an NCS axis parallel to thecaxis located at (1/4, 1/4,z), which is therefore invisible in a self-rotation function analysis. The solutions in the four space groups are related to one another and emulate a body-centred lattice. If all NCS elements were crystallographic, the space group would beI4122 with acaxis three times shorter and a single FBPase subunit in the asymmetric unit.I4122 is a minimal, non-isomorphic supergroup of the four primitive tetragonal space groups, explaining the space-group ambiguity for this crystal.
28
Liu, Fukang, Abul Kalam, Santanu Sarkar, and Willi Meier. "Algebraic Attack on FHE-Friendly Cipher HERA Using Multiple Collisions." IACR Transactions on Symmetric Cryptology 2024, no. 1 (March 1, 2024): 214–33. http://dx.doi.org/10.46586/tosc.v2024.i1.214-233.
Full textAbstract:
Fully homomorphic encryption (FHE) is an advanced cryptography technique to allow computations (i.e., addition and multiplication) over encrypted data. After years of effort, the performance of FHE has been significantly improved and it has moved from theory to practice. The transciphering framework is another important technique in FHE to address the issue of ciphertext expansion and reduce the client-side computational overhead. To apply the transciphering framework to the CKKS FHE scheme, a new transciphering framework called the Real-to-Finite-Field (RtF) framework and a corresponding FHE-friendly symmetric-key primitive called HERA were proposed at ASIACRYPT 2021. Although HERA has a very similar structure to AES, it is considerably different in the following aspects: 1) the power map x → x3 is used as the S-box; 2) a randomized key schedule is used; 3) it is over a prime field Fp with p > 216. In this work, we perform the first third-party cryptanalysis of HERA, by showing how to mount new algebraic attacks with multiple collisions in the round keys. Specifically, according to the special way to randomize the round keys in HERA, we find it possible to peel off the last nonlinear layer by using collisions in the last-round key and a simple property of the power map. In this way, we could construct an overdefined system of equations of a much lower degree in the key, and efficiently solve the system via the linearization technique. As a esult, for HERA with 192 and 256 bits of security, respectively, we could break some parameters under the same assumption made by designers that the algebra constant ω for Gaussian elimination is ω = 2, i.e., Gaussian elimination on an n × n matrix takes O(nω) field operations. If using more conservative choices like ω ∈ {2.8, 3}, our attacks can also successfully reduce the security margins of some variants of HERA to only 1 round. However, the security of HERA with 80 and 128 bits of security is not affected by our attacks due to the high cost to find multiple collisions. In any case, our attacks reveal a weakness of HERA caused by the randomized key schedule and its small state size.
29
Abbas, Ghulam, Muhammad Tanveer, Ziaul Haq Abbas, Muhammad Waqas, Thar Baker, and Dhiya Al-Jumeily OBE. "A secure remote user authentication scheme for 6LoWPAN-based Internet of Things." PLOS ONE 16, no. 11 (November 8, 2021): e0258279. http://dx.doi.org/10.1371/journal.pone.0258279.
Full textAbstract:
One of the significant challenges in the Internet of Things (IoT) is the provisioning of guaranteed security and privacy, considering the fact that IoT devices are resource-limited. Oftentimes, in IoT applications, remote users need to obtain real-time data, with guaranteed security and privacy, from resource-limited network nodes through the public Internet. For this purpose, the users need to establish a secure link with the network nodes. Though the IPv6 over low-power wireless personal area networks (6LoWPAN) adaptation layer standard offers IPv6 compatibility for resource-limited wireless networks, the fundamental 6LoWPAN structure ignores security and privacy characteristics. Thus, there is a pressing need to design a resource-efficient authenticated key exchange (AKE) scheme for ensuring secure communication in 6LoWPAN-based resource-limited networks. This paper proposes a resource-efficient secure remote user authentication scheme for 6LoWPAN-based IoT networks, called SRUA-IoT. SRUA-IoT achieves the authentication of remote users and enables the users and network entities to establish private session keys between themselves for indecipherable communication. To this end, SRUA-IoT uses a secure hash algorithm, exclusive-OR operation, and symmetric encryption primitive. We prove through informal security analysis that SRUA-IoT is secured against a variety of malicious attacks. We also prove the security strength of SRUA-IoT through formal security analysis conducted by employing the random oracle model. Additionally, we prove through Scyther-based validation that SRUA-IoT is resilient against various attacks. Likewise, we demonstrate that SRUA-IoT reduces the computational cost of the nodes and communication overheads of the network.
30
An, Yang, Yuejiao Zhang, Wenjun Cao, Zhiyan Tong, and Zhangqing He. "A Lightweight and Practical Anonymous Authentication Protocol Based on Bit-Self-Test PUF." Electronics 11, no. 5 (March 2, 2022): 772. http://dx.doi.org/10.3390/electronics11050772.
Full textAbstract:
Physical unclonable function (PUF), a cryptographic primitive, has recently been used in protocol design because it can ensure a tamper-evident feature. In many PUF-based protocol schemes, helper data algorithms (HDA) or fuzzy extractors (FE) are used to generate strong keys from unreliable PUF responses. However, these methods inevitably introduce complex error correction techniques, which not only increase the overhead of embedded devices but also pose some security risks. We propose a novel HDA technology, which does not use any high-overhead error correction mechanism, greatly reducing the implementation complexity and execution overhead. The novel HDA exploits the strategy of bit-self-test (BST) and the PUF can extract the robust responses by using the real-time generated reliable flags, and then an entropy extractor is used to generate the reliable and random key with high entropy. Based on this novel HDA, we design a lightweight anonymous authentication protocol. The protocol uses pseudo-random function (PRF) and XOR operation instead of the traditional hash function and symmetric encryption algorithm, which ensures security while reducing the overhead. Moreover, the proposed protocol does not require the server to store a large number of challenge–response pairs (CRPs), which reduces the storage overhead on the server while avoiding the risk of leakage of CRPs. Moreover, the device identity ID is updated during each round of the authentication process, which prevents the device from being tracked and protects the privacy of the device. The implementation and performance analysis of the protocol prototype on a Zynq-7000 SoC XC7Z010 FPGA shows that the proposed scheme solves the problems encountered with existing schemes and has additional security properties.
31
Santoli, Thomas, and Christian Schaffner. "Using Simon's algorithm to attack symmetric-key cryptographic primitives." Quantum Information and Computation 17, no. 1&2 (January 2017): 65–78. http://dx.doi.org/10.26421/qic17.1-2-4.
Full textAbstract:
We present new connections between quantum information and the field of classical cryptography. In particular, we provide examples where Simon’s algorithm can be used to show insecurity of commonly used cryptographic symmetric-key primitives. Specifically, these examples consist of a quantum distinguisher for the 3-round Feistel network and a forgery attack on CBC-MAC which forges a tag for a chosen-prefix message querying only other messages (of the same length). We assume that an adversary has quantum-oracle access to the respective classical primitives. Similar results have been achieved recently in independent work by Kaplan et al. [KLLNP16]. Our findings shed new light on the post-quantum security of cryptographic schemes and underline that classical security proofs of cryptographic constructions need to be revisited in light of quantum attackers.
32
Ali, Asim, Muhammad Asif Khan, Ramesh Kumar Ayyasamy, and Muhammad Wasif. "A novel systematic byte substitution method to design strong bijective substitution box (S-box) using piece-wise-linear chaotic map." PeerJ Computer Science 8 (May 11, 2022): e940. http://dx.doi.org/10.7717/peerj-cs.940.
Full textAbstract:
Cryptography deals with designing practical mathematical algorithms having the two primitive elements of confusion and diffusion. The security of encrypted data is highly dependent on these two primitive elements and a key. S-box is the nonlinear component present in a symmetric encryption algorithm that provides confusion. A cryptographically strong bijective S-box structure in cryptosystem ensures near-optimal resistance against cryptanalytic attacks. It provides uncertainty and nonlinearity that ensures high confidentiality and security against cryptanalysis attacks. The nonlinearity of an S-box is highly dependent on the dispersal of input data using an S-box. Cryptographic performance criteria of chaos-based S-boxes are worse than algebraic S-box design methods, especially differential probability. This article reports a novel approach to design an 8 × 8 S-box using chaos and randomization using dispersion property to S-box cryptographic properties, especially differential probability. The randomization using dispersion property is introduced within the design loop to achieve low differential uniformity possibly. Two steps are involved in generating the proposed S-box. In the first step, a piecewise linear chaotic map (PWLCM) is utilized to generate initial S-box positions. Generally, the dispersion property is a post-processing technique that measures maximum nonlinearity in a given random sequence. However, in the second step, the concept is carefully reverse engineered, and the dispersion property is used within the design loop for systematic dispersal of input substituting sequence. The proposed controlled randomization changes the probability distribution statistics of S-box’s differentials. The proposed methodology systematically substitutes the S-box positions that cause output differences to recur for a given input difference. The proposed S-box is analyzed using well-established and well-known statistical cryptographic criteria of nonlinearity, strict avalanche criteria (SAC), bit independence criteria (BIC), differential probability, and linear probability. Further, the S-box’s boomerang connectivity table (BCT) is generated to analyze its strength against boomerang attack. Boomerang is a relatively new attacking framework for cryptosystem. The proposed S-box is compared with the state-of-the-art latest related publications. Results show that the proposed S-box achieves an upper bound of cryptographic properties, especially differential probability. This work hypothesizes that highly dispersive hamming distances at output difference, generated a systematic S-box. The mixing property of chaos generated trajectories utilized for decimal mapping. To test the randomness of generated chaotic trajectories, a cryptographically secure pseudo-random sequence was generated using a chaotic map that was tested using the National Institute of Standards and Technology (NIST) NIST-800-22 test suit.
33
Chakraborti, Avik, Nilanjan Datta, and Mridul Nandi. "On the optimality of non-linear computations for symmetric key primitives." Journal of Mathematical Cryptology 12, no. 4 (December 1, 2018): 241–59. http://dx.doi.org/10.1515/jmc-2017-0011.
Full textAbstract:
Abstract A block is an n-bit string, and a (possibly keyed) block-function is a non-linear mapping that maps one block to another, e.g., a block-cipher. In this paper, we consider various symmetric key primitives with {\ell} block inputs and raise the following question: what is the minimum number of block-function invocations required for a mode to be secure? We begin with encryption modes that generate {\ell^{\prime}} block outputs and show that at least {(\ell+\ell^{\prime}-1)} block-function invocations are necessary to achieve the PRF security. In presence of a nonce, the requirement of block-functions reduces to {\ell^{\prime}} blocks only. If {\ell=\ell^{\prime}} , in order to achieve SPRP security, the mode requires at least {2\ell} many block-function invocations. We next consider length preserving r-block (called chunk) online encryption modes and show that, to achieve online PRP security, each chunk should have at least {2r-1} many and overall at least {2r\ell-1} many block-functions for {\ell} many chunks. Moreover, we show that it can achieve online SPRP security if each chunk contains at least {2r} non-linear block-functions. We next analyze affine MAC modes and show that an integrity-secure affine MAC mode requires at least {\ell} many block-function invocations to process an {\ell} block message. Finally, we consider affine mode authenticated encryption and show that in order to achieve INT-RUP security or integrity security under a nonce-misuse scenario, either (i) the number of non-linear block-functions required to generate the ciphertext is more than {\ell} or (ii) the number of extra non-linear block-functions required to generate the tag depends on {\ell} .
34
Jin, Xin, Yuwei Duan, Ying Zhang, Yating Huang, Mengdong Li, Ming Mao, Amit Kumar Singh, and Yujie Li. "Fast Search of Lightweight Block Cipher Primitives via Swarm-like Metaheuristics for Cyber Security." ACM Transactions on Internet Technology 21, no. 4 (July 16, 2021): 1–15. http://dx.doi.org/10.1145/3417296.
Full textAbstract:
With the construction and improvement of 5G infrastructure, more devices choose to access the Internet to achieve some functions. People are paying more attention to information security in the use of network devices. This makes lightweight block ciphers become a hotspot. A lightweight block cipher with superior performance can ensure the security of information while reducing the consumption of device resources. Traditional optimization tools, such as brute force or random search, are often used to solve the design of Symmetric-Key primitives. The metaheuristic algorithm was first used to solve the design of Symmetric-Key primitives of SKINNY. The genetic algorithm and the simulated annealing algorithm are used to increase the number of active S-boxes in SKINNY, thus improving the security of SKINNY. Based on this, to improve search efficiency and optimize search results, we design a novel metaheuristic algorithm, named particle swarm-like normal optimization algorithm (PSNO) to design the Symmetric-Key primitives of SKINNY. With our algorithm, one or better algorithm components can be obtained more quickly. The results in the experiments show that our search results are better than those of the genetic algorithm and the simulated annealing algorithm. The search efficiency is significantly improved. The algorithm we proposed can be generalized to the design of Symmetric-Key primitives of other lightweight block ciphers with clear evaluation indicators, where the corresponding indicators can be used as the objective functions.
35
Hussien, Hassan Mansur, Sharifah Md Yasin, Nur Izura Udzir, and Mohd Izuan Hafez Ninggal. "Blockchain-Based Access Control Scheme for Secure Shared Personal Health Records over Decentralised Storage." Sensors 21, no. 7 (April 2, 2021): 2462. http://dx.doi.org/10.3390/s21072462.
Full textAbstract:
Blockchain technology provides a tremendous opportunity to transform current personal health record (PHR) systems into a decentralised network infrastructure. However, such technology possesses some drawbacks, such as issues in privacy and storage capacity. Given its transparency and decentralised features, medical data are visible to everyone on the network and are inappropriate for certain medical applications. By contrast, storing vast medical data, such as patient medical history, laboratory tests, X-rays, and MRIs, significantly affect the repository storage of blockchain. This study bridges the gap between PHRs and blockchain technology by offloading the vast medical data into the InterPlanetary File System (IPFS) storage and establishing an enforced cryptographic authorisation and access control scheme for outsourced encrypted medical data. The access control scheme is constructed on the basis of the new lightweight cryptographic concept named smart contract-based attribute-based searchable encryption (SC-ABSE). This newly cryptographic primitive is developed by extending ciphertext-policy attribute-based encryption (CP-ABE) and searchable symmetric encryption (SSE) and by leveraging the technology of smart contracts to achieve the following: (1) efficient and secure fine-grained access control of outsourced encrypted data, (2) confidentiality of data by eliminating trusted private key generators, and (3) multikeyword searchable mechanism. Based on decisional bilinear Diffie–Hellman hardness assumptions (DBDH) and discrete logarithm (DL) problems, the rigorous security indistinguishability analysis indicates that SC-ABSE is secure against the chosen-keyword attack (CKA) and keyword secrecy (KS) in the standard model. In addition, user collusion attacks are prevented, and the tamper-proof resistance of data is ensured. Furthermore, security validation is verified by simulating a formal verification scenario using Automated Validation of Internet Security Protocols and Applications (AVISPA), thereby unveiling that SC-ABSE is resistant to man-in-the-middle (MIM) and replay attacks. The experimental analysis utilised real-world datasets to demonstrate the efficiency and utility of SC-ABSE in terms of computation overhead, storage cost and communication overhead. The proposed scheme is also designed and developed to evaluate throughput and latency transactions using a standard benchmark tool known as Caliper. Lastly, simulation results show that SC-ABSE has high throughput and low latency, with an ultimate increase in network life compared with traditional healthcare systems.
36
Challa, Ratnakumari, and VijayaKumari Gunta. "Towards the Construction of Reed-Muller Code Based Symmetric Key FHE." Ingénierie des systèmes d information 26, no. 6 (December 27, 2021): 585–90. http://dx.doi.org/10.18280/isi.260609.
Full textAbstract:
Homomorphic encryption (HE) schemes became popular cryptographic primitives and very useful in variety of security applications. Homomorphic encryption based on coding theory have the advantages of faster computations due to the structural properties of the codes used. Several schemes are supporting unlimited Mod2 addition operations in literature. The present paper introduces Reed-Muller (RM) code based Mod2 multiplication operation thereby making RM code based HE scheme fully homomorphic. The representation of the codeword with necessary adaption to support unlimited number of Mod2 multiplication operations is presented along with the scheme first. The correctness proof of the homomorphic operations along with experimental evaluation is also presented to demonstrate the practical aspects of the proposal.
37
Goel, Aarushi, Matthew Green, Mathias Hall-Andersen, and Gabriel Kaptchuk. "Efficient Set Membership Proofs using MPC-in-the-Head." Proceedings on Privacy Enhancing Technologies 2022, no. 2 (March 3, 2022): 304–24. http://dx.doi.org/10.2478/popets-2022-0047.
Full textAbstract:
Abstract Set membership proofs are an invaluable part of privacy preserving systems. These proofs allow a prover to demonstrate knowledge of a witness w corresponding to a secret element x of a public set, such that they jointly satisfy a given NP relation, i.e. ℛ(w, x) = 1 and x is a member of a public set {x 1, . . . , x𝓁}. This allows the identity of the prover to remain hidden, eg. ring signatures and confidential transactions in cryptocurrencies. In this work, we develop a new technique for efficiently adding logarithmic-sized set membership proofs to any MPC-in-the-head based zero-knowledge protocol (Ishai et al. [STOC’07]). We integrate our technique into an open source implementation of the state-of-the-art, post quantum secure zero-knowledge protocol of Katz et al. [CCS’18].We find that using our techniques to construct ring signatures results in signatures (based only on symmetric key primitives) that are between 5 and 10 times smaller than state-of-the-art techniques based on the same assumptions. We also show that our techniques can be used to efficiently construct post-quantum secure RingCT from only symmetric key primitives.
38
Parmar, Keyur, and Devesh C. Jinwala. "Symmetric-Key Based Homomorphic Primitives for End-to-End Secure Data Aggregation in Wireless Sensor Networks." Journal of Information Security 06, no. 01 (2015): 38–50. http://dx.doi.org/10.4236/jis.2015.61005.
Full text
39
Kaidalov, Dmytro, Roman Oliynykov, and Oleksandr Kazymyrov. "A Method for Security Estimation of the Spn-Based Block Cipher Against Related-Key Attacks." Tatra Mountains Mathematical Publications 60, no. 1 (September 1, 2014): 25–45. http://dx.doi.org/10.2478/tmmp-2014-0023.
Full textAbstract:
Abstract Symmetric block ciphers are the most widely used cryptographic primitives. In addition to providing privacy, block ciphers are used as basic components in the construction of hash functions, message authentication codes, pseudorandom number generators, as a part of various cryptographic protocols, etc. Nowadays the most popular block cipher is AES (Advanced Encryption Standard). It is used as a standard of symmetric encryption in many countries. Several years ago it was found a theoretical attack exploiting the AES key expansion algorithm that allows reducing significantly the complexity comparing to the brute force attack. This article presents an advanced method of finding the number of active substitutions that helps to estimate the security of encryption algorithms against related-key attacks. The method was applied to a prospective block cipher, which is a candidate for the Ukrainian standard
40
Nyangaresi, Vincent Omollo, Zaid Ameen Abduljabbar, Keyan Abdul-Aziz Mutlaq, Junchao Ma, Dhafer G. Honi, Abdulla J. Y. Aldarwish, and Iman Qays Abduljaleel. "Energy Efficient Dynamic Symmetric Key Based Protocol for Secure Traffic Exchanges in Smart Homes." Applied Sciences 12, no. 24 (December 11, 2022): 12688. http://dx.doi.org/10.3390/app122412688.
Full textAbstract:
Highly sensitive information about people’s social life and daily activities flows in smart home networks. As such, if attackers can manage to capture or even eavesdrop on this information, the privacy of the users can be compromised. The consequences can be far-reaching, such as knowing the status of home occupancy that can then facilitate burglary. To address these challenges, approaches such as data aggregation and signcryption have been utilized. Elliptic curve cryptography, bilinear pairing, asymmetric key cryptosystem, blockchain, and exponential operations are among the most popular techniques deployed to design these security solutions. However, the computational, storage and communication complexities exhibited by the majority of these techniques are too high. This renders these techniques unsuitable for smart home components such as smart switches and sensors. Some of these schemes have centralized architectures, which present some single points of failure. In this paper, symmetric key authentication procedures are presented for smart home networks. The proposed protocol leverages on cryptographic primitives such as one-way hashing and bitwise exclusive-Or operations. The results indicate that this scheme incurs the lowest communication, storage, and computation costs compared to other related state-of-the-art techniques. Empirically, our protocol reduces the communication and computation complexities by 16.7% and 57.7%, respectively. In addition, it provides backward key secrecy, robust mutual authentication, anonymity, forward key secrecy, and unlinkability. Moreover, it can effectively prevent attacks such as impersonation, session hijacking, denial of service, packet replays, man-in-the-middle, and message eavesdropping.
41
Banegas, Gustavo, Paulo S. L. M. Barreto, Edoardo Persichetti, and Paolo Santini. "Designing Efficient Dyadic Operations for Cryptographic Applications." Journal of Mathematical Cryptology 14, no. 1 (June 19, 2020): 95–109. http://dx.doi.org/10.1515/jmc-2015-0054.
Full textAbstract:
AbstractCryptographic primitives from coding theory are some of the most promising candidates for NIST’s Post-Quantum Cryptography Standardization process. In this paper, we introduce a variety of techniques to improve operations on dyadic matrices, a particular type of symmetric matrices that appear in the automorphism group of certain linear codes. Besides the independent interest, these techniques find an immediate application in practice. In fact, one of the candidates for the Key Exchange functionality, called DAGS, makes use of quasi-dyadic matrices to provide compact keys for the scheme.
42
Xiao, Yao, Lei Xu, Zikang Chen, Can Zhang, and Liehuang Zhu. "A Blockchain-Based Data Sharing System with Enhanced Auditability." Mathematics 10, no. 23 (November 28, 2022): 4494. http://dx.doi.org/10.3390/math10234494.
Full textAbstract:
Cloud platforms provide a low-cost and convenient way for users to share data. One important issue of cloud-based data sharing systems is how to prevent the sensitive information contained in users’ data from being disclosed. Existing studies often utilize cryptographic primitives, such as attribute-based encryption and proxy re-encryption, to protect data privacy. These approaches generally rely on a centralized server which may cause a single point of failure problem. Blockchain is known for its ability to solve such a problem. Some blockchain-based approaches have been proposed to realize privacy-preserving data sharing. However, these approaches did not fully explore the auditability provided by the blockchain. The dishonest cloud server can share data with a requester without notifying the data owner or being logged by the blockchain. In this paper, we propose a blockchain-based privacy-preserving data sharing system with enhanced auditability. The proposed system follows the idea of hybrid encryption to protect data privacy. The data to be shared are encrypted with a symmetric key, and the symmetric key is encrypted with a joint public key which is the sum of multiple blockchain nodes’ public keys. Only if a data requester is authorized, the blockchain nodes will be triggered to execute a verifiable key switch protocol. By using the output of the protocol, the data requester can get the plaintext of the symmetric key. The blockchain nodes participate in both the authorization process and the key switch process, which means the behavior of the data requester is witnessed by multi-parties and is auditable. We implement the proposed system on Hyperledger Fabric. The simulation results show that the performance overhead is acceptable.
43
Liu, Fukang, Mohammad Mahzoun, Morten Øygarden, and Willi Meier. "Algebraic Attacks on RAIN and AIM Using Equivalent Representations." IACR Transactions on Symmetric Cryptology 2023, no. 4 (December 8, 2023): 166–86. http://dx.doi.org/10.46586/tosc.v2023.i4.166-186.
Full textAbstract:
Designing novel symmetric-key primitives for advanced protocols like secure multiparty computation (MPC), fully homomorphic encryption (FHE) and zero-knowledge proof systems (ZK), has been an important research topic in recent years. Many such existing primitives adopt quite different design strategies from conventional block ciphers. Notable features include that many of these ciphers are defined over a large finite field, and that a power map is commonly used to construct the nonlinear component due to its efficiency in these applications as well as its strong resistance against the differential and linear cryptanalysis. In this paper, we target the MPC-friendly ciphers AIM and RAIN used for the post-quantum signature schemes AIMer (CCS 2023 and NIST PQC Round 1 Additional Signatures) and Rainier (CCS 2022), respectively. Specifically, we can find equivalent representations of 2-round RAIN and full-round AIM, respectively, which make them vulnerable to either the polynomial method, or the crossbred algorithm, or the fast exhaustive search attack. Consequently, we can break 2-round RAIN with the 128/192/256-bit key in only 2111/2170/2225 bit operations. For full-round AIM with the 128/192/256-bit key, we could break them in 2136.2/2200.7/2265 bit operations, which are equivalent to about 2115/2178/2241 calls of the underlying primitives. In particular, our analysis indicates that AIM does not reach the required security levels by the NIST competition.
44
Tomecek, Jozef. "Hardware optimizations of stream cipher rabbit." Tatra Mountains Mathematical Publications 50, no. 1 (December 1, 2011): 87–101. http://dx.doi.org/10.2478/v10127-011-0039-8.
Full textAbstract:
ABSTRACT Stream ciphers form part of cryptographic primitives focused on privacy. Synchronous, symmetric and software-oriented stream cipher Rabbit is member of final portfolio of European Union's eStream project. Although it was designed to perform well in software, employed operations seem to compute efficiently in hardware. 128-bit security, with no known security weaknesses is claimed by Rabbit's designers. Since hardware performance of Rabbit was only estimated in the proposal of algorithm, comparison of direct and optimized FPGA implementations of Rabbit stream cipher is presented, identifying algorithm bottlenecks, discussing optimization techniques applied to algorithm computations, along with key area/time trade-offs.
45
Teh, Tat-How, Chunchun Liu, Julian Wright, and Junjie Zhou. "Multihoming and Oligopolistic Platform Competition." American Economic Journal: Microeconomics 15, no. 4 (November 1, 2023): 68–113. http://dx.doi.org/10.1257/mic.20210324.
Full textAbstract:
We provide a general framework to analyze competition between any number of symmetric two-sided transaction platforms, in which buyers and sellers can multihome. We show how key primitives such as the number of platforms, the fraction of buyers that find multihoming costly, the value of transactions, and the degree of user heterogeneity jointly determine the level and structure of platform fees. Even though platform entry always reduces the total fee level, whether it shifts the fee structure in favor of buyers or sellers depends on whether most of the buyers are singlehoming or multihoming. (JEL D43, L11, L13, L40)
46
Mansoor, Khwaja, Anwar Ghani, Shehzad Chaudhry, Shahaboddin Shamshirband, Shahbaz Ghayyur, and Amir Mosavi. "Securing IoT-Based RFID Systems: A Robust Authentication Protocol Using Symmetric Cryptography." Sensors 19, no. 21 (November 1, 2019): 4752. http://dx.doi.org/10.3390/s19214752.
Full textAbstract:
Despite the many conveniences of Radio Frequency Identification (RFID) systems, the underlying open architecture for communication between the RFID devices may lead to various security threats. Recently, many solutions were proposed to secure RFID systems and many such systems are based on only lightweight primitives, including symmetric encryption, hash functions, and exclusive OR operation. Many solutions based on only lightweight primitives were proved insecure, whereas, due to resource-constrained nature of RFID devices, the public key-based cryptographic solutions are unenviable for RFID systems. Very recently, Gope and Hwang proposed an authentication protocol for RFID systems based on only lightweight primitives and claimed their protocol can withstand all known attacks. However, as per the analysis in this article, their protocol is infeasible and is vulnerable to collision, denial-of-service (DoS), and stolen verifier attacks. This article then presents an improved realistic and lightweight authentication protocol to ensure protection against known attacks. The security of the proposed protocol is formally analyzed using Burrows Abadi-Needham (BAN) logic and under the attack model of automated security verification tool ProVerif. Moreover, the security features are also well analyzed, although informally. The proposed protocol outperforms the competing protocols in terms of security.
47
Kuznetsov, О. О., Yu I. Горбенко, М. О. Poluyanenko, S. O. Kandiy, and E. D. Matveeva. "Properties of the cost function in the iterative algorithm for generating nonlinear substitution." Radiotekhnika, no. 209 (June 24, 2022): 16–28. http://dx.doi.org/10.30837/rt.2022.2.209.02.
Full textAbstract:
To ensure the security of information technology, cryptographic information protection tools are used, in particular block and stream encryption algorithms with a symmetric key. Reliability and cryptographic strength of cryptoalgorithms is provided by the properties of the applied primitives. For example, non-linear substitutions (S-boxes) are used as the main component of modern symmetric ciphers. Therefore, generation of substitutions is an important scientific task directly related to the security of information technology and improvement of modern symmetric ciphers. The paper investigates the properties of iterative algorithms for generating non-linear substitutions and special cost functions, which play a decisive role in the heuristic search for S-boxes with the required properties. We consider the cost function of the WCF (Cost Function of the content of the Walsh-Hadamard spectrum) and optimize its parameters. The obtained optimization results in combination with the Hill Climbing iterative search algorithm can reduce significantly the number of iterations. In particular, we show that for a substitution search with a non-linearity of 104, on average, we reduce the computational complexity of generation by more than 20%. In addition, it is possible to increase the success rate of the heuristic search. In particular, for the selected settings, in 100% of cases, a beaktive S-box with a non-linearity of 104 was found.
48
Ponomar, Volodymyr, and Viktor Onoprienko. "Analysis of the possibility of using modern packages of computer algebra in the synthesis of crypto-primitives." Physico-mathematical modelling and informational technologies, no. 33 (September 4, 2021): 128–32. http://dx.doi.org/10.15407/fmmit2021.33.128.
Full textAbstract:
The paper deals with systems of computer algebra - software for symbolic calculations, which allows to conduct the entire cycle of development of a mathematical model. The paper presents the results of the analysis of systems of computer algebra with specialized purpose Magma, evaluation of the possibility of its use for modulation of processes in symmetric and asymmetric cryptographic systems, as well as recommendations for their further improvement. Magma functionality is also analyzed for evaluation of possibility to model and study promising candidates for the post-quantum standard of electronic signature algorithms, asymmetric encryption and key encapsulation, including algorithms based on cryptographic transformations in the lattice-based, the use of hash trees, mathematical codes that are undergoing research during the NIST PQC competition, as well as the draft standard "Vershina 1".
49
Liu, Guoxiao, Keting Jia, Puwen Wei, and Lei Ju. "High-Performance Hardware Implementation of MPCitH and Picnic3." IACR Transactions on Cryptographic Hardware and Embedded Systems 2024, no. 2 (March 12, 2024): 190–214. http://dx.doi.org/10.46586/tches.v2024.i2.190-214.
Full textAbstract:
Picnic is a post-quantum digital signature, the security of which relies solely on symmetric-key primitives such as block ciphers and hash functions instead of number theoretic assumptions. One of the main concerns of Picnic is the large signature size. Although Katz et al.’s protocol (MPCitH-PP) significantly reduces the size of Picnic, the involvement of more parties in MPCitH-PP leads to longer signing/verification times and more hardware resources. This poses new challenges for implementing high-performance Picnic on resource-constrained FPGAs. So far as we know, current works on the hardware implementation of MPCitH-based signatures are compatible with 3 parties only. In this work, we investigate the optimization of the implementation of MPCitH-PP and successfully deploying MPCitH-PP with more than three parties on resource-constrained FPGAs, e.g., Xilinx Artix-7 and Kintex-7, for the first time. In particular, we propose a series of optimizations, which include pipelining and parallel optimization for MPCitH-PP and the optimization of the underlying symmetric primitives. Besides, we make a slight modification to the computation of the offline commitment, which can further reduce the number of computations of Keccak. These optimizations significantly improve the hardware performance of Picnic3. Signing messages on our FPGA takes 0.047 ms for the L1 security level, outperforming Picnic1 with hardware by a factor of about 5.3, which is the fastest implementation of post-quantum signatures as far as we know. Our FPGA implementation for the L5 security level takes 0.146 ms beating Picnic1 by a factor of 8.5, and outperforming Sphincs by a factor of 17.3.
50
Xu, Wanshan, Jianbiao Zhang, Yilin Yuan, Xiao Wang, Yanhui Liu, and Muhammad Irfan Khalid. "Towards efficient verifiable multi-keyword search over encrypted data based on blockchain." PeerJ Computer Science 8 (March 21, 2022): e930. http://dx.doi.org/10.7717/peerj-cs.930.
Full textAbstract:
Searchable symmetric encryption (SSE) provides an effective way to search encrypted data stored on untrusted servers. When the server is not trusted, it is indispensable to verify the results returned by it. However, the existing SSE schemes either lack fairness in the verification of search results, or do not support the verification of multiple keywords. To address this, we designed a multi-keyword verifiable searchable symmetric encryption scheme based on blockchain, which provides an efficient multi-keyword search and fair verification of search results. We utilized bitmap to build a search index in order to improve search efficiency, and used blockchain to ensure fair verification of search results. The bitmap and hash function are combined to realize lightweight multi-keyword search result verification, compared with the existing verification schemes using public key cryptography primitives, our scheme reduces the verification time and improves the verification efficiency. In addition, our scheme supports the dynamic update of files and realizes the forward security in update. Finally, formal security analysis proves that our scheme is secure against Chosen-Keyword Attacks (CKA), experimental analysis demonstrations that our scheme is efficient and viable in practice.