Journal of Cryptologic Research
 
Citation Search Quick Search DOI Advanced
  Author Center
   » Submission Online
   » Instruction for Authors
   » Template
   » Copyright Agreement
  Peer Review
   » Peer Review
   » Our peer-review policy
Journal Online
   » Accepted
   » In Press
   » Current Issue
   » Earlier Issues
   » View by Fields
   » Top Downloaded
   » RSS
 

2017, 4(4)
HighLights More»   
· Tight Reduction in Functional Encryptions——CHEN J, GONG J Q
· Efficient,Verifiable and Secure Outsourcing of Matrix Multiplication——YANG B, WU D D, LAI Q Q
· Related-key Differential Attack on Lightweight Block Cipher \uppercase{ESF}——YIN Jun, SONG Jian, ZENG Guang, MA Chuan-Gui
· Lightweight Hash Function LHash Fast Software Implementation——LANG Huan, ZHANG Lei, WU Wen-Ling
· A Secure Mutual Authentication Protocol Based on SRAM PUF——LIU D, GUO L M, YU J, WANG L H, SHAN W J
Current Issue Accepted Earlier Issues Top Read Top Downloaded Top Cited
  Journal of Cryptologic Research--2017, 4 (4)   Published: 06 September 2017
Select | Export to EndNote
Tight Reduction in Functional Encryptions Hot!
CHEN J, GONG J Q
Journal of Cryptologic Research. 2017, 4 (4): 307-321. ;  doi: 10.13868/j.cnki.jcr.000184
Full Text: HTML (1 KB)  PDF (2330 KB)  ( 0 )
Show Abstract ( 71 )
 Functional encryptions are much more expressive than traditional public key encryption and gradually become one of core techniques underlying future network security. With the introduction and development of lattice-based techniques and multi-linear maps, it is possible to give concrete constructions for a large class of functional encryptions. Therefore, it has become a hot topic to search for better solutions including the problem of investigating tightly secure functional encryptions. When proving the security of a certain functional encryption, it needs to construct a reduction algorithm that can solve some computational problem via invoking an attacker against the target functional encryption system. Typically, the success probability of the reduction algorithm is smaller than that of the attacker. We call the gap between them the loss of reduction. A tightly secure functional encryption has small loss of reduction when proving its security. A tight reduction not only means a better theoretical result, but also has positive impact on the implementation of the scheme. As the most fundamental type of functional encryptions, \textrm{id}entity-based encryptions with tight reduction have appeared; however when we are talking about more complex functional encryptions (such as attribute-based encryptions, inner-product encryptions), current techniques fail to lead to an acceptable result. This paper focuses on the technique behind tightly secure \textrm{id}entity-based encryptions, and discusses main drawbacks of current tightly secure functional encryptions for complex functionality. Finally, it is shown how the progresses on tight reduction made in the field of functional encryptions affect other cryptography fields.
