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(3)
HighLights More»   
· ——ZHANG Wei-Guo
· Rational Secret Sharing Scheme Based on Group——LI M H, TIAN Y L
· Power Analysis and Protection on BBC encoding LBlock Decryption Algorithm——GUAN M Y, YU G R, XIANG Y X, TAN Z N, ZHANG G S, WANG A
· A Boolean Circuit Homomorphic Encryption Scheme Based on LWE Problem——JI C, CAI B, XIANG H, DING J T,SANG J
· Secure Multiparty String Matching Computation——KANG J, LI S D, YANG X Y
Current Issue Accepted Earlier Issues Top Read Top Downloaded Top Cited
  Journal of Cryptologic Research--2017, 4 (3)   Published: 30 June 2017
Select | Export to EndNote
Hot!
ZHANG Wei-Guo
Journal of Cryptologic Research. 2017, 4 (3): 0-0.
Full Text: HTML (1 KB)  PDF (108 KB)  ( 85 )
Show Abstract ( 70 )
Rational Secret Sharing Scheme Based on Group Hot!
LI M H, TIAN Y L
Journal of Cryptologic Research. 2017, 4 (3): 209-217. ;  doi: 10.13868/j.cnki.jcr.000175
Full Text: HTML (1 KB)  PDF (420 KB)  ( 69 )
Show Abstract ( 74 )

 Rational secret sharing is an emerging research direction of the combination of game theory and secret sharing, which extends the application field of game theory and traditional secret sharing, and has become a research hot  research of cryptography However, most researchers in the construction of a rational secret sharing scheme while ignoring the scheme efficiency issues. The number of communication round of a rational secret sharing scheme is the main factor that influence the efficiency of the scheme. In order to achieve the equilibrium, most of the existing schemes have unknown number of communication rounds, i.e., rational participants do not know whether the current round is test round or the true secret round. This method has high communication complexity and low efficiency, and to a certain extent can add additional communication expense. According to the above problem, based on the incomplete information dynamic game model, and study on the perfect Bayesian equilibrium problem of threshold rational secret sharing scheme, by using bilinear pairings on elliptic curve random function, this paper designs a knowledge commitment scheme. The scheme is verifiable, it can test the distributor and the participants' cheating. ``Homogeneous grouping'' makes rational participants as a group for the unit to communicate, which can reduce the communication complexity of the scheme, and enables the construction of two-round rational secret sharing scheme. Analysis shows that this scheme has the verifiability, can achieve the perfect bayesian equilibrium of reconstructing secret game. The scheme is compared with existing typical schemes with respect to complexity, types of communication and premise assumption, it is shown that the scheme satisfies the security requirements and is more efficient.

Power Analysis and Protection on BBC encoding LBlock Decryption Algorithm Hot!
GUAN M Y, YU G R, XIANG Y X, TAN Z N, ZHANG G S, WANG A
Journal of Cryptologic Research. 2017, 4 (3): 218-228. ;  doi: 10.13868/j.cnki.jcr.000176
Full Text: HTML (1 KB)  PDF (3499 KB)  ( 39 )
Show Abstract ( 75 )

With the rapid development of the RFID chip, wireless sensor networks and other micro computing equipment, lightweight block ciphers are widely used and their security attracted more and more attention. Power Analysis, which brings huge threats to Cipher Chips, is a common technique in side channel analysis. This paper analyses LBlock cipher algorithm in intelligent IC cards, discusses the security of Bitwisely Balanced encoding (short for BBC) and finds some security flaw under the Power Analysis attack. First, through the analysis of the LBlock cryptography algorithm in BBC, we found effective attack position and through acquiring the trace that in that position to reconstruct the templates according to the hamming weight model structure, use the template attack to recover the key step by step. Second, through the experiment, this paper proves the effectiveness of the template attack methods proposed in this paper. In addition, this paper proposes a kind of mask level protection method of side channel attack about LBlock algorithm. Experiments show that this method can effectively resist first-order power analysis attack. Then we compared masked and unmasked LBlock algorithm with respect to three indicators: program file size, storage and encryption time. The results show that these three indicators are in a reasonable range.

A Boolean Circuit Homomorphic Encryption Scheme Based on LWE Problem Hot!
JI C, CAI B, XIANG H, DING J T,SANG J
Journal of Cryptologic Research. 2017, 4 (3): 229-240. ;  doi: 10.13868/j.cnki.jcr.000177
Full Text: HTML (1 KB)  PDF (824 KB)  ( 77 )
Show Abstract ( 59 )

