Title: Quantum Protocols for Anonymous Voting and Surveying
Abstract: In my talk, I will describle quantum protocols for voting and surveying based on the work of Vaccaro et.al. A key feature of the schemes is the use of entangled states to ensure that the votes are anonymous and to allow the votes to be tallied. The entanglement is distributed over separated sites; the physical inaccessibility of any one site is sufficient to guarantee the annymity of the votes.
Title: Optimal Quantum Strong Coin Flipping
Abstract: Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a random bit. Quantum information allows for protocols where no dishonest party can perfectly cheat. However it is also shown that no quantum protocol can have cheating probability less than the square root of 1/2. In the talk I will introduce the work of Andre and Iordanis in 2009 where they present a strong coin flipping protocol with cheating probability arbitrarily close to this bound, base on the quantum weak coin flipping protocol described by Mochon in 2007.
Title: Energy Management in Wireless Sensor Network
Abstract: Energy management was one of the most important problems in wireless sensor network (WSN), especially in WSN of some application which need to work stably in large-scale field for long term. It was therefore very important to design an energy efficient scheduling algorithm which ensured that the sensor network could sample data and work for the long run.
In this presentation, I will talk about the complexity of the energy management in WSN from the routing and scheduling aspects, and introduce some solutions for this problem. So far, there are a lot of research results about this problem, but the interference models which these results are based on are different. During these models, SINR model (signal-to-interference-plus-noise ratio) model is more reasonable, so I will talk about the complexity of the energy management under the SINR model and give several algorithm. At last, I want to introduce the works of our group in this problem if the time available.