Efficient,Verifiable and Secure Outsourcing of Matrix Multiplication Hot!
YANG B, WU D D, LAI Q Q
Journal of Cryptologic Research. 2017, 4 (4): 322-332. ;  doi: 10.13868/j.cnki.jcr.000185
Full Text: HTML (1 KB)  PDF (1314 KB)  ( 72 )
Show Abstract ( 48 )
Cloud outsourcing has been a hot spot in recent years and researchers pay much attention to complex problems in scientific computing via cloud outsourcing. In the field of scientific computing, efficient outsourcing of matrix computation is a very significant direction of research under the background of cloud computing and big data. It is known that the outsourcing of matrix computation cannot achieve all computing of matrices, especially for the computation of non-square matrices. Without leakage of user' s information, how to design a high efficient verifiably outsourcing protocol of matrix computation is an important research problem. In this paper, we first divide bigger matrices by the method of compensation and segmentation in geometry and combining permutation function and a blind technique of the invertible matrix multiplication to design an efficient outsourcing computing protocol of matrix multiplication verifiably and safely. Then, we give analysis and proof of the correctness, rationality, privacy, verifiability and efficiency of the new protocol of matrix multiplication, especially analyze and prove the new verifiable way about our protocol. Finally, we compare with protocols of matrix multiplication in recent years. We use the rational blind technology to design our protocol of matrix outsourcing. In addition, our protocol does not need any cryptographic assumption, and satisfies outsourcing computing of arbitrary matrix multiplication.
Related-key Differential Attack on Lightweight Block Cipher \uppercase{ESF} Hot!
YIN Jun, SONG Jian, ZENG Guang, MA Chuan-Gui
Journal of Cryptologic Research. 2017, 4 (4): 333-344. ;  doi: 10.13868/j.cnki.jcr.000186
Full Text: HTML (1 KB)  PDF (2109 KB)  ( 263 )
Show Abstract ( 111 )
 Differential cryptanalysis is one of the most effective attack methods on block ciphers, where finding a good differential characteristic with high probability is the first step. Matusi's branch-and-bound search algorithm is the first classic method for finding the differential characteristic, which can find a security bound with respect to differential attack. Additionally, computing the minimum number of active S-boxes is another way to evaluate the resistance of a block cipher against the differential attack. In 2011, Mouha {\it et al.} converted into the problem of counting the minimum number of differentially active S-boxes into an MILP problem. This method applies in many word-oriented block ciphers. At Asiacrypt 2014, Sun {\it et al} extended Mouha {\it et al's} method, and presented methods for counting the minimum number of differentially active S-boxes of bit-oriented block ciphers both in the single-key and related-key models. This paper is based on Sun {\it et al's} automatic method for finding high probability related-key differentials of block ciphers. Based on the design features of the lightweight block cipher ESF, it is possible to establish the MILP model under related key, hence can find the best of 10-round and 11-round differential characteristics, whose probabilities are ${{2}^{-16}}$ and ${{2}^{-20}}$, respectively. Finally, based on the differential characteristics, this paper extends the corresponding related-key differential distinguisher to 2 rounds backward, and proposes an attack on the 13-round ESF with data complexity of ${{2}^{47}}$ plaintexts, and time complexity of about ${{2}^{66}}$ encryptions.
Lightweight Hash Function LHash Fast Software Implementation Hot!
LANG Huan, ZHANG Lei, WU Wen-Ling
Journal of Cryptologic Research. 2017, 4 (4): 345-359. ;  doi: 10.13868/j.cnki.jcr.000187
Full Text: HTML (1 KB)  PDF (22838 KB)  ( 80 )
Show Abstract ( 36 )
Lightweight cryptographic algorithm is suitable for Internet of Things (IoT) and other resource-constrained environments. With the popularization of IoT applications, the data collected by IoT devices is handled by lightweight cryptographic algorithms and then aggregated into the cloud, and high-performance computers in the cloud are required to decrypt the encrypted data fast. Therefore, fast software implementation technology of lightweight cryptographic algorithms has become an important research topic. LHash is a low-power lightweight hash function with flexible and adjustable parameters, the designers recommended 4 sizes. This paper investigates the software optimized implementation of LHash. Using SSE instruction and nibble-slice technique, we present software optimization implementation of LHash, which has a significant advantage over current software implementations based on look-up tables. For the 4 recommended sizes of LHash, on the Intel Core i7-2600 processor, the software performance is improved 21.85%, 21.85%, 32.03%, and 33.33% respectively with SSE, and 2.74, 2.74, 3.02, 3.16 times respectively with nibble-slice technique, both compared to implementation based on look-up tables. There is no look-up table in memory or cache in the software implementation of LHash with SSE instruction and nibble-slice technique. Therefore, our software implementation can resist side channel attacks such as cache timing attacks. Similarly, the method used in this paper can also be applied to the lightweight block cipher LED.
A Secure Mutual Authentication Protocol Based on SRAM PUF Hot!
LIU D, GUO L M, YU J, WANG L H, SHAN W J
Journal of Cryptologic Research. 2017, 4 (4): 360-371. ;  doi: 10.13868/j.cnki.jcr.000188
Full Text: HTML (1 KB)  PDF (11607 KB)  ( 114 )
Show Abstract ( 39 )
In the era of the Internet of Things (IoT), billions of devices will be connected over the Internet. While it provides convenience to access these devices, these devices with limited resource are exposed to malicious adversaries. In order to defend against attacks, data encryption and access control techniques are essential countermeasures. Key storage and authentication are critical to security of the IoT devices. Physical Unclonable Function (PUF) is a kind of hardware security component based on the uncontrollable random variants during manufacture. Every PUF response is unique and unclonable physically. The common applications of PUF are key storage and authentication. SRAM PUF is a kind of PUF which uses the initial value of ubiquitous SRAM after powered up as PUF response. Because of the manufacturing variants, the balanced transistors designed in one cell cannot be made identical in another. There are some subtle differences between them. So the initial value after powered up may not be equal. Additionally, the random noise of environment can cause the initial value of one SRAM to be different. There is some randomness between these values. Most mutual authentication protocols used widely are fragile to side channel analysis because the symmetric key of a block cipher to operate on random is a fixed value. This paper presents an enhanced mutual authentication protocol based on SRAM PUF which generates a random key of block cipher used in the common protocol. Side channel analysis will be infeasible on a random symmetric key. Significant improvement on protocol security is present with only a little extra resource. So the new protocol is suitable for lightweight devices with limited resources.
Analysis of Lightweight 44 MDS Matrices over GL(4, F2) Hot!
CAI C L, TANG C M, YU Y Y, GAO L, LAI Y
Journal of Cryptologic Research. 2017, 4 (4): 372-383. ;  doi: 10.13868/j.cnki.jcr.000189
Full Text: HTML (1 KB)  PDF (1362 KB)  ( 70 )
Show Abstract ( 49 )
MDS 矩阵广泛地应用于密码设计中, 其中构造轻量级 MDS 矩阵成为越来越多研究者的关注热点.
     首先, 本文通过分析 $\textrm{GL}(4, F_{2})$ 上 $4\times4$ 轻量级 MDS 矩阵的结构特点, 给出 MDS 矩阵的搜索算法和设置初始搜索条件为所有满足 Rank$(A)=m$, Rank$(A+I)=m$ 且 $\# A=1$的矩阵$A$.
     运用 Magma 软件, 得到类型$L1, L2, L3$ 在 $\textrm{GL}(m, F_{2})$ 上互相不等价且异或数等于 10 的$4\times4$ MDS 矩阵的个数分别为24,24,12 $(m=4)$, 80640,80640,0 $(m=8)$.
     接着, 我们通过对比分析$\textrm{GL}(4, F_{2})$ 上异或数等于10的60个 MDS 矩阵的构成矩阵, 指出虽然类型1与类型2的结构不同且相应的 MDS 矩阵都互相不等价, 但类型1的24 个构成矩阵 $A$、$B$、$X$都分别与类型2的24 个构成矩阵$A$、$B$、$X$ 一一对应相同, 并详细地总结了3 种类型间对应的异同点.
     其次, 我们对满足搜索条件的矩阵 $A$ 进行分类并研究矩阵 $A$ 的逆、转置、平方等形式在$\textrm{GL}(4, F_{2})$ 上的异或数和性质. 运用这些性质, 可以简洁明了地说明类型1 与类型2的构成矩阵存在一一对应相同关系以及两种类型2 得到的 MDS 矩阵是等价关系的原因.
     最后, 本文把在 $\textrm{GL}(4, F_{2})$ 上分析矩阵性质的方法推广到 $\textrm{GL}(8, F_{2})$ 上, 该方法不仅可以排除大量不满足要求的矩阵, 而且对设计和搜索 $\textrm{GL}(8, F_{2})$ 上的轻量级 MDS 矩阵都起着重要的作用.
Horizontal Analysis and its Extended Methods Used for Single Trace Side-channel Attack Hot!
ZHANG Y W, WANG Y J, TANG Y, ZHANG L L
Journal of Cryptologic Research. 2017, 4 (4): 384-391. ;  doi: 10.13868/j.cnki.jcr.000190
Full Text: HTML (1 KB)  PDF (18574 KB)  ( 30 )
Show Abstract ( 31 )
Side-channel analysis techniques targeting at the hardware implementation of cryptographic algorithms could uncover the secret information using recorded traces of power consumption or electromagnetic radiation when the chip is executing cryptographic operations. Many attacking methods, such as differential power analysis, correlation power analysis and mutual information analysis, should carry out statistical treatments on many power traces. It is possible to match successfully with just one trace during the attack phase in template attack. However, in the phase of template-building, an adversary needs a large number of traces to build the templates. All the above attacks can be referred to as vertical analysis. For modular exponentiation operation in the public key cryptosystems, one can use different portions of single trace to conduct the horizontal correlation analysis and recovers all bits of the exponent. The kind of attack would pose a relatively larger threat. The horizontal correlation analysis involves statistical treatments, which is different from simple power analysis, and it could apply to protected implementation of modular exponentiation. Clevier presented a practical example of horizontal correlation analysis. It attacked a software implementation of Square-and-Multiply modular exponentiation, extracted power segments from single power trace of RSA known-message encryption and showed how to decide the bit value of exponent. For popular secure algorithms of modular exponentiation, Square-and-Multiply Always Algorithm and Montgomery Ladder Algorithm, this paper explores the evolution process of these algorithms for different operands and shows how to launch the horizontal correlation analysis. This paper also gives the results of verification experiments under the implementation of hardware VLSI circuit and with just one electromagnetic radiation trace, obtains the significant correlation results for these modular exponentiation algorithms. Our study is an effective illustration and provides the basic idea of extending the horizontal correlation analysis to the implementations of other asymmetric cryptographic algorithms with countermeasures.
An Efficient Identity-based Ring Signature Scheme over a Lattice Hot!
JIA X Y, HE D B, XU Z Y, LIU Q
Journal of Cryptologic Research. 2017, 4 (4): 392-404. ;  doi: 10.13868/j.cnki.jcr.000191
Full Text: HTML (1 KB)  PDF (1576 KB)  ( 115 )
Show Abstract ( 46 )
Ring signatures have important applications in scenarios such as e-voting, e-money and whistle blowing due to their fully anonymity and unforgeability. Identity-based ring signature is a merge of identity-based public key cryptography and ring signature technique. It is anonymous , unforgeable, and avoids the management of users' certificates. Traditional construction of identity-based ring signature schemes is mostly based on bilinear pairings. However, the development of quantum computing technique brings new challenge to cryptography. Many traditional cryptographic assumptions do not hold any more under quantum circumstances. As a candidate of quantum-resistant public key cryptosystem, latticed-based cryptography has attracted a lot of attention in recent years. In this paper, we propose an identity-based ring signature scheme over a lattice. We present the formal definition of the security model of identity-based ring signature schemes, and proposed an identity-based ring signature from lattice. We prove the fully anonymity and unforgeability of the proposed scheme in the random oracle model. The unforgeability of the scheme is based on the small integer solution (SIS) problem. As far as we know, there is little study on identity-based ring signatures over lattices and existing solutions are not suitable for practical applications. By employing the technique of lattice basis delegation without expanding the dimension of lattice, as well as the technique of rejection samplings, our scheme has higher computation performance, lower communication and memory cost, which is more practical compared with other existing schemes.
The Universally Composable Framework of Cryptographic Service#br# APIs Hot!
XU K Y, YUAN Q J, TAN L, LU S Q
Journal of Cryptologic Research. 2017, 4 (4): 405-412. ;  doi: 10.13868/j.cnki.jcr.000192
Full Text: HTML (1 KB)  PDF (2138 KB)  ( 65 )
Show Abstract ( 29 )
Cryptographic service APIs is the interface that providing cryptographic service for other information systems such as Key agreement, encryption and authentication. Aimed at API’s design defects, attackers can bypass the system’s security policies or call interfaces illegally, so as to deceive the cryptographic service system to obtain the keys or resources in the system. This paper studies the security proof of password service API function application problems, proposes a universally composable framework of cryptographic service APIs, aiming to verify the security of cryptographic service APIs by formal analysis method. Under the framework of universally combinable security framework, added support for the cryptographic service APIs’ global status recording, reading and operation, a universally combinable framework for cryptographic service APIs is proposed. This paper describs a formal description of the cryptographic service APIs' implementation under the ideal model, the realistic model and the mixed model, and proves that it is feasible to validate the complex API security based on the API basic function under the universally composable framework of cryptographic service APIs.
Journal of Cryptologic Research
Accepts
Note: The papers published below will continue to be available from this page until they are assigned to an issue. To see an article, click its [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Selected articles' button. To see one abstract at a time, click its [Abstract] link.
Journal of Cryptologic Research
2017 Vol.4      No.1      No.2      No.3
2016 Vol.3      No.1      No.2      No.3      No.4      No.5      No.6
2015 Vol.2      No.1      No.2      No.3      No.4      No.5      No.6
2014 Vol.1      No.1      No.2      No.3      No.4      No.5      No.6
密码学报
 Top Read
»

Bitcoin and Digital Fiat Currency

QIN B, CHEN L C H, WU Q H, ZHANG Y F, ZHONG L, ZHENG H B
2017, 4(2): 186-186. Full Text: PDF (1282KB) (1342)
»

The Design of an Anti-Counterfeiting System Based on Blockchain

AN R, HE D B, ZHANG Y R, LI L
2017, 4(2): 208-208. Full Text: PDF (2475KB) (1164)
»

New Construction of Lattice-based Programmable Hash Function

ZHANG J
2016, 3(5): 432-432. Full Text: PDF (579KB) (685)
»

Design and Analysis of Stream Ciphers: Past, Present and Future Directions

ZHANG B, XU C, FENG D G
2016, 3(6): 545-545. Full Text: PDF (1123KB) (995)
»

A Survey on the Intersection of Cryptography and Game Theory

PENG C G, TIAN Y L, LIU H, DING H F
2017, 4(1): 15-15. Full Text: PDF (706KB) (794)
»

2017, 4(2): 0-0. Full Text: PDF (186KB) (442)
»

Debug and Analysis on Fully Homomorphic Cryptography

LU S Q, WANG S F, HAN X, CHENG Q F
2017, 4(1): 28-28. Full Text: PDF (2322KB) (644)
»

Estimating Concert Security Parameters of Fully Homomorphic Encryption

CHEN Z G, SHI Y F, SONG X X
2016, 3(5): 491-491. Full Text: PDF (575KB) (621)
»

A Privacy Preserving Fair Contract Signing Protocol based on Block Chains

TIAN H B, HE J J, FU L Q
2017, 4(2): 198-198. Full Text: PDF (883KB) (888)
»

One-time Signature Scheme Based on Dynamic Chameleon Authentication Tree

WANG H W, XU J, NI P, ZHOU F C
2016, 3(6): 618-618. Full Text: PDF (496KB) (415)
»

Chosen Plaintext Attacks on CRT-RSA

LI Z J, PENG Q, SHI R H, LI C, MA Z P, LI H B
2016, 3(5): 461-461. Full Text: PDF (5078KB) (716)
»

An Improved Algorithm of Information Set Decoding

LI M D, CAI K J, SHAO Y F
2016, 3(5): 515-515. Full Text: PDF (537KB) (420)
»

Biclique Cryptanalysis on Light-weight Block Cipher mCrypton-64

YUAN Z, LI D
2016, 3(6): 572-572. Full Text: PDF (711KB) (459)
»

RF Fingerprinting Extraction and Identification of Wireless Communication Devices

YU J B, HU A Q, ZHU C M, PENG L N, JIANG Y
2016, 3(5): 446-446. Full Text: PDF (859KB) (609)
»

Security Evaluation for Fault Attacks on Lightweight Block Cipher Midori

WANG Y D, ZHAO X J, ZHANG F, GUO S Z, WU L F, LI W, LOU X X
2017, 4(1): 78-78. Full Text: PDF (602KB) (383)
»

Analysis of a New CCA-secure Public-key Cryptosystem

WANG X, XUE R
2017, 4(2): 113-113. Full Text: PDF (728KB) (448)
»

Attribute-based Encryption Scheme with Hidden Tree Access Structures

LI X, PENG C G, NIU C C.
2016, 3(5): 479-479. Full Text: PDF (562KB) (541)
»

A Transformed BF-IBE Scheme with Adaptive Security in the Standard Model

WANG X Q, XUE R
2017, 4(1): 48-48. Full Text: PDF (521KB) (463)
»

Differential Fault Attack on CRT-RSA

LI Z J
2016, 3(6): 554-554. Full Text: PDF (431KB) (505)
»

A Note on Vectorial Bent Functions in Binomial Forms

HUANG D M, TANG C M.
2017, 4(2): 105-105. Full Text: PDF (649KB) (247)
»

Multi-identity-based Fully Homomorphic Encryption from Obfuscation

WANG W L, HU B
2017, 4(2): 175-175. Full Text: PDF (760KB) (381)
»

A Multidimensional Data Aggregation Scheme in Multilevel Network in Smart Grid

ZHOU H, CHEN J, ZHANG Y Y, DANG L J
2017, 4(2): 132-132. Full Text: PDF (2728KB) (294)
»

True Random Number Generator for Smart Cards and Post-Processing Algorithm Research

JIA X Y, WU L J, ZHANG X M, WU X J
2016, 3(6): 563-563. Full Text: PDF (1505KB) (451)
»

The Boomerang Attacks on Round-Reduced Skein-1024

WU G H, YU H B, HAO Y L.
2016, 3(5): 504-504. Full Text: PDF (598KB) (316)
»

Rational Secret Sharing Scheme Based on Group

LI M H, TIAN Y L
2017, 4(3): 217-217. Full Text: PDF (420KB) (213)
»

A Hyperchaotic Digital Voice Encryption Algorithm for Mobile Communication

LIU W H, SUN K H, ZHU C X
2017, 4(1): 98-98. Full Text: PDF (2812KB) (395)
»

Security Analysis for Arbitrated Quantum Signature Scheme based on Random Oracle Model

LEI Q, SHANG T, LIU J W
2016, 3(6): 628-628. Full Text: PDF (480KB) (357)
»

A New Broadcast Attack against NTRU

YANG Z C, FU S J, QU L J, LI C, XIE D Q
2016, 3(6): 606-606. Full Text: PDF (951KB) (320)
»

ZHANG Wei-Guo
2017, 4(3): 0-0. Full Text: PDF (108KB) (199)
»

Multiple Differential Attack on 21-round SMS4

SONG H Y X, GAO H Y
2016, 3(6): 595-595. Full Text: PDF (424KB) (370)
Journal of Cryptologic Research
 Top Download
»

Research on Attribute-based Cryptography

Feng D G, Chen C
2014, 1(1): 12-12. Full Text: PDF (769KB) (5501)
»

Survey of Lattice-based Cryptography

Wang X Y, Liu M J
2014, 1(1): 27-27. Full Text: PDF (678KB) (5059)
»

An Overview on the Security Techniques and Challenges of the Internet of Things

Wu C K
2015, 2(1): 53-53. Full Text: PDF (401KB) (3976)
»

Research on White-box Cryptography

Lin T T, Lai X J
2015, 2(3): 267-267. Full Text: PDF (333KB) (3456)
»

Secret Key Extraction in Wireless Channel

Li G Y, Hu A Q, Shi L
2014, 1(3): 224-224. Full Text: PDF (1519KB) (3081)
»

Cryptanalysis of Quantum Cryptographic Protocols

Wen Q Y, Qin S J, Gao F
2014, 1(2): 210-210. Full Text: PDF (866KB) (2688)
»

Provable Security for Public Key Encryption——Challenges and Approaches

Liu S L
2014, 1(6): 550-550. Full Text: PDF (447KB) (2675)
»

Power Analysis on Lightweight Mask Scheme

Tang M, Wang X, Li Y B, Xiang X, Qiu Z L, Zhang H G
2014, 1(1): 63-63. Full Text: PDF (1621KB) (2355)
»

Faster Cryptanalytic Time-memory Trade-off Using Rainbow Table

Zheng Z X, Ji Q B, Yu H B
2014, 1(1): 110-110. Full Text: PDF (778KB) (2330)
»

A Threshold Scheme for SM2 Elliptic Curve Cryptographic Algorithm

Shang M, Ma Y, Lin J Q, Jing J W
2014, 1(2): 166-166. Full Text: PDF (1051KB) (2326)
Top Cited

Top CitedTop CitedTop CitedTop CitedTop Cited
  Email Alert
Supervised&Sponsored
Supervised by China Association for Science and Technology(CAST)
Sponsored by Chinese Association for Cryptologic Research(CACR),Beijing Academy of Information Science & Technology(BAIST) and China Science and Technology Press
Announcement
more>>     
Links
   » CACR
   » mathmagic
   » Journal of Software
Copyright © Journal of Cryptologic Research