Previous Issue

Table of Contents

Cryptography, Volume 3, Issue 1 (March 2019)

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Readerexternal link to open them.
View options order results:
result details:
Displaying articles 1-7
Export citation of selected articles as:
Open AccessArticle Automating Privacy Compliance Using Policy Integrated Blockchain
Received: 1 December 2018 / Revised: 31 January 2019 / Accepted: 31 January 2019 / Published: 5 February 2019
Viewed by 232 | PDF Full-text (1979 KB)
Abstract
An essential requirement of any information management system is to protect data and resources against breach or improper modifications, while at the same time ensuring data access to legitimate users. Systems handling personal data are mandated to track its flow to comply with [...] Read more.
An essential requirement of any information management system is to protect data and resources against breach or improper modifications, while at the same time ensuring data access to legitimate users. Systems handling personal data are mandated to track its flow to comply with data protection regulations. We have built a novel framework that integrates semantically rich data privacy knowledge graph with Hyperledger Fabric blockchain technology, to develop an automated access-control and audit mechanism that enforces users' data privacy policies while sharing their data with third parties. Our blockchain based data-sharing solution addresses two of the most critical challenges: transaction verification and permissioned data obfuscation. Our solution ensures accountability for data sharing in the cloud by incorporating a secure and efficient system for End-to-End provenance. In this paper, we describe this framework along with the comprehensive semantically rich knowledge graph that we have developed to capture rules embedded in data privacy policy documents. Our framework can be used by organizations to automate compliance of their Cloud datasets. Full article
(This article belongs to the Special Issue Advances of Blockchain Technology and Its Applications)
Open AccessArticle A Novel Algorithm of Constructing Highly Nonlinear S-p-boxes
Received: 16 December 2018 / Revised: 3 January 2019 / Accepted: 9 January 2019 / Published: 16 January 2019
Viewed by 304 | PDF Full-text (2005 KB) | HTML Full-text | XML Full-text
Abstract
The role of substitution boxes is very important in block ciphers. Substitution boxes are utilized to create confusion in the cryptosystem. However, to create both confusion and diffusion in any cryptosystem p-boxes and chaos base substitution boxes are designed. In this work, a [...] Read more.
The role of substitution boxes is very important in block ciphers. Substitution boxes are utilized to create confusion in the cryptosystem. However, to create both confusion and diffusion in any cryptosystem p-boxes and chaos base substitution boxes are designed. In this work, a simple method is presented that serves both ways. This method is based on composition of the action of symmetric group on Galois field and inversion map. This construction method provides a large number of highly non-linear substitution permutation boxes having the property of confusion as well as diffusion. These substitution permutation boxes have all the cryptography properties. Their utilization in the image encryption application is measured by majority logic criterion. We named these newly designed substitution boxes (S-boxes) as substitution permutation boxes (S-p-boxes), because they serve as both substitution boxes (S-boxes) as well as permutation boxes (p-boxes). Full article
(This article belongs to the Section Hardware Security)
Figures

Figure 1

Open AccessEditorial Acknowledgement to Reviewers of Cryptography in 2018
Published: 12 January 2019
Viewed by 347 | PDF Full-text (189 KB) | HTML Full-text | XML Full-text
Abstract
Rigorous peer-review is the corner-stone of high-quality academic publishing [...] Full article
Open AccessArticle Cryptanalysis of Round-Reduced Fantomas, Robin and iSCREAM
Received: 9 December 2018 / Revised: 31 December 2018 / Accepted: 7 January 2019 / Published: 10 January 2019
Viewed by 288 | PDF Full-text (299 KB) | HTML Full-text | XML Full-text
Abstract
In this work, we focus on LS-design ciphers Fantomas, Robin, and iSCREAM. LS-designs are a family of bitslice ciphers aimed at efficient masked implementations against side-channel analysis. We have analyzed Fantomas and Robin with a technique that previously has not been applied to [...] Read more.
In this work, we focus on LS-design ciphers Fantomas, Robin, and iSCREAM. LS-designs are a family of bitslice ciphers aimed at efficient masked implementations against side-channel analysis. We have analyzed Fantomas and Robin with a technique that previously has not been applied to both algorithms or linear cryptanalysis. The idea behind linear cryptanalysis is to build a linear characteristic that describes the relation between plaintext and ciphertext bits. Such a relationship should hold with probability 0.5 (bias is zero) for a secure cipher. Therefore, we try to find a linear characteristic between plaintext and ciphertext where bias is not equal to zero. This non-random behavior of cipher could be converted to some key-recovery attack. For Fantomas and Robin, we find 5 and 7-round linear characteristics. Using these characteristics, we attack both the ciphers with reduced rounds and recover the key for the same number of rounds. We also apply linear cryptanalysis to the famous CAESAR candidate iSCREAM and the closely related LS-design Robin. For iScream, we apply linear cryptanalysis to the round-reduced cipher and find a 7-round best linear characteristics. Based on those linear characteristics we extend the path in the related-key scenario for a higher number of rounds. Full article
(This article belongs to the Special Issue Authenticated Encryption)
Figures