Traditional cryptography can only protect the security of data in storage and transmission, and the ciphertext holders cannot operate encrypted data directly. In 2009, the emergence of the first FHE scheme makes it possible for the ciphertext holders to perform the ciphertext operation directly. Based on the GSW FHE scheme, this paper redesigns the key generation, encryption, decryption, and homomorphic operation functions, proposes an improved Boolean circuit homomorphic encryption scheme. The homomorphic addition and homomorphic multiplication of the improved scheme are corresponding to the addition and multiplication of the matrix, which does not result in the expansion of ciphertext dimension. In this paper, we propose a modules dimension reduction method aiming at designing the scheme and its corresponding correctness analysis. The homomorphic encryption scheme is proved to be correct and secure. The analysis shows that the security of the improved scheme depends on the LWE problem, and can resists CPA attack. Compared with the GSW scheme, the improved scheme can be changed more naturally to a FHE scheme with fast bootstrapping method proposed by Peikert et al in 2014. In addition, this paper provides the selection rules of the parameters, implements the scheme, the AND, OR, XOR and other homomorphic computing gates of the scheme, gives the main parameters and calculation time, which makes essential foreshadowing for the forthcoming applications of the scheme.

Secure Multiparty String Matching Computation Hot!
KANG J, LI S D, YANG X Y
Journal of Cryptologic Research. 2017, 4 (3): 241-252. ;  doi: 10.13868/j.cnki.jcr.000178
Full Text: HTML (1 KB)  PDF (1018 KB)  ( 58 )
Show Abstract ( 40 )

Secure multiparty computation is a research focus in the international cryptographic community and a key privacy preserving technique in cyberspace. A variety of SMC problems and relative solutions have been presented in public literatures. This paper studies an SMC problem of privacy-preserving string matching. As an important case of secure multi-party computation, it has important theoretical significance and broad applications in auction, bidding and some other electronic commerce activities. To privately determine whether two strings match, based on the XOR homomorphism of Goldwasser-Micali probabilistic encryption algorithm, we first present a protocol to determine whether two strings are equal. Then we propose a protocol to privately determine whether two strings match based on BMH algorithm with higher efficiency. Finally, we design a more efficient and more secure protocol by changing two strings matching problem into set-inclusion problem. In addition, we prove that these protocols are secure using simulation paradigm in the semi-honest model and analyze their correctness. We also analyze the computational complexities and communication complexities of the proposed protocols and show that these protocols are efficient.

Online/Offline Signature Scheme Based on Ideal Lattices Hot!
XIANG X Y
Journal of Cryptologic Research. 2017, 4 (3): 253-261. ;  doi: 10.13868/j.cnki.jcr.000179
Full Text: HTML (1 KB)  PDF (365 KB)  ( 73 )
Show Abstract ( 32 )

Since the traditional public key cryptography usually involves computationally expensive operations, it is out of reach for resource constraint and low power devices (such as wireless sensor networks, mobile ad hoc networks, etc.). With the great deployment of Mobile Internet, a large number of low power devices are in use and they usually have a large number of complex tasks, hence light weight cryptography with high security and low communication overhead is needed, so that these devices meet an acceptable security standard. Online/offline signature (OOS) schemes can well achieve the above purpose, namely the offline phase does the vast majority of work before it actually processes a message, the online phase then rapidly assembles a signature when the specific message is known. The use of OOS scheme is well suited for light weight devices with limited computing power. However, once the quantum era becomes reality, the security problems of cryptographic schemes based on the traditional number theory will suffer serious threats, which is not suitable for the practical needs. By combining Ducas et al.’s scheme with chameleon hash function, an online/offline signature scheme based on ideal lattices is presented. The new scheme mainly relies on the commutativity property of ring/algebraic lattices and does not increase the secret key size and the signature size, and improves the efficiency of the signing process. Analysis shows that the scheme is existentially unforgeable against chosen-message attacks (UF-CMA) under R-SIS assumption.

Recent Progress in (Fast) Algebraic Immunity of Boolean Functions Hot!
TANG D
Journal of Cryptologic Research. 2017, 4 (3): 262-272. ;  doi: 10.13868/j.cnki.jcr.000180
Full Text: HTML (1 KB)  PDF (371 KB)  ( 53 )
Show Abstract ( 40 )

