Home Committee Invited Speakers Schedule Accommodation & Transpo Contact US


Invited Speakers

Zhenfu Cao Shanghai Jiao Tong University
Zhengjun Cao Shanghai Univerisity
Ronald Cramer Centrum Wiskunde & Informatica (CWI)
Yingpu Deng Chinese Academy of Sciences
Keqin Feng  Tsinghua Unviersity
Ming-Deh Huang   University of Southern California
Huaxiong Wang Nanyang Technological University
Jiansheng Yang Shanghai University

Title & Abstract


Title   Secure computation

Speaker Ronald Cramer, CWI, The Netherlands, Ronald.Cramer@cwi.nl

 


Title   Recent development on cryptography and network security

Speaker Zhenfu Cao, Shanghai Jiao Tong University, China, zfcao@cs.sjtu.edu.cn

 


Title   A Principle for Optimizing Cryptographic Protocols, Less Parameters

Speaker Zhengjun Cao, Shanghai Univerisity, China, caozhj@shu.edu.cn

Abstract Almost cryptographic protocols are presented with security arguments. None of them, however, did explain why a protocol should like this, not like that. The reason is that there are short of any principles for designing and analyzing cryptographic protocols. In this report, we put forth such a principle beyond security, called Less Parameters, which says that the involved parameters should be reduced as less as possible. Actually, the principle ensures a protocol better cost. To follow the principle, we advise to introduce public parameters as less as possible. We will investigate some cryptographic protocols (signature, encryption, oblivious transfer) in the light of the principle. The techniques developed in this paper will be helpful to optimize some cryptographic protocols.


Title   The sum of binomial coefficients and integer factorization

Speaker Yingpu Deng, Chinese Academy of Sciences, China, dengyp@amss.ac.cn

 


Title   Guessing number of graphs and network coding

Speaker Keqin Feng, Tsinghua Unviersity, China, kfeng@math.tsinghua.edu.cn

Abstract Guessing number is a new parameter of digraphs, introduced by S.Riis in 2006, and closely related with the network coding which is a hot topic in past decade and initiated by several chinese mathematicians ( 张箴 ( USA),李硕彦,杨伟豪 (香港中文大学),蔡宁(西安电子科大))and Kotter(Germany)...In this talk we will introduce the definition of guessing number by a king of game playing on digraphs,another equivalent definition by entropy of digraphs and relationship between guessing number and network coding.Then we present several results and open problems on guessing number.


Title   Discrete logarithm from the duality perspective

Speaker Ming-Deh Huang, University of Southern California, USA, mdhuang@usc.edu

 


Title   Private Information Retrieval and Locally Decodable Codes

Speaker Huaxiong Wang, Nanyang Technological University, Singapore, HXWang@ntu.edu.sg

Abstract Private Information Retrieval (PIR) is a cryptographic solution that allows a user to retrieve a data item of their choice from a database, such that the server storing the database does not gain any information on the identity of the item being retrieved.  A trivial solution to the PIR problem is to send the entire database to the user. In this perfect privacy solution, the communication complexity is prohibitively large. For example, consider retrieval from a Web search-engine. One of the most significant goals of PIR-related research has been to minimise the communication overhead imposed by the privacy constraint.

Since the PIR problem was first formulated by Chor, Goldreich, Kushilevitz and Sudan in 1995, it has been an area of active research and various settings and extensions have been considered.  Among them, the construction from locally decodable codes (LDC) is most efficient. In this talk, we will give a brief introduction to both PIR and LDC, as well as their connections.


Title   The Matrix-Product Self-Dual Codes

Speaker Jiansheng Yang, Shanghai University, China, yjsyjs@staff.shu.edu.cn

 


Organized by :Shanghai University