日本九州大學高木剛教授、Kirill Morozov助理教授訪問我院並做學術報告

發布時間:2012-06-14瀏覽次數:188

 

時間:6月14日下午3點到5點

地點:西區電三樓6樓計算機學院學術報告廳

 

(一)Takagi教授

 

報告題目:

(1)Pairing-Based Cryptography and Its Security Analysis

(2)Efficient Implementation of Pairing Based Cryptography on a Sensor Node

 

報告摘要:

(1)We present a short overview of pairing-based cryptography, which is an extension of conventional public-key cryptography such as RSA cryptosystem and elliptic curve cryptography. We then explain the security of pairing-based cryptography– how to solve the discrete logarithm problems over finite fields by the function field sieve.

(2)Pairing-based cryptography provides us many novel cryptographic applications such as ID-based encryption, efficient broadcast encryption, keyword searchable encryption. The security problems in ubiquitous sensor networks have been discussed in many papers, and pairing-based cryptography is a crucial technique to solve them. Due to the limited resources in current sensor nodes, it is challenged to optimize the implementation of pairings on sensor nodes. In this talk we present some efficient implementation of pairing over MICAz, which is widely used as a sensor node for ubiquitous sensor networks.

 

Takagi教授的個人簡介:

高木剛(Tsuyoshi Takagi),博士,日本九州大學教授,國際知名密碼學家,主要研究方向為密碼學與信息安全。高木教授分別於1993年和1995年獲得日本名古屋大學的本科和碩士學位,隨後進入日本電報電話公司(NTT)網絡安全實驗室工作,並於2001年獲得德國達姆施塔特工業大學(Technische University Darmstadt)博士學位。2001年至2009年於日本函館未來大學任教授,2009年起任日本九州大學教授。

目前,高木教授擔任IEICE Transactions on Fundamentals, IPSJ Journal副主編。擁有日本、美國、加拿大、歐洲專利15項,是54個國際會議的程序委員會委員。在國際高水平期刊和著名學術會議上發表論文100多篇,如Journal of Cryptology,Designs, Codes and Cryptography, IEEE Transactions on Computers和三大密碼會議CRYPTO,EUROCRYPT,ASIACRYPT等。

Takagi教授的照片  

 

(二)Morozov助理教授

 

報告題目:Zero-Knowledge Protocols for the McEliece Cryptosystem

 

報告摘要:

The code-based McEliece public key cryptosystem (PKC) is a prospective candidate for postquantum cryptography. In this talk, I will introduce a proof of plaintext knowledge (PPK) for the McEliece PKC. PPK allows a prover who encrypted a plaintext into a ciphertext to prove the knowledge of the plaintext to a polynomially bounded verifier, without actually decrypting the ciphertext. As an application, I will present the first verifiable McEliece encryption. I will conclude with a discussion on possible applications, generalizations and extensions of our results.

 

Morozov助理教授的個人簡介:

Kirill Morozov,博士,日本九州大學助理教授,主要研究方向為密碼學與編碼理論。在IEEE Transactions on Information Theory,Designs, Codes and Cryptography,TCC(Theory of Cryptography Conference),ASIACCS(ACM Symposium on Information, Computer and Communications Security),ACISP(Australasian Conference on Information Security and Privacy)等知名國際期刊和國際會議上發表學術論文15篇,擔任多個信息安全領域重要國際會議的程序委員會委員。


Baidu
map