Figure 1

Open AccessArticle Applications of Blockchain Technology in Medicine and Healthcare: Challenges and Future Perspectives
Received: 6 November 2018 / Revised: 14 December 2018 / Accepted: 26 December 2018 / Published: 2 January 2019
Viewed by 669 | PDF Full-text (883 KB) | HTML Full-text | XML Full-text
Abstract
Blockchain technology has gained considerable attention, with an escalating interest in a plethora of numerous applications, ranging from data management, financial services, cyber security, IoT, and food science to healthcare industry and brain research. There has been a remarkable interest witnessed in utilizing [...] Read more.
Blockchain technology has gained considerable attention, with an escalating interest in a plethora of numerous applications, ranging from data management, financial services, cyber security, IoT, and food science to healthcare industry and brain research. There has been a remarkable interest witnessed in utilizing applications of blockchain for the delivery of safe and secure healthcare data management. Also, blockchain is reforming the traditional healthcare practices to a more reliable means, in terms of effective diagnosis and treatment through safe and secure data sharing. In the future, blockchain could be a technology that may potentially help in personalized, authentic, and secure healthcare by merging the entire real-time clinical data of a patient’s health and presenting it in an up-to-date secure healthcare setup. In this paper, we review both the existing and latest developments in the field of healthcare by implementing blockchain as a model. We also discuss the applications of blockchain, along with the challenges faced and future perspectives. Full article
(This article belongs to the Special Issue Advances of Blockchain Technology and Its Applications)
Figures

Figure 1

Open AccessArticle New Cryptanalytic Attack on RSA Modulus N = pq Using Small Prime Difference Method
Received: 1 November 2018 / Revised: 14 December 2018 / Accepted: 15 December 2018 / Published: 20 December 2018
Viewed by 453 | PDF Full-text (877 KB) | HTML Full-text | XML Full-text
Abstract
This paper presents new short decryption exponent attacks on RSA, which successfully leads to the factorization of RSA modulus N=pq in polynomial time. The paper has two parts. In the first part, we report the usage of the small prime [...] Read more.
This paper presents new short decryption exponent attacks on RSA, which successfully leads to the factorization of RSA modulus N = p q in polynomial time. The paper has two parts. In the first part, we report the usage of the small prime difference method of the form | b 2 p a 2 q | < N γ where the ratio of q p is close to b 2 a 2 , which yields a bound d < 3 2 N 3 4 γ from the convergents of the continued fraction expansion of e N a 2 + b 2 a b N + 1 . The second part of the paper reports four cryptanalytic attacks on t instances of RSA moduli N s = p s q s for s = 1 , 2 , , t where we use N a 2 + b 2 a b N + 1 as an approximation of ϕ ( N ) satisfying generalized key equations of the shape e s d k s ϕ ( N s ) = 1 , e s d s k ϕ ( N s ) = 1 , e s d k s ϕ ( N s ) = z s , and e s d s k ϕ ( N s ) = z s for unknown positive integers d , k s , d s , k s , and z s , where we establish that t RSA moduli can be simultaneously factored in polynomial time using combinations of simultaneous Diophantine approximations and lattice basis reduction methods. In all the reported attacks, we have found an improved short secret exponent bound, which is considered to be better than some bounds as reported in the literature. Full article
Open AccessArticle Further Observations on SIMON and SPECK Block Cipher Families
Received: 7 November 2018 / Revised: 15 December 2018 / Accepted: 18 December 2018 / Published: 20 December 2018
Viewed by 359 | PDF Full-text (359 KB) | HTML Full-text | XML Full-text
Abstract
SIMON and SPECK families of block ciphers are well-known lightweight ciphers designed by the NSA. In this note, based on the previous investigations on SIMON, a closed formula for the squared correlations and differential probabilities of the mapping ϕ(x)= [...] Read more.
SIMON and SPECK families of block ciphers are well-known lightweight ciphers designed by the NSA. In this note, based on the previous investigations on SIMON, a closed formula for the squared correlations and differential probabilities of the mapping ϕ ( x ) = x S 1 ( x ) on F 2 n is given. From the aspects of linear and differential cryptanalysis, this mapping is equivalent to the core quadratic mapping of SIMON via rearrangement of coordinates and EA -equivalence. Based on the proposed explicit formula, a full description of DDT and LAT of ϕ is provided. In the case of SPECK, as the only nonlinear operation in this family of ciphers is addition mod 2 n , after reformulating the formula for linear and differential probabilities of addition mod 2 n , straightforward algorithms for finding the output masks with maximum squared correlation, given the input masks, as well as the output differences with maximum differential probability, given the input differences, are presented. By the aid of the tools given in this paper, the process of the search for linear and differential characteristics of SIMON and SPECK families of block ciphers could be sped up, and the complexity of linear and differential attacks against these ciphers could be reduced. Full article
Figures

Figure 1

Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top