时间：2013年10月23日(星期三)下午15:30
地点：仓山校区成功楼603教室
主讲：澳大利亚卧龙岗大学(University of Wollongong, Australia)
穆怡教授（“闽江学者奖励计划”讲座教授）
主办：数学与计算机科学学院，福建省网络安全与密码技术重点实验室
专家简介：穆怡教授现为澳大利亚卧龙岗大学计算机科学与软件工程学院院长、计算机安全研究中心主任，研究方向包括密码技术、网络安全、电子商务安全、计算机安全等。近年来主持和参加完成了10多项澳大利亚国家自然科学基金等各类项目，在重要的国际学术期刊和国际学术会议上发表了260多篇学术论文，合作出版编著7本。应邀担任80多个国际学术会议的主席或程序委员会委员，7个国际学术期刊的编委。
报告摘要：In this talk, a new encryption primitive, Membership Encryption will be presented. Let P(G) be a privacy-preserving token on a group attribute/identity G, such that given P(G) it is hard to know the attributes in G. In this membership encryption, if an encryption takes as input an attribute A and the token P(G), the decryption requires holding the membership A in G, i.e., A belongs to this group attribute. Membership encryption is applicable in constructing membership proof A in P(G) with privacy preserving on group attribute and the membership. Membership encryption can be also utilized to construct an efficient two-round K-out-of-N oblivious transfer protocol. We construct a provably secure membership encryption where the group token P(G) is constant-size with maximum number accountability on attributes. Using our scheme, the proposed oblivious transfer protocol exhibits the nice feature of O(1) communication cost for any K from receiver to sender, and O(N) communication cost from sender to receiver.