IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
08 December 2016
Qiang Tang, Husen Wang
ePrint ReportPedro Maat C. Massolino, Joost Renes, Lejla Batina
ePrint ReportDibyendu Roy, Sourav Mukhopadhyay
ePrint ReportShiyi ZHANG, Yang GAO, Tao WANG
ePrint Report07 December 2016
Atakan Arslan, Suleyman Kardas, Sultan Aldirmaz, Sarp Erturk
ePrint ReportXi-Jun Lin, Zhen Yan, Qi Zhang, Haipeng Qu
ePrint ReportMartin Ekerå
ePrint ReportWe demonstrate conservative lower bounds on the success probability of our algorithms in both the general and the special case. In both cases, our algorithms initially set the index registers to a uniform superposition of all states, compared to p-1 states in Shor's original algorithm.
In the special case where d <<< q, our algorithm uses 3 ceil(log d) qubits for the two index registers and computes two QFTs of size 2^(ceil(log d)) and 2^(2 ceil(log d)), compared to 2 floor(log q) qubits for the index registers and two QFTs both of size 2^(floor(log q)) in the general case.
A quantum circuit for computing [a - bd] g is furthermore required, where 0 <= a < 2^(2 ceil(log d)) and 0 <= b < 2^(ceil(log d)) in the special case, compared to 0 <= a, b < 2^(floor(log q)) in the general case.
This implies that the complexity of computing discrete logarithms on a quantum computer can be made to depend not only on the choice of group, and on its order q, but also on the logarithm d.
In the special case where d <<< q, our algorithm does not require q to be prime. It may hence be generalized to finite abelian groups.
05 December 2016
NewYork Univeristy Abu Dhabi
Job PostingThe candidate will work on areas of research that include mathematical cryptology including hardware and software implementations of cryptographic primitives, analysis of certain cryptographic structures and designing new constructions under the supervision of Hoda A.alkhzaimi.
The PhD project will be conducted in the department of engineering in NYUAD in collaboration with Tendon School of engineering in NYU. The position is fully funded by NYUAD global fellowship program.
The deadline of application is on 15th December 2015 start date is in Q1 of 2017. Candidates should provide pre-application documents to the contact email provided below this include
1. CV
2. Cover letter and research statement
3. Two recommendation letter
An interview is expected pre-applying to the program.
The main features of this fellowship are:
1. NYU Tandon School of Engineering Ph.D. upon graduation
2. Graduate coursework at the School of Engineering in New York
3. Cutting edge research opportunities in one of NYU Abu Dhabi\'s research labs
4. Tuition, fees, and health insurance provided throughout doctoral studies
5. Competitive salary and allowances
6. Degree-related travel between Abu Dhabi and New York
7. Career development opportunities
A separate application will be provided by chosen candidate to NYUAD graduate program in Department of Engineering http://engineering.nyu.edu/admissions/graduate/apply
(All interested candidates regardless of gender, disability, race, religion or ethnic background are encouraged to apply)
Closing date for applications: 15 December 2016
Contact: Director for Center for Cyber Security NYUAD and assistant professor in NYUAD.
hoda.alkhzaimi (at) nyu.edu
More information: http://nyuad.nyu.edu/en/academics/graduate-programs/engineering.html
University of Westminster, Department of Computer Science
Job PostingThe 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: 5004699
- Salary: £33,387 to £38,489 per annum
- Contract: Fixed Term until June 2019
- Closing date: 9th January 2017
Closing date for applications: 9 January 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: https://vacancies.westminster.ac.uk/hrvacancies/default.aspx?id=50046999
Schibsted ASA
Job PostingWe’re reinventing ourselves. We’re completely rethinking our publishing products and global components in order to better engage with our users and provide amazing experiences across different Schibsted applications and across any device. We have access to the biggest and best brands in publishing in Scandinavia, a dynamic user base that numbers in the millions, and the freedom to break away from any and all technical legacy. There’s a blank page in front of us. We want you to come help us fill it.
Users are expecting more personalized services and we need to collect users data in order to provide those services, and we need to do this in a way that the user is in control. In order to accelerate and pave the way for new privacy functionality we are building a set of privacy enhancing technologies (PETs). We aim to build these technologies in conjunction with our privacy goal of maximizing the information utility while minimizing the privacy risks and being compliant with data protection laws.
As a member of the privacy engineering team, you will design, implement, test and launch PETs that can be reused or integrated across various components and Schibsted sites. These PETs are built in collaboration with other engineering, legal and privacy product teams. Examples of these PETs include privacy policy engine, user managed access, automated data inventories, automated privacy reviews and differential privacy as well as anonymization processes.
Closing date for applications: 15 February 2017
Contact: Rafik Laatiaoui
Technical Recruiter at SPT
rafik.laatiaoui (at) schibsted.com
Mobile: 0047 413 71 266
More information: https://jobs.lever.co/schibsted/522739a7-1e0f-4e75-ab46-e0206b5e4aaf
Mid Sweden University
Job PostingClosing date for applications: 17 January 2017
Contact: Prof. Mikael Gidlund
Mid Sweden University
Dept. of Information and Communication Systems
SE-851 70 Sundsvall, Sweden
More information: https://www.miun.se/en/University/career/jobs/vacancy/postdoktor-sakerhet-och-integritet-for-natverkande-cyberfysikalisk
04 December 2016
Oxford, UK, 20 March - 24 March 2017
Event CalendarAsiacrypt
02 December 2016
Ralph Ankele, Subhadeep Banik, Avik Chakraborti, Eik List, Florian Mendel , Siang Meng Sim, Gaoli Wang
ePrint ReportJung Hee Cheon, Duhyeong Kim, Joohee Lee, Yongsoo Song
ePrint ReportIn this paper, we propose a novel PKE without relying on either of them. For encryption, we first combine several LWE instances as in the previous LWE-based PKEs. However, the following step to re-randomize this combination before adding a message is different: remove several least significant bits of ciphertexts rather than inserting errors. We prove that our scheme is IND-CPA secure under the hardness of LWE and can be converted into an IND-CCA scheme in the quantum random oracle model.
Our approach accelerates encryption speed to a large extent and also reduces the size of ciphertexts. The proposed scheme is very competitive for all applications requiring both of fast encryption and decryption. In our single-core implementation in Macbook Pro, encryption and decryption of a 128-bit message for quantum 128-bit security take 7 and 6 microseconds that are 3.4 and 4.2 times faster than those of NTRU PKE, respectively. To achieve these results, we further take some advantage of sparse small secrets, under which the security of our scheme is also proved.
Koksal Mus, Mehmet Sabir Kiraz, Murat Cenk, Isa Sertkaya
ePrint ReportAbu Dhabi, UAE, 2 April 2017
Event CalendarSubmission deadline: 20 January 2017
Notification: 15 February 2017
Universitat Pompeu Fabra, Barcelona, Spain
Job PostingThe successful candidate will be funded by the INPhINIT “la Caixa” Marie Curie PhD Fellowships Programme. Only outstanding candidates which satisfy international mobility criteria will be considered (i.e. the applicant should not have resided or carried out their main
activity in Spain for more than 12 months in the 3 years immediately prior to the recruitment date).
The contract will be for 3 years with a gross salary of €34,800, plus other advantages.
The candidate should hold or be about to receive a master\'s degree by September 2017 in computer science, mathematics or a related area. Specialization in cryptography (demonstrated by a relevant MSc) will be positively evaluated.
Further enquiries about the project and conditions should be sent to cryptophdapplications (at) upf.edu. Applicants are required to fill the application form in the link below.
Closing date for applications: 31 January 2017
Contact: Dr. Vanesa Daza and Dr. Carla Ràfols
Department of Information and Communication Technologies
Pompeu Fabra University
cryptophdapplications (at) upf.edu
More information: https://docs.google.com/forms/d/e/1FAIpQLSc4eBYAxoyx2Tt_O1NOehQAzrnDl2X9M30FokD1yO8pjCPs0g/viewform
01 December 2016
Hiroshima, Japan, 30 August - 1 September 2017
Event CalendarSubmission deadline: 3 March 2017
Notification: 10 May 2017