IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
26 April 2017
Fort Lauderdale, USA, 12 April - 13 April 2018
Submission deadline: 30 November 2017
San Francisco, United States of America, 16 April - 20 April 2018
Submission deadline: 1 October 2017
Notification: 10 December 2017
24 April 2017
Chalmers University of Technology - Sweden
The PhD student will be supervised by Prof. Katerina Mitrokotsa: http://www.cse.chalmers.se/~aikmitr/
Full-time temporary employment. PhD student positions are limited to five years. Starting salary is 27,835 SEK a month before tax. The position is intended to start in Sept 2017.
Closing date for applications: 31 May 2017
Contact: Katerina Mitrokotsa, Associate Professor, Chalmers Univ. of Technology, aikmitr (at) chalmers.se
More information: http://www.cse.chalmers.se/~aikmitr/PhD-Cryptography-Cloud.html
21 April 2017
Naghmeh Karimi, Jean-Luc Danger, Florent Lozac'h, Sylvain Guilley
We observe that the reliability of the arbiter-PUF gets worse over time, whereas the reliability of the loop-PUF remains constant. We interpret this phenomenon by the asymmetric aging of the arbiter, because one half is active (hence aging fast) while the other is not (hence aging slow). Besides, we notice that the aging of the delay chain in the arbiter-PUF and in the loop-PUF has no impact on their reliability, since these PUFs operate differentially.
Subhadeep Banik, Takanori Isobe
Kostas Papagiannopoulos, Nikita Veshchikov
Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti
Essam Ghadafi, Jens Groth
Our analysis identifies two families of intractability assumptions, the $q$-Generalized Diffie-Hellman Exponent assumptions and the $q$-Simple Fractional assumptions that imply all other target assumptions. These two assumptions therefore serve as Uber assumptions that can underpin all the target assumptions where the adversary has to compute specific group elements. We also study the internal hierarchy among members of these two assumption families. We provide heuristic evidence that both families are necessary to cover the full class of target assumptions, and we show that the lowest level in the $q$-GDHE hierarchy (the $1$-GDHE assumption) is equivalent to the computational Diffie-Hellman assumption.
We generalize our results to the bilinear group setting. For the base groups our results translate nicely and a similar structure of non-interactive computational assumptions emerges. We also identify Uber assumptions in the target group but this requires replacing the $q$-GDHE assumption with a more complicated assumption, which we call the Bilinar Gap Assumption.
Our analysis can assist both cryptanalysts and cryptographers. For cryptanalysts, we propose the $q$-GDHE and the $q$-SDH assumptions are the most natural and important targets for cryptanalysis in prime-order groups. For cryptographers, we believe our classification can aid the choice of assumptions underpinning cryptographic schemes and be used as a guide to minimize the overall attack surface that different assumptions expose.
Gu Chunsheng
Dragoş Dumitrescu, Ioan-Mihail Stan, Emil Simion
Diana Popa, Emil Simion
Alan Kaminsky
University College London
The post-holder will be required to work as part of a multidisciplinary research team and will be responsible for tasks that include designing and implementing software to collect data for various sources on the web, such as Google searches and browser activity, develop privacy-preserving protocols for data aggregation, designing experiments to analyze the data and compare the results to existing surveillance information, designing real-time visualization tools to display the information, designing and implementing databases to store information and documenting and publishing the results.
This position is funded until 30 September 2018 in the first instance.
Closing date for applications: 6 May 2017
Contact: Emiliano De Cristofaro
https://emilianodc.com
More information: https://tinyurl.com/isense-privacy-position
19 April 2017
University of Westminster, Department of Computer Science
The Cyber Security (CSec) research group and the Centre for Parallel Computing (CPC) at the University of Westminster are looking for one Research Associate in Cloud Security to carry out research within the EU funded H2020 COLA (Cloud Orchestration at the Level of Application) project. COLA will define and provide a reference implementation of a generic and pluggable framework that supports the optimal and secure deployment and run-time orchestration of cloud applications. The successful candidate will carry out tasks in relation to the design and development of novel secure and privacy-preserving cloud orchestration solutions, specifically targeting and supporting application developers. In addition to that, the successful candidate will be also expected to contribute in writing project deliverables and research papers related to the project.
We expect candidates to have a strong research background in network security and/or applied cryptography. Proven research in areas such as trusted computing, cloud security, safety verification, security verification, data privacy, cyber-physical and internet of things security and cloud or mobile security will be considered as a plus.
The primary objective of the Cyber Security Research Group at the University of Westminster is to bring together expertise in education, research and practice in the field of information security and privacy. The group members conduct research in areas spanning from the theoretical foundations of cryptography to the design and implementation of leading edge efficient and secure communication protocols. To this end, we welcome applications from candidates whose research areas complement the existing research of the group.
- Job reference number: 50046999
- Salary: £33,387 to £38,489 per annum
- Contract: Fixed Term until June 2019
- Closing date: 16th May 2017
- Interviews are likely to be held on: 31st of May 2017
Closing date for applications: 16 May 2017
Contact: For an informal discussion contact Dr Antonis Michalas (a.michalas (at) westminster.ac.uk) or Dr Tamas Kiss (T.Kiss (at) westminster.ac.uk).
More information: http://tinyurl.com/hdawr6e
TU Wien (Vienna University of Technology)
The Faculty of Informatics at the Vienna University of Technology is looking for outstanding young researchers from abroad to set up and manage an independent research group as part of the Vienna Science and Technology Fund’s (WWTF) Vienna Research Groups for Young Investigators (VRSYI) Call 2017 - Mathematics and… .
Applications are sought from researchers from abroad who have recently completed their PhD (2 – 8 years ago) with an excellent research track record. Selected candidates will, together with an experienced researcher of the Faculty of Informatics as a proponent, prepare a proposal to be submitted to the WWTF VRSYI Call 2017 - Mathematics and… . Should this proposal be successful, the proposed project will be funded to the amount of 1.6 million euro by the WWTF for a period of 6 – 8 years. The Vienna University of Technology will further offer the successful candidate a tenure-track position (assistant professor), which will be later transformed into a tenured position (associate professor) subject to a positive overall assessment, with subsequent possibility of promotion to full professor.
Applications from researchers working on mathematical methods for Security and Privacy, such as
- Cryptography
- Formal Methods for Security and Privacy
- Language-based Security
- Security and Privacy in Machine Learning
are welcome. These should be sent in digital format (a single pdf file) to Univ. Prof. Matteo Maffei (matteo.maffei (at) tuwien.ac.at). The deadline for applications is May 2, 2017. The application should consist of
- CV (including a list of publications)
- a brief outline of the intended research project
Further information on the call is available at:
https://www.wwtf.at/programmes/vienna_research_groups/index.php?lang=EN#VRG17
Closing date for applications: 2 May 2017
Contact: Univ. Prof. Matteo Maffei
CEA Tech
Organisation
CEA Tech is the CEA’s technology research unit. In 2013, CEA Tech opened regional branch offices with one in South of France close to the Cadarache center. Based in Provence, the Secure Systems and Architectures (SAS) research team is located at Gardanne within the campus of the CMP (Center of Microelectronic of Provence) near a cluster of academic and industrial partners. Its research interest is mostly in the design and test of secure integrated circuits.
Job
The post-doctoral position (12 months) is financed by the PROSECCO project (ANR) that aims at developing tools that will automatically insert protections against side-channel and fault attacks in the compilation flow and formally prove the functional equivalence and the robustness of the protected software. The consortium is composed of the LIP6 (Univ. Paris 6) and the CEA.
The post-doc work will be focus on the security analysis of the code generated with the Prosecco flow according to different use cases (verify pin, AES, bootloader) and different threats (SCA, FA). This analysis will be conducted with state-of-the-art side channel and fault injection benches. Some intermediate security evaluations will also be conducted with \"low cost\" equipment setups. This work will imply a close interaction with the other teams. The retained candidate will bring to other tasks of the project a central expertise about physical attacks and countermeasures.
Applicant Profile
PhD in microelectronic, computer science or a related field with a focus on hardware security and physical attacks (SCA and/or FA).
Knowledges and experiences in some or all of the following fields will be an asset during the position: Hardware security, Physical attacks and countermeasures, Cryptography, Microprocessors, Software and compilation
Good programming practice. Written and spoken English.
A brief description of the PhD thesis, a publication list and some recommendations should be included to your application.
Job location : Gardanne (Fr)
Start date : 01/09/2017, (to be discussed)
Closing date for applications: 1 September 2017
Contact:
Pierre-Alain Moellic
pierre-alain.moellic (at) cea.fr
Singapore University of Technology and Design (SUTD)
I am looking for PhD interns on cyber-physical system security (IoT, autonomous vehicle, and power grid etc.), especially on the topics such as 1) Lightweight and low-latency crypto algorithms for CPS devices, 2) Resilient authentication of devices and data in CPS, 3) Advanced SCADA firewall to filter more sophisticated attacking packets in CPS, 4) Big data based threat analytics for detection of both known and unknown threats, 5) Attack mitigation to increase the resilience of CPS. The attachment will be at least 3 months. Allowance will be provided for local expenses.
Interested candidates please send your CV with a research statement to Prof. Jianying Zhou.
Closing date for applications: 30 May 2017
Contact: Prof. Jianying Zhou
Email: jianying_zhou (at) sutd.edu.sg
More information: http://jianying.space/
18 April 2017
Amrit Kumar, Cl\'{e}ment Fischer, Shruti Tople, Prateek Saxena
We evaluate our attacks on the Monero blockchain and show that in 87% of cases, the real output being redeemed can be easily identified with certainty. Moreover, we have compelling evidence that two of our attacks also extend to Monero RingCTs the second generation Monero that even hides the transaction value. Furthermore, we observe that for over 98% of the inputs that we have been able to trace, the real output being redeemed in it is the one that has been on the blockchain for the shortest period of time. This result shows that the mitigation measures currently employed in Monero fall short of preventing temporal analysis.
Motivated by our findings, we also propose a new mitigation strategy against temporal analysis. Our mitigation strategy leverages the real spending habit of Monero users.