Boolean functions are the building blocks of symmetric cryptographic systems. In order to have resistance against the known attacks on each model of stream cipher, Boolean functions should meet various criteria. Before 2003, the following criteria for Boolean functions used in stream ciphers with linear feedback are mandatory: balancedness (to avoid statistical dependence between the plaintext and the ciphertext), high nonlinearity (to withstand the best affine approximation and fast correlation attack), high algebraic degree (to withstand the Berlekamp-Massey and the Rønjom-Helleseth attacks), good autocorrelation properties (to provide the property of diffusion to the cryptosystems), and high order resiliency (to resist the Siegenthaler correlation attack in the case of the combiner model). At Eurocrypt 2003, Courtois and Meier successfully proposed an algebraic attack on several stream ciphers which were previously believed to be secure. The attack was further improved by Courtois at Crypto 2003 where the technique of fast algebraic attack was introduced. To resist the algebraic and fast algebraic attacks, Boolean functions used in stream ciphers with linear feedback should have (almost) optimal algebraic immunity and high fast algebraic immunity. In this paper, we present a survey on the recent progress in the constructions of Boolean functions with optimal algebraic immunity and high fast algebraic immunity.

A Survey on Results of Rotation Symmetric Boolean Functions Hot!
GAO G P
Journal of Cryptologic Research. 2017, 4 (3): 273-290. ;  doi: 10.13868/j.cnki.jcr.000181
Full Text: HTML (1 KB)  PDF (375 KB)  ( 68 )
Show Abstract ( 31 )

Boolean functions play an important role in cryptography since the resistance of cryptosystems is related to the complexity of the involved Boolean functions. Cryptanalysis and constructions of Boolean functions with certain cryptographic properties are two main problems in the field of cryptographic Boolean functions. Rotation symmetric Boolean functions, also called idempotent, which are invariant under circular permutations of the coordinates, have recently proven to be very useful in several areas of cryptography, especially for resource-constrained devices as they can reduce the memory needed for storing the functions. Precisely, they have been applied to design symmetric cryptosystems and Hash functions currently. In this paper, we survey the important results of rotation symmetric Boolean functions, including: cryptographically important rotation symmetric Boolean functions obtained by designing computer algorithms, constructions of rotation symmetric bent and semi-bent functions, constructions of rotation symmetric Boolean functions with algebraic immunity, correlation immunity etc. We also collect some results about the linear structure and affine equivalence of rotation symmetric Boolean functions. We especially summarize the method of linear subspaces by which the rotation symmetric bent or semi-bent functions are constructed, and also the thread in computing the Hamming weight and nonlinearity of rotation symmetric Boolean functions with low algebraic degree. Finally, several important open problems are introduced at the end of this paper.

Several Constructions of Permutation Polynomials over Finite Fields Hot!
ZHA Z B, HU L
Journal of Cryptologic Research. 2017, 4 (3): 291-298. ;  doi: 10.13868/j.cnki.jcr.000182
Full Text: HTML (1 KB)  PDF (369 KB)  ( 81 )
Show Abstract ( 45 )

 Permutation polynomials have extensive and important applications in various areas such as algebra, combinatorics, coding theory, cryptography and so on. Recently, the research of permutation polynomials makes a series of advances. A number of methods have been proposed to construct permutations, including the Akbary-Ghioca-Wang criterion, the piecewise construction method, the switching method and so on. Permutation polynomials over finite fields are particularly interesting in the design of cryptographic algorithms for their simple algebraic forms and good cryptographic properties. It is a hot topic to find permutations with simple algebraic form over a finite field with characteristic two and even number of extension degree, which has low differential uniformity, high nonlinearity, high algebraic degree and other cryptographic properties. In this paper, we firstly introduce the related applications and research background of permutation polynomials. Some basic definitions and preliminaries are presented. Then we study the permutation properties of binomials with the form of $x^{(p^n-1)/d+1}+ax$ over finite fields $F_{p^n}$ and present a necessary and sufficient condition for these binomials to be permutations. Based on this result, we construct four classes of binomial permutations by applying the Dickson polynomials and the theory of linearized polynomials. We list some related examples of our new binomial permutations over characteristic two or three finite fields. Moreover, we obtain some complete permutation monomials from these binomial permutations. According to the properties of trace functions, we construct two classes of polynomial permutations by introducing some new parameters. Our new polynomial permutations generalize one known result.

