|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles显示文摘In this paper, we present an identity-based explicit authenticated key agreement protocol that is provably secure without random oracles. The protocol employs a new method to isolate a session key from key confirmation keys so that there is no direct usage of hash functions in the protocol. The protocol is proved secure without random oracles in a variant of Bellare and Rogaway style model, an exception to current proof method in this style model in the ID-based setting. We believe that this key isolation method is novel and can be further studied for constructing more effcient protocols. | 田海博 Willy Susilo 明洋 王育民 | 2008 | Journal of Computer Science & Technology2008，23，5： | 4 |
| 2 | Collusion-resistant convertible ring signature schemes显示文摘A ring signature scheme provides signer ambiguity by hiding a signer in a ring of arbitrary members appropriately. A convertible ring signature scheme is an extension of a ring signature scheme that authenticates a signer and proves that a real signer and no one else generated a ring signature. In this paper, we first show that the recent convertible ring signature scheme proposed by Jeong et al. is vulnerable to collusion attacks.Second, we present a formal security model for a convertible ring signature with collusion resistance. The security notion of a convertible ring signature is intrinsically different from that of an ordinary ring signature due to the conversion property. For our collusion resistance, we consider full key exposure, that is, even an adversary who knows all secret keys will not be able to break the collusion resistance. Finally, we construct a novel convertible ring signature scheme with collusion resistance and prove the security of the scheme in the presented security model. We also compare our scheme with the existing ring signature schemes in the literature to show its advantages. | HWANG Jung Yeon CHANG Ku-Young CHO Hyun Sook SONG Boyeon SUSILO Willy | 2015 | Science China(Information Sciences)2015，58，1： | 4 |
| 3 | Revocable Ring Signature显示文摘组签名在被打电话给组经理的一个信任聚会要撤回的一个组允许一位真正的签名人的匿名。它也给组经理控制这个组的形成的绝对力量。在另一方面,戒指签名不允许任何人撤回签名人匿名,当允许真正的签名人形成一个组时(也作为一枚戒指知道) 任意地没有被任何另外的聚会控制。在这篇论文,我们为戒指签名建议新变体,叫的可撤回的戒指签名。签名允许一位真正的签名人当允许一套当局撤回时,任意地形成一枚戒指真正的签名人的匿名。因为匿名由当局是可撤回的,当真正的签名人仍然在戒指形成上有自由时,这新变体以如此的一个方法从组签名和戒指签名继承理想的性质,真正的签名人将为它签署了的负责。我们为可撤回的戒指签名提供一个正式安全模型并且建议在我们的安全模型下面被证明安全的有效构造。电子增补材料这篇文章(doi:10.1007/s11390-007-9096-5 ) 的联机版本包含增补材料,它对授权用户可得到。 | 廖忻宏 廖啟瑞 穆怡 Willy Susilo 王石 | 2007 | Journal of Computer Science & Technology2007，22，6： | 4 |
| 4 | 强指定验证者签名的不可授权性显示文摘针对指定验证者签名权的授权攻击以及强指定验证者签名的弱不可授权性,提出了强指定验证者签名的签名者身份的强保密性,即要求强指定验证者签名方案在授权的情况下签名者的身份是保密的.证明了存在满足该性质的强指定验证者签名方案.最后证明了该概念与共同密钥和强指定验证者签名是一致的,且不同于弱不可授权性,该概念同时适用于强指定验证者签名与指定验证者签名,即弱不可授权性是冗余的. | 廖永建 SUSILO Willy 陈抗生 | 2009 | 浙江大学学报(工学版)2009，43，2： | 2 |
| 5 | Certificate-basedsignatures re-visited显示文摘 | Wu Wei Mu Yi Susilo Willy | 2009 | Journal of Universal ComputerScience2009，15，8： | 1 |
| 6 | Short Group Signatures Without Random Oracles显示文摘我们建议没有随机的神谕, provably 安全的矮组签名(GS ) 计划。我们的基本计划是比在 Eurocrypt 2006 的 Boyen 水 GS 计划短大约 14 倍的,并且 42% 突然由于 Ateniese 比最近的 GS 策划等。安全证明被提供在普遍 Composable 模型,它允许安全的证明有效不仅当我们的计划与其它一起在隔离,而且在作文被执行时,固定密码的原语。我们也介绍几个新计算假设并且在通用的组模型认为他们正当。这些假设在高级协议的设计是有用的并且可能具有独立兴趣。电子增补材料这篇文章(doi:10.1007/s11390-007-9102-y ) 的联机版本包含增补材料,它对授权用户可得到。 | 秦波 伍前红 Willy Susilo 穆怡 王育民 姜正涛 | 2007 | Journal of Computer Science & Technology2007，22，6： | 1 |
| 7 | Trapdoor security in a searchable public-key encryption scheme with a designated tester显示文摘 | Hyun Sook Rhee Jong Hwan Park Willy Susilo Dong Hoon Lee | 2009 | The Journal of Systems & Software2009，，： | 1 |
| 8 | An Efficient Post-quantum Identity-Based Signature显示文摘Digital signature is one of the most important cryptography primitives.Recently,more and more works have been done to construct signatures over lattice problems to keep them secure in the quantum age.Among them,a ring-based signature scheme named Dilithium is the most efficient one and a candidate in the third round of the National Institute of Standards and Technology’s post-quantum cryptography project.To make those schemes work well in large network,we constructed the first ring-based Identity-based signature(IBS)scheme for light-weight authentication.The construction in this paper relies on the transformations introduced by Bellare et al.in Journal of Cryptology(Vol.22,No.1,pp.1–61,2009)and its security can be proved under the hardness of ringlearning with errors problem in the random oracle model.Due to better trapdoor and polynomial ring setting,our proposed scheme are much better than the previous ones in terms of both computation and communication complexities. | YANG Zhichao DUNG H.Duong WILLY Susilo YANG Guomin LI Chao CHEN Rongmao | 2021 | Chinese Journal of Electronics2021，30，2： | 1 |
| 9 | Identity-based quotablering signature显示文摘 | Kefeng Wang Yi Mu Willy Susilo | 2015 | Information Sciences2015，321，： | 1 |
| 10 | Interac- tive conditional proxy re-eneryption with fine grain policy 显示文摘 | Liming Fang Willy Susilo Chunpeng Ge | 2011 | Journal of Systems and Software2011，84，12： | 1 |
| 11 | Constructions of certificate-based signature secure against key replacement attacks显示文摘 | Jiguo Li Xinyi Huang Yi Mu Willy Susilo Qianhong Wu | 2010 | Journal of Computer Security2010，，3： | 1 |
| 12 | Personal Health Record Systems and Their Security Protection显示文摘 | Khin Than Win Willy Susilo Yi Mu | 2006 | Journal of Medical Systems2006，，4： | 1 |
| 13 | Authenticated AODV Routing Protocol Using One-Time Signature and Transitive Signature Schemes显示文摘 | Shidi Xu Yi Mu Willy Susilo | 2006 | Journal of Networks2006，，1： | 1 |
| 14 | Constant-size dynamic-taa显示文摘 | AU Man Ho SUSILO Willy MU Yi | 2006 | SCN2006，4116，： | 1 |
| 15 | Short Linkable Ring Signatures Revisited 显示文摘 | Au Man Ho Chow S S M Susilo Willy | 2006 | LNCS2006，4043，： | 1 |
| 16 | Certificate Based (linkable) Ring Signature显示文摘 | Au Man Ho Liu J K Susilo Willy | 2007 | LNCS2007，4464，： | 1 |
| 17 | Ring Signature with Desig- nated Linkability显示文摘 | Liu J K Susilo Willy Wong D S | 2006 | LNCS2006，4266，： | 1 |
| 18 | Ciphertext-policy attribute-based proxy re-encryption via constrained PRFs显示文摘Dear editor,To maintain the confidentiality of the sensitive data,users tend to encrypt their data under an associated access policy(or attributes)before outsourcing them to the cloud.In the traditional access control model via cryptographic approaches,e.g.,ciphertext-policy attribute-based encryption(or CP-ABE),users are allowed to formulate access policies and let the encrypted data associated with access policies.Only authenticated users,whose own attributes matching their formulated access policies,have the privilege to recover the ciphertext.However,once the access policies are formulated,the authorized user cannot update it unless the user downloads and re-encrypts the file under the new access policy.Hence,to achieve dynamic access control,the model of ciphertext-policy attribute-based proxy re-encryption(or CP-AB-PRE)is adopted by integrating the proxy re-encryption(or PRE). | Zengpeng LI Vishal SHARMA Chunguang MA Chunpeng GE Willy SUSILO | 2021 | Science China(Information Sciences)2021，64，6： | 0 |
| 19 | Lattice-based group encryptions with only one trapdoor显示文摘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 users.Like 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 lattices.Based 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. | Jing PAN Jiang ZHANG Fangguo ZHANG Xiaofeng CHEN Willy SUSILO | 2022 | Science China(Information Sciences)2022，65，5： | 0 |
| 20 | Tightly Secure Public-Key Cryptographic Schemes from One-More Assumptions显示文摘A tightly secure cryptographic scheme refers to a construction with a tight security reduction to a hardness assumption,where the reduction loss is a small constant.A scheme with tight security is preferred in practice since it could be implemented using a smaller parameter to improve efficiency.Recently,Bader et al.(EUROCRYPT 2016)have proposed a comprehensive study on the impossible tight security reductions for certain(e.g.,key-unique)public-key cryptographic schemes in the multi-user with adaptive corruptions(MU-C)setting built upon non-interactive assumptions.The assumptions of one-more version,such as one-more computational Diffie-Hellman(n-CDH),are variants of the standard assumptions and have found various applications.However,whether it is possible to have tightly secure key-unique schemes from the one-more assumptions or the impossible tight reduction results also hold for these assumptions remains unknown.In this paper,we give affirmative answers to the above question,i.e.,we can have efficient key-unique public-key cryptographic schemes with tight security built upon the one-more assumptions.Specifically,we propose a digital signature scheme and an encryption scheme,both of which are key-unique and have tight MU-C security under the one-more computational Diffie-Hellman(n-CDH)assumption.Our results also reflect from another aspect that there indeed exists a gap between the standard assumptions and their one-more version counterparts. | Ge Wu Jian-Chang Lai Fu-Chun Guo Willy Susilo Fu-Tai Zhang | 2019 | Journal of Computer Science & Technology2019，34，6： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员