|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Efficient Secure Multiparty Computational Geometry显示文摘 | LI Shundong WANG Daoshun DAI Yiqi | 2010 | Chinese Journal of Electronics2010，19，2： | 19 |
| 2 | Image universal steganalysis based on best wavelet packet decomposition显示文摘Based on the best wavelet packet decomposition of images, a new universal steganalysis method with high detection correct ratio is proposed. First, the best wavelet packet decomposition of image based on the Shannon entropy information cost function is made. Second, high order absolute characteristic function moments of histogram extracted from the coefficient subbands obtained by best wavelet packet decomposition are regarded as features. Finally, these features are processed and a back-propagation (BP) neural network is designed to classify original and stego images. Three different steganalysis algorithms for three different cases of background and application condition are presented. To validate the performance of the proposed method, a series of experiments are made for six kinds of typical steganography methods, i.e. LSB, LTSB, PMK, Jsteg, F5 and JPHide. Results show that, the average detection accuracy of the proposed method exceeds at least 6.4% and up to 15.4% and has a better universal performance than its closest competitors. Furthermore, the proposed method can provide reference for designing the pattern recognition and classification algorithm based on best wavelet packet decomposition. | LUO XiangYang LIU FenLin YANG ChunFang WANG DaoShun | 2010 | Science China(Information Sciences)2010，53，3： | 9 |
| 3 | Efficient Protocols for the General Millionaires' Problem显示文摘Secure multiparty computation(SMC) is a research focusing in the international cryptographic community. The protocols used to address the millionaires' problem are the basic building blocks of most SMC protocols and their efficiency dominates that of many other SMC protocols. To the best of our knowledge, almost all protocols used to address the millionaires' problem are based on integers, which means that their applications are limited. In this study, we propose precise and efficient protocols for rational numbers based on additively homomorphic encryptions. One of our protocols is inspired by computational geometry and it reduces the millionaires' problem to computing the area of a triangle formed by three private points. This approach can determine whether the relationship between two private inputs is greater than, equal to or less than, and it has a much lower computational complexity compared with existing methods. We proved that these protocols are secure using simulation paradigm. Our approaches can be used in many SMC protocols that involve rational numbers and integers, and they can also be used directly to solve some secure multiparty computational geometry problem in rational number field. | LI Shundong GUO Yimin ZHOU Sufang DOU Jiawei WANG Daoshun | 2017 | Chinese Journal of Electronics2017，26，4： | 8 |
| 4 | Symmetric cryptographic protocols for extended millionaires’ problem显示文摘Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions. Unfortunately, most protocols for millionaires’ problem are constructed based on public cryptography, and thus are inefficient. Furthermore, all protocols are designed to solve the basic millionaires’ problem, that is, to privately determine which of two natural numbers is greater. If the numbers are real, existing solutions do not directly work. These features limit the extensive application of the existing protocols. This study introduces and refines the first symmetric cryptographic protocol for the basic millionaires’ problem, and then extends the symmetric cryptographic protocol to privately determining which of two real numbers is greater, which are called the extended millionaires’ problem, and proposes corresponding protocols. We further prove, by a well accepted simulation paradigm, that these protocols are private. Constructed based on symmetric cryptography, these protocols are very efficient. | LI ShunDong WANG DaoShun DAI YiQi | 2009 | Science in China(Series F)2009，52，6： | 8 |
| 5 | A secure multi-party computation solution to intersection problems of sets and rectangles显示文摘安全多党的计算(SMC ) 是在国际密码的社区的一个研究焦点。在 present' ,到集合的交叉问题没有 SMC。在这 paper' ,我们首先建议一个 SMC 答案到这个问题。适用的领唱者编码方法到计算几何学问题的家并且基于点包括问题和矩形并且进一步的交叉问题的答案与广泛地接受的模拟范例证明他们的保存隐私的性质的我们进一步建议的集合交叉 problem' 的答案。与已知的答案的家相比,这些新答案具有更少的计算复杂性和更少的通讯 complexity' 并且有明显的优势在计算并且通讯复杂性。 | LI Shundong DAI Yiqi WANG Daoshun LUO Ping | 2006 | Progress in Natural Science:Materials International2006，16，5： | 7 |
| 6 | Probability method for cryptanalysis of general multivariate modular linear equation显示文摘Finding the solution to a general multivariate modular linear equation plays an important role in cryptanalysis field. Earlier results show that obtaining a relatively short solution is possible in polynomial time. However, one problem arises here that if the equation has a short solution in given bounded range, the results outputted by earlier algorithms are often not the ones we are interested in. In this paper, we present a probability method based on lattice basis reduction to solve the problem. For a general multivariate modular linear equation with short solution in the given bounded range, the new method outputs this short solution in polynomial time, with a high probability. When the number of unknowns is not too large (smaller than 68), the probability is approximating 1. Experimental results show that Knapsack systems and Lu-Lee type systems are easily broken in polynomial time with this new method. | ZHOU HaiJian LUO Ping WANG DaoShun DAI YiQi | 2009 | Science in China(Series F)2009，52，10： | 3 |
| 7 | Multi secret image color visual cryptography schemes for general access structures显示文摘在为一般存取结构的建议视觉密码学计划,黑白视觉密码学与有意义的份额策划的单个秘密图象被构造了,在哪个份额是天真的看图象。有意义的份额没在单个秘密图象颜色计划被认识到;也不让多秘密的图象渲染计划。在这篇论文,多秘密的图象渲染视觉密码学计划因为有有意义的份额的一般存取结构被矩阵并置的方法构造,象素扩大被获得,并且计划的有效性被证明。在我们的计划,有意义的颜色份额的不同联合能被用来恢复不同颜色秘密图象。多秘密的图象黑白视觉密码学计划是我们的颜色计划的一种特殊情况。 | YI Feng WANG Daoshun LUO Ping HUANG Liansheng DAI Yiqi | 2006 | Progress in Natural Science:Materials International2006，16，4： | 3 |
| 8 | Comparing two sets without disclosing them显示文摘Secure multiparty computation has become a central research focus in the international cryptographic community. Secure comparing two sets is an important problem in secure multiparty computation. The research on privately determining whether two sets are equal has not been investigated. This study solves the problem by mapping these sets into natural numbers and then comparing corresponding numbers. We propose two secure multiparty computation protocols for comparing two sets. It is proved by well-accepted simulation paradigm that these solutions are private in semi-honest model. These solutions have important significance in constructing other secure multiparty computation protocols. | LI ShunDong DAI YiQi WANG DaoShun LUO Ping | 2008 | Science in China(Series F)2008，51，9： | 3 |
| 9 | Cryptanalysis of RSA for a special case with d>e显示文摘In this paper,we study the RSA public key cryptosystem in a special case with the private exponent d larger than the public exponent e. When N0.258 e N0.854,d > e and satisfies the given conditions,we can perform cryptanalytic attacks based on the LLL lattice basis reduction algorithm. The idea is an extension of Boneh and Durfee's researches on low private key RSA,and provides a new solution to finding weak keys in RSA cryptosystems. | LUO Ping ZHOU HaiJian WANG DaoShun DAI YiQi | 2009 | Science in China(Series F)2009，52，4： | 3 |
| 10 | Region Incrementing Visual Cryptography Scheme with Same Contrast显示文摘In binary Region incrementing visual cryptography schemes(RIVCSs),the secrets of multiple secrecy regions can be gradually revealed by human visual system.A characteristic of the existing binary RIVCSs different from traditional binary Visual cryptography schemes(VCSs) is that,the contrasts for different revealed regions are different while traditional binary VCSs have same contrast.To keep the quality(contrast) of recovered image compatible with the traditional VCS,we use integer linear programming to design a binary(k,n)-RIVCS with same contrast for all secrecy regions in this paper.Experimental results demonstrate that our method is feasible and effective.The trade-off is that our scheme involves a larger pixel expansion. | LI Shundong LI Jiliang WANG Daoshun | 2016 | Chinese Journal of Electronics2016，25，4： | 2 |
| 11 | Secure multiparty computation of solid geometric problems and their applications显示文摘 | Li Shundong Wu Chunying Wang Daoshun Dai Yiqi | 2014 | Information Sciences2014，，： | 2 |
| 12 | A distributed expansible authentication model based on Kerberos显示文摘 | Hongjun Liu Ping Luo Daoshun Wang | | 0，，04： | 1 |
| 13 | A scalable authentication model based on public keys显示文摘 | Hongjun Liu Ping Luo Daoshun Wang | | 0，，04： | 1 |
| 14 | Two secret sharing schemes based Boolean operation显示文摘 | Wang Daoshun Zhang Lei Ma Ning | 2007 | Pattern Recognition2007，40，10： | 1 |
| 15 | On general construction for extended visual cryptography schemes显示文摘 | Wang Daoshun Yi Feng Liu Xiaobo | 2009 | Pattern Recognition2009，42，11： | 1 |
| 16 | On general construction for extended visual cryptography schemes显示文摘 | WANG Daoshun YI Feng LI Xiaobo | 2009 | Pattern Recognition2009，42，11： | 1 |
| 17 | Evaluation based on invisible watermarking system显示文摘 | WANG Daoshun LIANG Jinghong ZHANG Lei | 2003 | Proc SPIE-The Int Society for Optical Eng2003，5241，： | 1 |
| 18 | A scalable au-thentication model based on public keys显示文摘 | Hongjun Liu Ping Luo Daoshun Wang | | 0，，4： | 1 |
| 19 | Matrix Transformation of digital image and its periodicity显示文摘 | QI Dongxu WANG Daoshun YANG Dilian | 2001 | Progress of Natural Science2001，，6： | 1 |
| 20 | A Distributed ExpansibleAuthentication Model Based on Kerberos显示文摘 | Liu Hongjun Luo Ping Wang Daoshun | 2008 | Journal of Networkand Computer Applications2008，31，4： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员