徐秋亮山东大学主页平台管理系统--中文主页

扫描手机二维码

欢迎您的访问
您是第位访客

开通时间：..

最后更新时间：..

登录| 山东大学| English | 手机版

徐秋亮 ( 教授 ) 赞
个人主页 http://faculty.sdu.edu.cn/xuqiuliang/zh_CN/index.htm
教授博士生导师硕士生导师

论文成果当前位置：中文主页 >> 科学研究 >> 论文成果

[76] 徐秋亮 and 侯孟波. A Two-party Certificateless Authenticated Key Agreement Protocol with provable security. 2013 9th International Conference on Computational Intelligence and Security, CIS 2013，Accession number: 20141217490358, 2013.
[77] 徐秋亮. Revocable attribute-based key agreement protocol without random oracles. Journal of networks, 2009.
[78] 徐秋亮 and 蒋瀚. several Oblivious Transfer Variants in Cut-and-Choose Scenario. International Journal of Information Security and Privacy, 2015.
[79] 徐秋亮. Leakage-Resilient Functional Encryption via Pair Encodings. 21st Australasian Conference, ACISP 2016, 最佳论文，EI：20162902611218, 21, 443, 2016.
[80] 徐秋亮. Concurrent non-malleable statistically hiding commitment. 2011 7th International Conference on Computational Intelligence and Security, CIS 2011，EI:20120614746004, 2011.
[81] 徐秋亮. Multi-party computation with social rational parties. 2012 4th International Conference on Intelligent Networking and Collaborative Systems, INCoS 2012, 1, 251, 2012.
[82] 徐秋亮 and 张国艳. A Secure Threshold Signature Scheme from Lattices. 2013 9th International Conference on Computational Intelligence and Security, CIS 2013, Accession number: 20141217490339, 2013.
[83] 徐秋亮. Lightweight multi-coupon system for multi-merchant environments with DAA. Tongxin Xuebao/Journal on Communications, EI: 20164302956443, 37, 30, 2016.
[84] 徐秋亮 and 王伊蕾. Achieving fairness by sequential equilibrium in rational two-party computation under incomplete i.... Security and Communication Networks, CCF-C, SCI, WOS 000367922500032, 8, 3690, 2015.
[85] 蒋瀚 and 徐秋亮. 基于RSA的门限代理签名. 《计算机学报》, 30, 241, 2007.
[86] 徐秋亮. Modification for multi-proxy multi-signature scheme. 《大连理工大学学报》, 45, 100, 2005.
[87] 侯孟波 and 徐秋亮. CA系统证书注销及验证模型的研究与分析. 《信息工程大学学报》, 2001卷, 6, 2001.
[88] 徐秋亮. A Scalable ID-based Constant-round AGKE Protocol with Logarithmic Computation Complexity. Journal of networks, 2011.
[89] 徐秋亮 and 蒋瀚. Fast Cut-and-Choose Bilateral Oblivious Transfer for Malicious Adversaries. IEEE Trustcom, 2016.
[90] 徐秋亮. Multiparty computation for modulo reduction without bit-decomposition and a generalization to bit.... ASIACRYPT 2010, 亚密会，CCF B类， EI: 2011011355585 LNCS，Springer., 6477, 483, 2010.

共296条 6/20

首页上页下页尾页页

版权所有 ©山东大学　地址：中国山东省济南市山大南路27号　邮编：250100　
查号台：（86）-0531-88395114
值班电话：（86）-0531-88364731　建设维护：山东大学信息化工作办公室　　