PostDoc Position in Lightweight Cryptography for the Internet of Things, University of Luxembourg
The Laboratory of Algorithmics, Cryptology and Security (LACS) of the University of Luxembourg is looking for a post-doctoral researcher in the area of lightweight cryptography. The successful candidate will contribute to a research project entitled \\\"Applied Cryptography for the Internet of Things (ACRYPT)\\\", which is funded by the Fonds National de la Recherche (FNR). Besides conducting high-quality research, the tasks associated with this position include the co-supervision of a Ph.D. student and the dissemination of research results. The ACRYPT project is led by Prof. Alex Biryukov and expected to start in summer 2013.
Candidates must hold a Ph.D. degree (or be in the final stages of a Ph.D. program) in cryptography or a closely related discipline. Applications from researchers with experience in embedded systems security, network security, privacy/anonymity, or mobile/wireless security will also be considered. Preference will be given to candidates with a strong publication record including papers in top-tier crypto/security conference proceedings or journals. Candidates with an interest to conduct leading-edge research in one of the following areas are particularly encouraged to apply:
- Design and analysis of symmetric cryptographic primitives
- Side-channel attacks (e.g. DPA) on symmetric cryptographic primitives and countermeasures
The position is available from July 2013 on basis of a fixed-term contract for a duration of three years, which includes a probation period of six months. LACS offers excellent working conditions in an attractive research environment and a highly competitive salary. Interested candidates are invited to submit their application by email to lacs.acrypt(at)gmail.com. The application material should contain a cover letter explaining the candidate\\\'s motivation and research interests, a detailed CV (including photo), a list of publications, copies of diploma certificates, and names and
Postdoc, University of California San Diego (UCSD), La Jolla, California, USA
The cryptography group at UCSD (Bellare, Micciancio, Shacham, Impagliazzo) would love to welcome some new postdocs! We conduct research in both theoretical and applied cryptography. Start dates, duration and pay are flexible. Please apply via
Associate Professors in Computer Science at Aarhus University, Department of Computer Science, Aarhus University, Denmark
One or more positions as associate professor are available at the Department of Computer Science, Aarhus University (www.cs.au.dk) starting January 1, 2014.
The department has research groups within “Algorithms and Data Structures”, “Data-Intensive Systems”, “Cryptography and Security”, “Mathematical Computer Science”, “Logics and Semantics”, “Ubiquitous Computing and Interaction”, “Computer-Mediated Activity”, “Use, Design and Innovation”, “Programming Languages”, “Computer Graphics and Image Processing” and “Bioinformatics”. In addition, we want to build competences within “Software Engineering / Multicore/ Systems”, “Machine Learning / Data Mining” and “Quantum Informatics”.
Applicants are expected to have several years of experience at the assistant professor level. They must document a strong record of original research and have teaching experience at undergraduate/graduate level.
The department has a staff of 140 people including 28 full and associate professors, 5 assistant professors, 25 PostDocs and 65 PhD students. The number of students is approximately 1,000.
Please apply online at http://www.au.dk/en/job/nat/academicpositions/ before August 15, 2013.
PhD studentship in zero-knowledge proofs, University College London, UK, EU, EEA
Zero-knowledge proofs enable a prover to convince a verifier that a statement is true without revealing any other information and are widely used in cryptographic protocols. The goal of the PhD studentship under the supervision of Dr Jens Groth is to develop new and more efficient zero-knowledge techniques. The project is expected to involve both theoretical research and practical work on implementing protocols. Prospective candidates should have a strong undergraduate degree or masters in mathematics or computer science.
The PhD studentship is funded by an ERC Starting Grant on Efficient Cryptographic Arguments and Proofs with a starting date around October 1st, 2013 and a duration of 4 years. The studentship will provide a tax-free annual stipend of £19,790, however, ERC funding does not cover student fees (currently £4,200 for UK/EU students and £19,250 for Overseas students).
University College London is one of Europe\\\'s highest ranked universities and has recently been recognized by the EPSRC and GCHQ as one of UK\\\'s Academic Centres of Excellence in Cyber Security Research. The Computer Science Department is one of the largest in the UK and is located at UCL\\\'s main campus in the centre of London.
Senior Lecturer, RMIT University, Melbourne, Australia
A continuing/permanent Senior Lecturer position has become available in the School of Mathematical and Geospatial Sciences. Preference will be given to applicants who can contribute to teaching and research in the in the area of Information Security. The group of academics teaching and performing research in this area have interests including cryptology, pseudorandom sequence design, information theory, combinatorics, complex networks and biometrics.
For the position description please see
For more information on the group please see
For more information on the information security program please see
Post Doc, Applied Cryptography & Telecom Group, Laboratoire Hubert Curien, University of Lyon, Saint-Etienne, France
The main objective of the research in the group Applied Cryptography & Telecom is to propose efficient and robust hardware architectures aimed at applied cryptography and telecom that are resistant to passive and active cryptographic attacks. Currently, the central theme of this research consists in designing architectures for Secure Embedded Systems implemented in logic devices such as FPGAs and ASICs. We are also working on efficient and secure implementations of post-quantum cryptographic schemes. More information on http://laboratoirehubertcurien.fr/spip.php?rubrique29
For a new project which addresses the problem of secure handling of personal data and privacy in many-core architectures, we proposes a Post Doc position to work on secure-by-design crypto-processor embedded in many-core architecture. We are looking for candidates with an outstanding Ph.D. in computer science or electrical engineering. Strong knowledge in digital system (VHDL, SystemC) design would be appreciated.
The Post-Doc position will start in January 2014, it is funded for 12 month extendable to 36 month.
To apply please send your detailed CV, motivation for applying (1 page) and names of at least two people who can provide reference letters (email).
Post-Doc, Dept. of Computer Science, Aarhus University, Denmark
The cryptography group at Aarhus University is looking for postdocs. We do research in theory and practice of cryptographic protocols and public-key cryptography. Recently, we have worked on multiparty computation, leakage and tamper resilience of public-key cryptography and quantum cryptography. Whether you have already expertise in these areas or are just interested in getting into them, we would like to hear from you as soon as possible. We will consider your application immediately, even if you contact us before the closing date below.
The group has two faculty members (Ivan Damgard and Jesper Buus Nielsen), 3 postdocs and 8 PhD students. We can offer an active and welcoming research environment with good possibilities for travels and inviting guests. We usually offer 1-year contracts with an option for prolonging by a year.
On the (Im)possibility of Projecting Property\\\\, by Jae Hong Seo
Projecting bilinear pairings have frequently been used for designing cryptosystems since they were first derived from composite order bilinear groups. There have been only a few studies on the (im)possibility of projecting bilinear pairings. Groth and Sahai (EUROCRYPT 2008) showed that projecting bilinear pairings can be achieved in a prime-order group setting. They constructed both projecting asymmetric bilinear pairings and projecting symmetric bilinear pairings, where a bilinear pairing $e$ is symmetric if it satisfies $e(g,h)=e(h,g)$ for any group elements $g$ and $h$; otherwise, it is asymmetric. Subsequently, Freeman (EUROCRYPT 2010) generalized Groth-Sahai\'s projecting asymmetric bilinear pairings.
In this paper, we provide impossibility results on projecting bilinear pairings in a prime-order group setting. More precisely, we specify the lower bounds of
1. the image size of a projecting asymmetric bilinear pairing
2. the image size of a projecting symmetric bilinear pairing
3. the computational cost for a projecting asymmetric bilinear pairing
4. the computational cost for a projecting symmetric bilinear pairing
in a prime-order group setting naturally induced from the $k$-linear assumption, where the computational cost means the number of generic operations.
Our lower bounds regarding a projecting asymmetric bilinear pairing are tight, i.e., it is impossible to construct a more efficient projecting asymmetric bilinear pairing than the constructions of Groth-Sahai and Freeman. However, our lower bounds regarding a projecting symmetric bilinear pairing differ from Groth and Sahai\'s results regarding a symmetric bilinear pairing; We fill these gaps by constructing projecting symmetric bilinear pairings.
In addition, on the basis of the proposed symmetric bilinear pairings, we construct more efficient instantiations of cryptosystems that essentially use the projecting symmetric bilinear pairings in a modular fashion. Example applications include new instantiations of the Boneh-Goh-Nissim cryptosystem, the Groth-Sahai non-interactive proof system, and Seo-Cheon round optimal blind signatures proven secure under the DLIN assumption. These new instantiations are more efficient than the previous ones, which are also provably secure under the DLIN assumption. These applications are of independent interest.