Construction of Semi-bent Resilient Sboxes with High Dimensional Vectorial Outputs Hot!
YANG T T, LI L Y
Journal of Cryptologic Research. 2017, 4 (3): 299-306. ;  doi: 10.13868/j.cnki.jcr.000183
Full Text: HTML (1 KB)  PDF (456 KB)  ( 56 )
Show Abstract ( 22 )

    Constructing resilient S-boxes with high nonlinearity is one of the most important problems in the design and analysis of stream ciphers. Generally, a good S-box has to meet several criteria, such as high nonlinearity, resiliency, high algebraic degree and good algebraic immunity. There are trade-offs among the cryptographic criteria and the optimization is always regarded as a hard task. Nonlinearity and resiliency are important criteria in the construction of S-boxes applied in stream ciphers. In this paper, a construction of semi-bent resilient S-boxes with high dimensional vectorial outputs is proposed. Let the input dimension be $n$. When is odd, , we build a mapping from to , and construct the component functions of  S-boxes by using linear functions with variables. Furthermore, if is even, , we build a mapping from  to , and construct the component functions of S-boxes by using linear functions with variables. It has been proved that the nonlinearities of all the constructed S-boxes are almost optimal. Compared with the existing results, on the condition of the same order of resiliency, the S-boxes have higher dimensional vectorial outputs. When $n$ is odd, $n=2k+1$, we build an mapping from $F_2^k$ to $F_2^{k+1}$, and construct the component functions of $(n,m)$ S-boxes by using $2^k$ linear functions with $(k+1)$ variables. Furthermore, if $n$ is even,$n=2k$, we build an mapping from $F_2^{k-1}$ to $F_2^{k+1}$, and construct the component functions of $(n,m)$ S-boxes by using $2^{k-1}$ linear functions with $k+1$ variables. It has been proved that the nonlinearities of all the constructed S-boxes are almost optimal. Compared with the existing results, on the condition of the same order of resiliency, the S-boxes have higher dimensional vectorial outputs. 

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
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
»

Structural Cryptanalysis

SUN B, LI C
2016, 3(4): 329-329. Full Text: PDF (530KB) (678)
»

Secure and Efficient Data Retrieval Scheme Using Searchable Encryption in Cloud

XU L, XU C G, YU X L
2016, 3(4): 339-339. Full Text: PDF (666KB) (615)
»

New Construction of Lattice-based Programmable Hash Function

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

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) (919)
»

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) (832)
»

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) (662)
»

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) (751)
»

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) (511)
»

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

Certificateless Asymmetric Group Key Agreement

CHEN R X, CHEN J, ZHANG Y Y, DANG L J
2016, 3(4): 398-398. Full Text: PDF (755KB) (479)
»

Strongly Leakage-resilient and Unconditionally Secure Dynamic Secret-sharing Scheme

ZHANG M W, CHEN B W, LI F G,JIANG Y J, HARN Lein
2016, 3(4): 373-373. Full Text: PDF (664KB) (428)
»

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) (535)
»

Research on Modularization of Fairness Rational Multi-party Computation

LI T, WANG Y L
2016, 3(4): 407-407. Full Text: PDF (484KB) (358)
»

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) (548)
»

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) (343)
»

Unprovable Security of CCTR Authentication Mode

LI Y L, WANG P
2016, 3(4): 381-381. Full Text: PDF (384KB) (333)
»

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) (325)
»

Research on Combined Public Key Cryptographic Scheme for Smart Grid

HAN Y N, LI F G
2016, 3(4): 351-351. Full Text: PDF (1174KB) (465)
»

Biclique Cryptanalysis on Light-weight Block Cipher mCrypton-64

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

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) (704)
»

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) (298)
»

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) (495)
»

Related-key Invariant Bias Linear Cryptanalysis on MIBS Block Cipher

LIU Q C, ZHAO Y Q, MA M, LIU F M
2016, 3(4): 360-360. Full Text: PDF (280KB) (298)
»

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) (443)
»

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) (380)
»

Analysis of a New CCA-secure Public-key Cryptosystem

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

A Note on Vectorial Bent Functions in Binomial Forms

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

Differential Fault Attack on CRT-RSA

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

Multi-identity-based Fully Homomorphic Encryption from Obfuscation

WANG W L, HU B
2017, 4(2): 175-175. Full Text: PDF (760KB) (272)
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) (5227)
»

Survey of Lattice-based Cryptography

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

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) (3654)
»

Research on White-box Cryptography

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

Secret Key Extraction in Wireless Channel

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

Cryptanalysis of Quantum Cryptographic Protocols

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

Provable Security for Public Key Encryption——Challenges and Approaches

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

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) (2267)
»

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) (2208)
»

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) (2168)
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