IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
12 December 2018
Gaithersburg, Maryland, USA, 4 November - 6 November 2019
Event CalendarUniversity of Warwick, UK
Job PostingThe Department is one of the UK’s most prominent and research-active Computer Science departments, and is an international leader in research and teaching. Ranked 2nd in the most recent Research Excellence Framework out of all UK departments in the CS subject, and ranked top in the 2018 National Student Survey within the Russell Group of research intensive UK universities, the Department is 3rd in the Times and Sunday Times Good University Guide 2019 league table for Computer Science.
Closing date for applications: 10 January 2019
Contact: Informal enquires can be addressed to Professor Ranko Lazic (R.S.Lazic (at) warwick.ac.uk), Professor Stephen Jarvis (Stephen.Jarvis (at) warwick.ac.uk), or Professor Feng Hao (Feng.Hao (at) warwick.ac.uk).
More information: https://atsv7.wcn.co.uk/search_engine/jobs.cgi?owner=5062452&ownertype=fair&jcode=1786691&vt_template=1457&adminview=1
University of Connecticut
Job PostingThe successful candidate will be expected to develop and sustain an internationally-recognized and externally-funded research program in at least one established or emerging cybersecurity field. The position offers the successful candidate the Synchrony Financial Chair for Cybersecurity, an endowed chair in cybersecurity. The individual appointed to the Chair will be a nationally or internationally recognized researcher, scholar, and teacher, and will have made significant contributions to security fields.
The successful candidate must also share a deep commitment to effective instruction at the undergraduate and graduate levels, development of innovative courses and mentoring of students in research, outreach, and professional development. It is the expectation that the candidate will broaden participation among members of under-represented groups; demonstrate through their teaching, research, and/or public engagement the richness of diversity in the learning experience; integrate multicultural experiences into instructional methods and research tools; and provide leadership in developing pedagogical techniques designed to meet the needs of diverse learning styles and intellectual interests.
This is a full-time, 9-month, tenure track position. Employment is conditional upon the timely completion of an approved I-9 (Employment Eligibility Verification Form). Salary and rank will be commensurate with qualifications.
Closing date for applications: 21 March 2019
More information: https://academicjobsonline.org/ajo/jobs/12084
University of York, UK
Job PostingResearch supervision
If successful, you will conduct your research under the supervision of the Chair of Cyber Security Professor Delaram Kahrobaei: https://sites.google.com/a/nyu.edu/delaram-kahrobaei/ at University of York.
Award funding
If successful, you will be supported for three years. Funding includes:
? £14,777 (2018/19 rate) per year stipend
? UK/EU tuition fees
? RTSG (training/consumables/travel) provision
Funding requirements
To be considered for this funding you must:
? meet the entrance requirements for a PhD in Computer Science
? be eligible to pay UK/EU fees
We will look favourably on applicants that can demonstrate knowledge of cryptography, algebra, quantum computation, and who have strong programming and mathematical skills.
Apply for this studentship
1. Apply to study
? You must apply online for a full-time PhD in Computer Science.
? You must quote the project title (Post-Quantum Cryptography Studentship) in your application.
? There is no need to write a full formal research proposal (2,000-3,000 words) in your application to study as this studentship is for a specific project.
2. Provide a personal statement. As part of your application please provide a personal statement of 500-1,000 words with your initial thoughts on the research topic.
Interviews are expected to take place within approximately 14 days of the closing date.
The studentship must begin as soon as possible.
Closing date for applications: 7 January 2019
Contact: Project enquiries
Professor Delaram Kahrobaei, Chair of Cyber Security (delaram.kahrobaei (at) york.ac.uk):
https://sites.google.com/a/nyu.edu/delaram-kahrobaei/
Application enquiries
cs-pg-admissions (at) york.ac.uk
More information: https://www.cs.york.ac.uk/postgraduate/research-degrees/phdstudentships/
University of Bristol, UK
Job PostingThe University of Bristol is a UK Academic Centre of Excellence in Cyber Security Research. The successful candidates will be expected to play a major role in strengthening and growing cryptography research and teaching at Bristol.
Our current expertise spans much of cryptography with emphasis on protocol-level security and secure implementations of cryptography (in particular, side-channel resistance, compiler techniques and microarchitectural support). Academics with expertise in any area of cryptography are encouraged to apply, and we are particularly interested in those specialising in
Applicants with expertise that covers more than one of these areas and/or intersects with our existing strengths are also strongly encouraged.
The application should include:
The closing date to apply is 31st January 2019. Interviews are expected to take place in the first half of March 2019
Closing date for applications: 31 January 2019
Contact: Bogdan Warinschi (Professor of Computer Science, Department of Computer Science, csxbw (at) bristol.ac.uk) or
Seth Bullock (Head of Department, Department of Computer Science, bullock (at) bristol.ac.uk)
More information: https://bit.do/eCPzo
11 December 2018
Auckland, New Zealand, 7 July - 12 July 2019
Event CalendarSubmission deadline: 15 January 2019
Notification: 3 April 2019
Bogotá, Colombia, 5 June - 7 June 2019
Event CalendarSubmission deadline: 30 March 2019
Notification: 30 April 2019
Darmstadt, Germany, 18 May - 19 May 2019
Event CalendarSubmission deadline: 2 February 2019
Notification: 1 April 2019
10 December 2018
Rajendra Kumar, Nikhil Mittal, Shashank Singh
ePrint ReportSanjit Chatterjee, Sayantan Mukherjee
ePrint ReportThis work investigates the question of large universe realization of SPE scheme based on static assumption without random oracle. We propose two constructions both of which achieve constant size secret key. First construction $\mathsf{SPE}_1$, instantiated in composite order bilinear groups, achieves constant size ciphertext and is proven secure in a restricted version of selective security model under the subgroup decision assumption (SDP). Our main construction $\mathsf{SPE}_2$ is adaptive secure in the prime order bilinear group under the symmetric external Diffie-Hellman assumption (SXDH). Thus $\mathsf{SPE}_2$ is the first large universe instantiation of SPE to achieve adaptive security without random oracle. Both our constructions have efficient decryption function suggesting their practical applicability. Thus the primitives like WIBE and ABE resulting through black-box transformation of our constructions become more practical.
Quang Do, Ben Martini, Kim-Kwang Raymond Choo
ePrint ReportDan Boneh, Benedikt B\"unz, Ben Fisch
ePrint ReportKai Hu, Meiqin Wang
ePrint ReportSenpeng Wang, Bin Hu, Jie Guan, Kai Zhang, Tairong Shi
ePrint ReportGorjan Alagic, Stacey Jeffery, Maris Ozols, Alexander Poremba
ePrint ReportWe then revisit standard IND-CPA-secure Learning with Errors (LWE) encryption and show that leaking just one quantum decryption query (and no other queries or leakage of any kind) allows the adversary to recover the full secret key with constant success probability. In the classical setting, by contrast, recovering the key uses a linear number of decryption queries, and this is optimal. The algorithm at the core of our attack is a (large-modulus version of) the well-known Bernstein-Vazirani algorithm. We emphasize that our results should not be interpreted as a weakness of these cryptosystems in their stated security setting (i.e., post-quantum chosen-plaintext secrecy). Rather, our results mean that, if these cryptosystems are exposed to chosen-ciphertext attacks (e.g., as a result of deployment in an inappropriate real-world setting) then quantum attacks are even more devastating than classical ones.
Nasser Alsalami, Bingsheng Zhang
ePrint Report07 December 2018
Chalmers University of Technology
Job PostingThe position is fully funded for 2 years. The post-doc will be hired at the department of Computer Science and Engineering at Chalmers and will be working under the supervision of Prof. Katerina Mitrokotsa. The preferred starting date is in April 2019.
To Apply use the online form at: https://goo.gl/HqgGqM
Closing date for applications: 5 January 2019
Contact: Katerina Mitrokotsa, Associate Professor, Chalmers University of Technology, Department of Computer Science and Engineering, Gothenburg, Sweden, aikmitr (at) chalmer.se
More information: http://www.chalmers.se/en/about-chalmers/Working-at-Chalmers/Vacancies/Pages/default.aspx?rmpage=job&rmjob=6985
Nanyang Technological University (NTU) - Temasek Labs, Singapore
Job PostingSchool of Physical and Mathematical Sciences at Nanyang Technological University (NTU), Singapore, and Temasek Labs@NTU is seeking candidates for one research fellow positions (from fresh post-doc to senior research fellow, flexible contract duration) in the areas of symmetric key cryptography and/or machine learning.
Salaries are competitive and are determined according to the successful applicants accomplishments, experience and qualifications. Interested applicants should send their detailed CVs, cover letter and references to Prof. Thomas Peyrin (thomas.peyrin (at) ntu.edu.sg).
Review of applications starts immediately and will continue until positions are filled.
Closing date for applications: 15 April 2019
Contact: thomas.peyrin (at) ntu.edu.sg
05 December 2018
Benedikt Auerbach, Eike Kiltz, Bertram Poettering, Stefan Schoenen
ePrint ReportIn this work we give new constructions of lossy trapdoor permutations from the Phi-hiding assumption, the quadratic residuosity assumption, and the decisional composite residuosity assumption, all with improved lossiness. Furthermore, we propose the first all-but-one lossy trapdoor permutation from the Phi-hiding assumption. A technical vehicle used for achieving this is a novel transform that converts trapdoor functions with index-dependent domain into trapdoor functions with fixed domain.