检索结果-南通市图书馆

Lattice-based group encryptions with only one trapdoor

Science China(Information Sciences) 2022年第5期65卷 205-222页

作者： Jing PAN Jiang zhang fangguo zhang Xiaofeng CHEN Willy SUSILO State Key Laboratory of Integrated Service Networks(ISN) Xidian University State Key Laboratory of Cryptology School of Computer Science and Engineering Sun Yat-sen University Guangdong Key Laboratory of Information Security Institute of Cybersecurity and Cryptology School of Computing and Information TechnologyUniversity of Wollongong

Group encryption(GE), the encryption analog of group signatures, is a fundamental primitive that offers a privacy-preserving service for a specific receiver concealed within a group of certified *** other cryptographic primitives, GE constructions are always considered relative to the potential danger of quantum computations. The only existing lattice-based variant appeared in the work of Libert et al.(Asiacrypt’16). Despite its non-trivial achievement, the construction suffers in terms of efficiency due to the extensive use of lattice trapdoors. In this paper, we develop an integrated zero-knowledge argument system that is friendly to both accumulated values and hidden matrices and supports efficient designs from *** on this system, we propose efficiency enhancing GE where only group users are required to possess the lattice trapdoors and the other parties are not. In particular, we utilize lattice-based cryptographic accumulators to confirm prospective group members and use the dual Regev encryption scheme to provide privacy for ciphertext recipients. These modifications significantly increase GE efficiency. In addition, under the intractability assumptions of the standard lattice problems, we prove the security of the proposed scheme in the standard model(assuming interaction during the proof phase), which retains the strongest level of security as the only currently available candidate.

关键词： Lattice cryptography lattice cryptography group encryptions lattice trapdoors accumulators zero-knowledge

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Code-Based Conjunction Obfuscation

引用

Chinese Journal of Electronics 2023年第2期32卷 237-247页

作者： zhang Zheng zhang Zhuoran zhang fangguo School of Computer Science and Engineering Sun Yat-sen University Guangdong Province Key Laboratory of Information Security Technology

The pattern-matching problem with wildcards can be formulated as a conjunction where an accepting string is same as the pattern for all non-wildcards. A scheme of conjunction obfuscation is a algorithm that “encrypt” the pattern to prevent some adversary from forging any accepting string. Since 2013, there are abundant works about conjunction obfuscation which discussed with weak/strong functionality preservation and distributed black-box security. These works are based on generic group model, learning with error assumption,learning with noise assumption, etc. Our work proposes the first conjunction obfuscation with strong functionality preservation and distributed black-box security from a standard assumption. Our scheme with some parameter constraints can also resist some related attacks such as the information set decoding attack and the structured error arrack.

关键词： Computers Quantum computing Computational modeling Closed box Resists Linear codes Mathematical models

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Pseudorandom number generator based on supersingular elliptic curve isogenies

引用

Science China(Information Sciences) 2022年第5期65卷 267-269页

作者： Yan HUANG fangguo zhang Zhijie LIU Haibo TIAN School of Electronic and Information Engineering Sun Yat-sen University School of Data and Computer Science Sun Yat-sen University Guangdong Key Laboratory of Information Security

Dear editor,Pseudorandom number generator(PRNG) is very important for the randomness study in some cryptographic algorithms.A PRNG is a deterministic function that takes a uniform random bit string as input and output... 详细信息

关键词： Post-quantum cryptography Pseudorandom generator Supersingular elliptic curve isogenies Decisional Supersingular Product Indistinguishability

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Secure linear system computation in the presence of malicious adversaries

引用

Science China(Information Sciences) 2014年第9期57卷 146-155页

作者： zhang Bo zhang fangguo School of Information Science and Technology Sun Yat-sen University

