IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
11 January 2017
Eduardo Ruiz Duarte
ePrint ReportBahram Rashidi, Reza Rezaeian Farashahi, Sayed Masoud Sayedi
ePrint ReportWorldline / University of Limoges, France
Job PostingApplicants who have a Master degree in mathematics, computer science or related areas are encouraged to apply. Skills in error-correcting codes, complexity and software development will also be appreciated.
The position is fully funded for 3 years to work within our research teams. Additionally, the candidate may be proposed a six-month internship before the beginning of the Ph.D. Review of applications will start immediately until position is filled.
Closing date for applications: 1 September 2017
Contact: Applications should be directed to: slim.bettaieb [at] worldline.com, loic.bidoux [at] worldline.com and gaborit [at] unilim.fr
Hong Kong Applied Science and Technology Research Institute Company Limited
Job PostingJob Responsibilities
•Design and build financial technology applications using Blockchain / Distributed Ledger Technologies
•Work closely with the banking industry to create high values Blockchain applications
•Conduct research on cryptographic schemes for Blockchain / Distributed Ledger Technologies
•Design and develop innovative yet high quality application software for cybersecurity and FinTech initiatives.
•Collaborate with the energetic team to develop impactful Blockchain Proof-of-Concept and production applications.
Requirements
•Bachelor’s degree in Computer Science or related disciplines with 6+ years’ experience or Master’s degree of equivalent education with 3+ years’ experience or Ph.D degree holder with less experience. Candidates with less experience will be considered as Engineer.
•Knowledge in Blockchain technology and good understanding of the cryptographic principles. Understanding of Blockchain platform such as Bitcoin, Ethereum, HyperLedger, etc. is a big plus.
•Understanding of distributed system and experience in implementing cryptographic protocols is a plus.
•Hands-on experience in one or more programming languages: Java, Scala, Python, JavaScript, C/C++, Go, etc.
•Good understanding of data structure, algorithm and design patterns.
•Must possess excellent interpersonal, verbal, and written communication skills.
•Must have collaborative mind set, be a team-player and be keen to share knowledge.
•Ability to work independently and thrive in learning new technologies.
Closing date for applications: 15 January 2017
Contact: charlenechoo (at) astri.org
More information: http://www.astri.org
NXP Semiconductors, Hamburg, Germany
Job PostingThe PhD position is for three years and will be located in Hamburg (Germany) within the Innovation Center for Cryptography and Security of NXP and it will be supervised at the academic level by Pr. François-Xavier Standaert (Université Catholique de Louvain). It will be funded by the REASSURE European research project focusing on improving the efficiency of security evaluations with respect to side-channel analysis.
Education and Requirements
--------------------
- A Master degree in computer science, security or mathematics
- A proven interest in cryptography and side-channel analysis
- Excellent communication and presentation skills on tactical as well as executive level (internally and externally)
- Strong analytical skills
- Team player
- Fluent in spoken and written English
Background in cryptography and embedded security will be a plus. Knowledge of German is not required.
Applications will be considered on a rolling basis until the position is filled.
Closing date for applications:
Contact: Vincent Verneuil
More information: https://nxp.wd3.myworkdayjobs.com/careers/job/Hamburg/PhD-student-in-Side-Channel-Analysis--m-f-_R-10001468-1
IMDEA Software Institute, Madrid, Spain
Job PostingThe position is based in Madrid, Spain, where the IMDEA Software Institute is situated. Salaries are internationally competitive and include attractive conditions such as access to an excellent public healthcare system. The working language at the institute is English.
Applicants should have already completed, or be close to completing, a PhD in computer science, mathematics, or a related discipline. Applicants should have an excellent research track record demonstrated by publications at major cryptography/security venues, and should have significant experience in the design of cryptographic protocols and provable security. Solid programming skills and experience in implementing cryptographic protocols will be considered positively. The application requires, among other document, a CV, a research statement, and the names of 3 persons that can provide references about you and your work.
The postdoctoral position is for one year. The starting date is negotiable but expected to be mid 2017.
Applicants interested in the position should send an email to Dario Fiore and submit the application documents at https://careers.imdea.org/software/. Applications are accepted until the position is filled.
Closing date for applications: 31 May 2017
Contact: For enquiries about the position, please contact: Dario Fiore, dario.fiore (at) imdea.org
More information: https://software.imdea.org/open_positions.html
University of Surrey, Surrey Centre for Cyber Security
Job PostingSuccessful applicants are expected to hold Bachelor degree or Master degree in Information Security, Computer Science or Mathematics accomplished with at least 2:1 honours and have strong background knowledge and technical skills (incl. programming skills) in cryptography and/or information/cyber security. We particularly welcome applications from ongoing students who are projected to fulfil the above criteria and complete their degree in 2017.
This position is funded by HM Government and is available only to UK citizens. Applications are welcome from UK citizens who are prepared to undergo security vetting conducted by respective UK authorities. The initial stage of vetting may last up to 3 months and needs to be accomplished successfully before the applicant can commence with their PhD studies and become eligible for the stipend.
This is a rolling advert with the nominal closing date. Applications are accepted until the position is filled.
Closing date for applications: 31 March 2017
Contact: Dr Mark Manulis, m.manulis (at) surrey.ac.uk
More information: https://jobs.surrey.ac.uk/vacancy.aspx?ref=093316
The Hong Kong Applied Science and Technology Research Institute Company Limited
Job Posting•To design and develop cryptographic protocols and schemes
•To design, analyze and implement cryptographic systems and related systems such as blockchain
•To study the latest cryptographic algorithms and protocols
Requirements
•Master degree in computer science, electronic engineering or other relevant disciplines with 3+ years experience; less experience for PhD holders.
•Experience on cryptographic system design and cryptanalysis
•Deep knowledge on number theory and security proofs
•Hands-on experience with C/C++ and Java
•Preferably having experiences on using cryptographic libraries such as OpenSSL, MIRACL, PBC, etc.
•Experience on developing cloud computing systems an advantage, but not a must
•Strong interpersonal and communications skills
•Good command of both written and spoken English
Closing date for applications: 15 January 2017
Contact: charlenechoo (at) astri.org
More information: http://www.astri.org
Nanyang Technological University, Singapore
Job PostingClosing date for applications: 29 January 2017
Contact: Huaxiong wang
email: hxwang (at) ntu.edu.sg
05 January 2017
Philadelphia, USA, 17 July - 19 July 2017
Event CalendarSubmission deadline: 6 March 2017
Notification: 26 April 2017
Sungwook Kim, Jinsu Kim, Jae Hong Seo
ePrint Report\quad We present a new approach for practical function-private IPE schemes that does not employ DPVS but generalizations of Brakerski-Segev transformation. Our generalizations of Brakerski-Segev transformation are easily combinable with existing (non-function-private) IPE schemes as well as (non-function-private) FE schemes for general circuits in several levels of security. Our resulting IPE schemes achieve better performance in comparison with Bishop et al. IPE scheme as well as Datta et al. IPE scheme while preserving the same security notion under the same complexity assumption. In comparison with Tomida et al. IPE scheme, ours have comparable performance in the size of both ciphertext and decryption key, but better performance in the size of master key.
04 January 2017
Mike Hamburg
ePrint ReportHere we describe Strobe, a new lightweight framework for building both cryptographic primitives and network protocols. Strobe is a sponge construction in the same family as Markku Saarinens BLINKER framework.
The Strobe framework is simple and extensible. It is suitable for use as a hash, authenticated cipher, pseudorandom generator, and as the symmetric component of a network protocol engine. With an elliptic curve or other group primitive, it also provides a flexible Schnorr signature variant.
Strobe can be instantiated with different sponge functions for different purposes. We show how to instantiate Strobe as an instance of NISTs draft cSHAKE algorithm. We also show a lightweight implementation which is especially suitable for 16- and 32- bit microcontrollers, and also for small but high-speed hardware.
Ping Zhang, Peng Wang, Honggang Hu
ePrint Report02 January 2017
Jorge Luis Villar
ePrint ReportIt is well known that two MDDH problems described by matrices with a different number of rows are separated by an oracle computing certain multilinear map. Thus, we put the focus on MDDH problems of the same size. Then, we show that MDDH problems described with a different number of parameters are also separated (meaning that a successful reduction cannot decrease the amount of randomness used in the problem instance description).
When comparing MDDH problems of the same size and number of parameters, we show that they are either equivalent or incomparable. This suggests that a complete classification into equivalence classes could be done in the future. In this paper we give some positive and negative partial results about equivalence, in particular solving the open problem of whether the Linear and the Cascade MDDH problems are reducible to each other.
The results given in the paper are limited by some technical restrictions in the shape of the matrices and in the degree of the polynomials defining them. However, these restrictions are also present in most of the work dealing with MDDH Problems. Therefore, our results apply to all known instances of practical interest.
01 January 2017
Gorka Irazoqui, Thomas Eisenbarth, Berk Sunar
ePrint ReportCesar Pereida Garc{\'i}a, Billy Bob Brumley
ePrint ReportCarlos Aguilar, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor
ePrint ReportPeter T. Breuer, Jonathan P. Bowen
ePrint ReportThe prototype runs encrypted machine code on encrypted data in registers and memory and on buses. The aim is to protect user data against the operator, and so-called `Iago' attacks in general, for those computing paradigms that entail trust in data-oriented computation in remote locations, overseen by untrusted operators, or embedded unattended.
The architecture is 32-bit OpenRISC, admitting any block cipher compatible with the physical word size chosen for implementation. We are reporting performance from cycle-accurate behavioural simulations of the design running AES-128 (symmetric, keyed; the US Advanced Encryption Standard) and Paillier-72 (asymmetric, additively homomorphic, no key in-processor) encryptions in a 128-bit word, and RC2-64 encryption (symmetric, keyed) in a 64-bit word.
Antonio Faonio, Jesper Buus Nielsen
ePrint ReportP.T. Breuer, J.P. Bowen
ePrint ReportIt is proved that encrypted user data cannot be deciphered by the operator, nor may programs be altered to give an intended result. A compiler is defined and it is proved that any recompilation produces uniformly distributed random variations in runtime data, supporting cryptographic obfuscation.