Logic List Mailing Archive

Postdoctoral position in secure communication, Seville (Spain), Deadline: 1 Jun 2013

Postdoc position in Seville

We offer a one-year postdoc position at the University of Seville to work in a 
project on unconditionally secure communication. Candidates should have a PhD, 
a solid background and publications in computer science, logic, cryptography, 
algorithm specification or related areas. The position will start preferably 
from September 2013 and no later than November 2013. Interested candidates may 
send a CV, list of publications, research statement and the names and contact 
information of two references to Fernando Soler-Toscano <fsoler@us.es>. The 
gross salary is 2200 eur/month.

Deadline for application: 1st June 2013. Candidates are encouraged to contact 
Fernando Soler-Toscano before the deadline and the position will be filled 
immediately once a suitable candidate has been found.


Project team:
- Andrés Cordón-Franco: http://www.cs.us.es/~acordon/
- David Fernández-Duque: http://personal.us.es/dfduque/
- Fernando Soler-Toscano: http://personal.us.es/fsoler/
- Fernando R. Velázquez-Quesada: http://personal.us.es/frvelazquezquesada/

Project description:

In the Russian cards problem, Alice, Bob and Cath draw three, three and one 
cards, respectively, from a deck of seven. Alice and Bob must then communicate 
their entire hand to each other, without Cath learning the owner of a single 
card. Unlike many traditional problems in cryptography, however, they are not 
allowed to hide or codify the messages they exchange from Cath. The problem is 
then to find methods through which they can achieve this. We have several 
methods that generalize the original Russian cards problem to different deck 
sizes and deals. The purpose of this project is the extend some of these 
methods and develop applications to cryptography.