In this paper,we study the system of linear equation problems in the two-party computation *** that P1 holds an m×m matrix M1 and an m-dimensional column vector ***,P2holds M2 and *** executing a secure linear system computation,P1 gets the output x(or⊥)conditioned on(M1+M2)x=(B1+B2),and the rank of matrix M1+M2,while P2 gets *** also can be used to settle other cooperative linear system *** firstly design an efficient protocol to solve this problem in the presence of malicious adversaries,then propose a simple way to modify our protocol for having a precise functionality,in which the rank of matrix M1+M2 is not *** note that our protocol is more practical than these existing malicious secure *** also give comparisons with other protocols and extensions to similar functions.

关键词： linear system computation noisy coding oblivious transfer cut-and-choose secure two-party computation

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Memory leakage-resilient secret sharing schemes

引用

Science China(Information Sciences) 2015年第11期58卷 191-199页

作者： DAI ShuGuang WEI JinFeng zhang fangguo School of Information Science and Technology Sun Yat-sen University Guangdong Key Laboratory of Information Security Technology Mathematics Department College of Arts and Sciences Maryville University of St.Louis

A secret sharing scheme is a method to share secrets among some shareholders such that the shared secrets can be recovered only by certain authorized sets, not by the unauthorized sets. However, in practice,attackers who corrupted an unauthorized set are often able to obtain some or even all of the uncorrupted shareholders’ memory information by a great variety of side channel attacks. Then, they can illegally obtain the partial information or even all of the shared secrets. Facing such attacks, all existing secret sharing schemes are no longer secure. In this paper, we investigate how to construct secure secret sharing schemes with the presence of memory leakage, we call them memory leakage-resilient secret sharing schemes(MLR-SS schemes).We present the formal definition of MLR-SS scheme and construct two MLR-SS schemes by combining the existing secret sharing schemes with physical unclonable functions(PUFs). With these two concrete examples,we are attempting to demonstrate the use of PUFs in constructing MLR-SS schemes.

关键词： secret sharing multi-secret sharing side-channel attacks physical unclonable functions(PUFs) memory leakage-resilient

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Intersection-policy private mutual authentication from authorized private set intersection

引用

Science China(Information Sciences) 2020年第2期63卷 116-130页

作者： Yamin WEN fangguo zhang Huaxiong WANG Yinbin MIAO Zheng GONG School of Statistics and Mathematics Guangdong University of Finance and Economics State Key Laboratory of Cryptology School of Data and Computer Science Sun Yat-sen University Guangdong Key Laboratory of Information Security Sun Yat-sen University School of Physical and Mathematical Sciences Nanyang Technological University Department of Cyber Engineering Xidian University School of Computer South China Normal University

Private mutual authentication(PMA) enables two-way anonymous authentication between two users certified by the same trusted group authority. Most existing PMA schemes focus on acquiring a relatively onefold authentication policy that ensures affiliation-hiding or designated single-attribute ***, in practice, users are typically provided with multiple attributes. In addition to the affiliation-hiding requirement, how to effectively achieve a more flexible authentication policy for multi-attribute applications remains a challenging issue. The intersection policy for authentication is also required when the attribute intersection is not an empty set or its cardinality is no less than a threshold value. To solve the above problems, we first propose an optimal authorized private set intersection protocol with forward security based on identity-based encryption and then design a new PMA protocol with intersection-policy called IP-PMA, which provides a simple solution for secret handshakes between two members(holding multiple attributes) from the same organization. Formal security analyses proved that our two proposed protocols are secure in the random oracle model. Empirical tests demonstrated that the IP-PMA protocol is optimized with linear complexity and may be more suitable for resource-constrained applications.

关键词： private mutual authentication secret handshake intersection policy authorized private set intersection multi-attribute matching

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Efficient Tate pairing computation using double-base chains

引用

Science in China(Series F) 2008年第8期51卷 1096-1105页

作者： ZHAO ChangAn zhang fangguo HUANG JiWu School of Information Science and Technology Sun Yat-Sen University Guangdong Key Laboratory of Information Security Technology Guangzhou 510275 China

