Marie Sklodowska-Curie Research Fellows in Cryptography (Early Stage Researchers - 2 posts), Royal Holloway, University of London
The Information Security Group at Royal Holloway, University of London, is seeking to recruit two Marie Sklodowska-Curie Research Fellows in Cryptography to start in September 2015, as part of the ECRYPT-NET project.
ECRYPT-NET is a research network of six universities and two companies that intends to develop advanced cryptographic techniques for the Internet of Things and the Cloud, and to create efficient and secure implementations of those techniques on a broad range of platforms. ECRYPT-NET is funded by a prestigious Marie Sklodowska-Curie ITN (Integrated Training Network) grant. The network will educate a group of 15 PhD students with a set of interdisciplinary skills in the areas of mathematics, computer science and electrical engineering. The training will be provided in an international context that include Summer Schools, workshops and internships. Participants are expected to spend at least six months abroad in a network partner or in one of the seven associated companies. We are looking for highly motivated candidates, ideally with background on cryptology and with proven research abilities.
Two of the ECRYPT-NET ESR (Early Stage Researcher) positions will be based at the Information Security Group at Royal Holloway, to work on the following projects:
(1) Design and analysis of efficient and lightweight authenticated encryption schemes.
(2) Secure outsourcing of computation.
Marie Curie ITN eligibility criteria apply to both of these positions.
Founded in 1990, the Information Security Group at Royal Holloway is a world-leading interdisciplinary research group dedicated to research and education in the area of cyber security, with an extensive and long-standing record of research in cryptography. It has 16 established academics, 11 RAs, and over 50 PhD students. It gained the status of UK Academic Centre of Excellence in Cyber Security Research by EPSRC and GCHQ, and hosts one of the
Improved Linear Trails for the Block Cipher Simon, by Tomer Ashur
Simon is a family of block ciphers designed by the NSA and published in 2013. Due to their simple structure and the fact that the specification lacked security design rationale, the ciphers have been the subject of much cryptanalytic work, especially using differential and linear cryptanalysis.
We improve previously published linear trail bias estimations by presenting a novel method to calculate the bias of short linear hulls in Simon and use them to construct longer linear approximations. By using these linear approximations we present key recovery attacks of up to 25 rounds for Simon64/128, 24 rounds for Simon32/64, Simon48/96, and Simon64/96, and 23 rounds for Simon48/72. The attacks on Simon32 and Simon48 are currently the best attacks on these versions. The attacks on Simon64 do not cover as many rounds as attacks using differential cryptanalysis but they work in the more natural setting of known plaintexts rather than chosen plaintexts.
Internship – M.S./Ph.D. student in Computer Science or a closely related field, Bosch Research and Technology Center North America – 2835 East Carson St., Pittsburgh, PA, 15203 USA
Robert Bosch RTC is looking to fill several internship positions in its Software Intensive Systems research group in Pittsburgh to work on a variety of applied cryptography, (embedded and hardware) security, and privacy related projects. Applicants with a history of building secure systems are particular encouraged to apply. Ideal candidates for this position should have experience in one of the following:
- Applied cryptography and protocols
- Distributed system security and cloud computing
- Privacy enhancing technologies
- Data mining and security
- Embedded security, hardware security and noisy crypto, PUFs, etc.
Candidates pursuing a Ph.D. in Computer Science or a related area are preferred. Specific internship projects and requirements are as follows:
- Secure Databases: requires expertise in SQL databases and applied cryptography.
- Distributed Security: requires expertise in distributed systems and applied crypto. Knowledge and or familiarity with two party or multi-party computation highly desirable.
- Hardware supported encryption operations: requires expertise in VHDL, FPGAs, and applied crypto. Knowledge of trusted computing, computer architecture are highly desirable.
- Physics-based security I: requires expertise in signal processing and applied crypto mechanisms. Familiarity and knowledge of data mining, PUFs, watermarking highly desirable.
- Physics-based security II: requires expert knowledge of image processing algorithms. Familiarity with cryptographic algorithms will be helpful.
- Software Engineer: expert knowledge of java, software architecture and GUI design. Familiarity with security risk analysis and assessments is desirable.
Leakage-Flexible CCA-secure Public-Key Encryption: Simple Construction and Free of Pairing, by Baodong Qin and Shengli Liu
In AsiaCrypt~2013, Qin and Liu proposed a new approach to CCA-security of Public-Key Encryption (PKE) in the presence of bounded key-leakage, from any universal hash proof system (due to Cramer and Shoup) and any one-time lossy filter (a simplified version of lossy algebraic filters, due to Hofheinz). They presented two instantiations under the DDH and DCR assumptions, which result in leakage rate (defined as the ratio of leakage amount to the secret-key length) of $1/2-o(1)$. In this paper, we extend their work to broader assumptions and to flexible leakage rate, more specifically to leakage rate of $1-o(1)$.
\\item We introduce the Refined Subgroup Indistinguishability (RSI) assumption, which is a subclass of subgroup indistinguishability assumptions, including many standard number-theoretical assumptions, like the quadratic residuosity assumption, the decisional composite residuosity assumption and the subgroup decision assumption over a group of known order defined by Boneh et al.
\\item We show that universal hash proof (UHP) system and one-time lossy filter (OT-LF) can be simply and efficiently constructed from the RSI assumption. Applying Qin and Liu\'s paradigm gives simple and efficient PKE schemes under the RSI assumption.
\\item With the RSI assumption over a specific group (free of pairing), public parameters of UHP and OT-LF can be chosen in a flexible way, resulting in a leakage-flexible CCA-secure PKE scheme. More specifically, we get the first CCA-secure PKE with leakage rate of $1-o(1)$ without pairing.
MQ Challenge: Hardness Evaluation of Solving Multivariate Quadratic Problems, by Takanori Yasuda and Xavier Dahan and Yun-Ju Huang and Tsuyoshi Takagi and Kouichi Sakurai
Multivariate Quadratic polynomial (MQ) problem serve as the basis of
security for potentially post-quantum cryptosystems.
The hardness of solving MQ problem depends on a number of parameters,
most importantly the number of variables and the degree of the
polynomials, as well as the number of equations, the size of the base
field etc. We investigate the relation among these parameters and the
hardness of solving MQ problem, in order to construct hard instances
of MQ problem. These instances are used to create a challenge, which
may be helpful in determining appropriate parameters for multivariate
public key cryptosystems, and stimulate further the research in
solving MQ problem.