## ÆäËû

µ±Ç°Î»ÖÃ : Ê×Ò³ > ÆäËû > Ñ§Êõ»î¶¯

## ×éºÏ±àÂëÑ§ÏµÁÐ½²×ù

±à¼­£ºwfy Ê±¼ä£º2018Äê12ÔÂ04ÈÕ ·ÃÎÊ´ÎÊý:140

Title: Ivy: a new code-based IND-CCA secure public key scheme

Speaker: Professor Liping Wang (ÖÐ¿ÆÔºÐÅ¹¤Ëù£¬ CAS)

Time: 8:00-10:00am, Dec 8, 2018

Venue: 105, Sir Run-Run Shaw Business Building

Abstract: In this paper, we propose a new IND-CPA-secure public-key encryption (PKE for short) scheme£¬I.e., Ivy,  which is based on hardness of rank syndrome decoding problem.  Then applying a variant of the Fujisaki-Okamoto transform, we obtain an  IND-CCA2-secure KEM. We also give the comparison of parameters between our  scheme  and some proposals of the NIST post-quantum call.

Title: Anti-Ramsey problems in complete bipartite graphs

Speaker: Professor Mei Lu (Tsinghua University)

Time:10:00-12:00am, Dec 8, 2018

Venue:  105, Sir Run-Run Shaw Business Building

Abstract : A subgraph $H$ of an edge-colored graph $G$ is rainbow if all of its edges have different colors. The anti-Ramsey number is the maximum number of colors in an edge-coloring of $G$ with no rainbow copy of $H$. Originally a complete graph was considered as $G$. In this talk, we consider a complete bipartite graph as the host graph and discuss some results for the graph $H$ being hamiltonian cycle, perfect matching and spanning tree, respectively.

Title: Perfect State Transfer on Abelian Cayley Graphs

Speaker: Professor Xiwang Cao (Nanjing University of Aeronautics and Astronautics)

Time:1:00-3:00pm, Dec 8, 2018

Venue:  105, Sir Run-Run Shaw Business Building

Abstract: Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. In this talk, we present a characterization of the connected simple Cayley graph $\Gamma={\rm Cay}(G,S)$ having PST. We show that many previous results on periodicity and existence of PST of circulant graphs (where the underlying group $G$ is cyclic) and cubelike graphs ($G=(\mathbb{F}_2^n,+)$) can be derived or generalized to arbitrary abelian case in unified and more simple ways from our characterization. We also get several new results including answers to some questions raised before.

Title: Two Hypercube Coloring Problems

Speaker: Professor Fangwei Fu (Nankai University)

Time:3:00-5:00pm, Dec 8, 2018

Venue: 105, Sir Run-Run Shaw Business Building

Abstract: We study the following two hypercube coloring problems: Given n and d, find the minimum number of colors needed to color the vertices of the n-cube such that any two vertices with Hamming distance at most d (resp. exactly d) have different colors. These problems originally arose in the study of the scalability of optical networks. In this talk we present some new results obtained by using methods in coding theory.