Pairing-based cryptosystems have developed very fast in the last few years. The efficiencies of these cryptosystems depend on the computation of the bilinear pairings, In this paper, a new efficient algorithm based on double-base chains for computing the Tate pairing is proposed for odd characteristic p 〉 3. The inherent sparseness of double-base number system reduces the computational cost for computing the Tate pairing evidently. The new algorithm is 9% faster than the previous fastest method for the embedding degree k = 6.

关键词： public key cryptography Tate pairing elliptic curves double-base chains

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Selectively unforgeable but existentially forgeable signature schemes and applications

引用

Science China(Information Sciences) 2013年第1期56卷 98-111页

作者： TIAN HaiBo zhang fangguo CHEN XiaoFeng WEI BaoDian School of Information Science and Technology Sun Yat-Sun University State Key Laboratory of Integrated Service Networks Xidian University

This paper gives definitions,constructions and applications of signature schemes,which are selectively unforgeable but existentially forgeable(SUEF).We formalize the special notion under conditions of chosen message attack(CMA) and known message attack(KMA).Then two general constructions are presented with two concrete *** apply the SUEF secure signature schemes to an elementary authentication mechanism,the challenge-response mechanism,to obtain a basic deniable authentication *** method is presented as a deniable message transmission(MT) authenticator in the extension framework of Raimondo.

关键词： signature schemes selectively unforgeable deniable authentication

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

OBLIVIOUS TRANSFER WITH ACCESS CONTROL AND IDENTITY-BASED ENCRYPTION WITH ANONYMOUS KEY ISSUING

引用

Journal of Electronics(China) 2011年第4期28卷 571-579页

作者： Xu Lingling zhang fangguo Wen Yamin School of Information Science and Technology Sun Yat-sen University Guangzhou 510275 China School of Mathematics and Computational Science Guangdong University of Business Studies Guangzhou 510320 China

In ACM'CCS 2009,Camenisch,et *** the Oblivious Transfer with Access Control(AC-OT) in which each item is associated with an attribute set and can only be available,on request,to the users who have all the attributes in the associated ***,AC-OT achieves access control policy for conjunction of ***,the functionality of AC-OT is equivalent to the sim-plified version that we call AC-OT-SV:for each item,one attribute is associated with it,and it is requested that only the users who possess the associated attribute can obtain the item by *** one hand,AC-OT-SV is a special case of AC-OT when there is just one associated attribute with each *** the other hand,any AC-OT can be realized by an *** this paper,we first present a concrete AC-OT-SV protocol which is proved to be secure in the model defined by Camenisch,et al..Then from the protocol,interestingly,a concrete Identity-Based Encryption(IBE) with Anonymous Key Issuing(AKI) is given which is just a direct application to *** comparison,we show that the AKI protocol we present is more efficient in communications than that proposed by Chow.

关键词： Oblivious Transfer(OT) Access Control(AC) Identity-Based Encryption(IBE) Anonymous Key Issuing(AKI)

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

RING PROXY SIGNATURES

引用

Journal of Electronics(China) 2008年第1期25卷 108-114页

作者： Wei Baodian zhang fangguo Chen Xiaofeng Department of Electronics and Communication Engineering Sun Yat-Sen University Guangzhou 510275 China Department of Computer Science Sun Yat-Sen University Guangzhou 510275 China Guangdong.Key Laboratory of Information Security Technology Guangzhou 510275 China

Proxy signatures have been used to enable the transfer of digital signing power within some context and ring signatures can be used to provide the anonymity of a signer. By combining the functionalities of proxy signatures and ring signatures, this paper introduces a new concept, named ring proxy signature, which is a proxy signature generated by an anonymous member from a set of potential signers. The paper also constructs the first concrete ring proxy signature scheme based on the provably secure Schnorr's signatures and two ID-based ring proxy signature schemes. The security analysis is provided as well.

关键词：代理签名可撤消环技术性能 ID

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：