IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
20 February 2019
Siddhartha Jayanti, Srinivasan Raghuraman, Nikhil Vyas
In this work, we first derive message protocols which are efficient with respect to the total number of computations done across the network. We use this result to show an abundance of networks with $d = O(1)$ that are resilient to $t = O(n)$ random corruptions. This randomized result helps us build networks which are resistant to worst-case adversaries. In particular, we improve the state of the art in the almost everywhere reliable message transmission problem in the worst-case adversary model by showing the existence of an abundance of networks that satisfy $d = O(\log n)$ for $t = O(n)$, thus making progress on this question after nearly a decade. Finally, we define a new adversarial model of corruptions that is suitable for networks shared amongst a large group of corporations that: (1) do not trust each other, and (2) may collude, and construct optimal networks achieving $d = O(1)$ for $t = O(n)$ in this model.
Matthew Walters, Sujoy Sinha Roy
In this work we analyze the decoding algorithm of the BCH code and design a constanttime version of the BCH decoding algorithm. To study the computational overhead of the countermeasures, we integrated our constant-time BCH code in the reference and optimized implementations of the LAC scheme and observed nearly 1.1 and 3.0 factor slowdown respectively for the CCA-secure primitives.
Poulami Das, Lisa Eckey, Tommaso Frassetto, David Gens, Kristina Hostáková, Patrick Jauernig, Sebastian Faust, Ahmad-Reza Sadeghi
Emmanuela Orsini, Nigel P. Smart, Frederik Vercauteren
To accomplish this we introduce a special packing technique for the BGV encryption scheme operating on the plaintext space defined by the SPDZ2k protocol, extending the ciphertext packing method used in SPDZ to the case of $Z_{2^k}$. We also present a more complete pre-processing phase for secure computation modulo $2^k$ by adding a new technique to produce shared random bits. These are needed in a number of online protocols and are quite expensive to generate using the MASCOT-based method given in the original SPDZ2k paper.
Our approach can be applied to both the Low-Gear and High-Gear variant of Overdrive, and it leads to a protocol whose overall efficiency is three to six times better than the OT-based methodology.
Duhyeong Kim, Yongha Son, Dongwoo Kim, Andrey Kim, Seungwan Hong, Jung Hee Cheon
Peter Schwabe, Bas Westerbaan
Tung Chou
Jiang Zhang, Yu Yu, Shuqin Fan, Zhenfeng Zhang
Ariel Gabizon
Jian Guo, Guohong Liao, Guozhen Liu, Meicheng Liu, Kexin Qiao, Ling Song
19 February 2019
Mons, Belgium, 23 June - 26 June 2019
Submission deadline: 22 March 2019
Notification: 17 May 2019
Atlanta, USA, 14 July - 17 July 2019
Submission deadline: 15 March 2019
Notification: 15 April 2019
Copenhagen, Denmark, 14 July - 17 July 2019
Submission deadline: 1 March 2019
Notification: 14 April 2019
McLean, VA, USA, 25 September - 27 September 2019
Submission deadline: 8 April 2019
Notification: 10 June 2019
NEW YORK, United States, 31 May - 2 June 2019
Submission deadline: 1 April 2019
Notification: 22 April 2019
17 February 2019
University of Bergen, Bergen
We are particularly interested in applicants who are highly motivated to contribute to cryptographic privacy-enhancing technologies, blockchain technology, lattice/code-based cryptography, and coding theory.
We can offer:
- a good and professionally challenging working environment
- salary at pay grade 51 (Code 1017/Pay range 20, alternative 9) in the state salary scale. This constitutes a gross annual salary of NOK 449 400. Further promotions are made according to the length of service in the position.
- enrolment in the Norwegian Public Service Pension Fund
- Good welfare benefits (https://www.uib.no/en/foremployees/30808/welfare)
Closing date for applications: 10 March 2019
Contact: Chunlei Li (chunlei.li (at) uib.no)
More information: https://www.jobbnorge.no/en/available-jobs/job/165213/phd-position-in-cryptography-and-data-security
CISPA Helmholtz Center for Information Security
Yang (https://yangzhangalmo.github.io/) is a research group leader at CISPA Helmholtz Center for Information Security. Previously, he was a postdoc working with Michael Backes at CISPA from January 2017 to December 2018. CISPA located at Saarbruecken, Germany, is the newest member of the Helmholtz Association, the largest scientific organization in Germany fully committed to scientific excellence and to tackling the grand research challenges in their respective fields. CISPA as the first investment of Helmholtz in computer science is one of the top research centers in information security, it is constantly ranked top-3 in the field worldwide, see csrankings.org.
Requirements:
- A bachelor/master degree in Computer Science, Information Security, Mathematics with excellent grades
- Excellent programming skills
- Excellent English
- Good knowledge about machine learning
What we offer:
- Full-time working contract (E13 level salary)
- Excellent research environment
- Strong supervision
To apply, please send your CV to yang.zhang (at) cispa.saarland
Closing date for applications: 1 June 2019
Contact: Yang Zhang, research group leader, yang.zhang (at) cispa.saarland
Royal Holloway University of London
The PDRA will work alongside Prof. Carlos Cid, Dr. Martin Albrecht and other cryptographic researchers at Royal Holloway on topics connected to the design and analysis of cryptographic key exchange protocols that support incorporating key material from diverse sources. This post is part of the AQuaSec project, a Innovate UK-funded research project with 17 partners from industry and academia, aiming to develop technologies for quantum-safe communications by integrating post-quantum cryptography with techniques from quantum cryptography.
Applicants for this role should have already completed, or be close to completing, a PhD in a relevant discipline, with an outstanding research track record in cryptography. Experience in cryptographic protocol design is a plus.
Established in 1990, the Information Security Group at Royal Holloway was one of the first dedicated academic groups in the world to conduct research and teaching in information security. The ISG is today a world-leading interdisciplinary research group with 20 full-time members of staff, several postdoctoral research assistants and over 50 PhD students working on a range of subjects in cyber security, in particular cryptography. The post is based in Egham, Surrey where Royal Holloway is situated in a beautiful, leafy campus near to Windsor Great Park and within commuting distance from London.
Closing date for applications: 12 March 2019
Contact: Informal enquiries about this position can be made to Prof. Carlos Cid (carlos.cid AT rhul.ac.uk)
More information: https://jobs.royalholloway.ac.uk/vacancy.aspx?ref=0219-048
TU Wien
Candidates with a research background in the following areas are particularly invited to apply:
- Formal methods for security and privacy;
- Intersection between Machine Learning and security and privacy;
- Blockchain technologies;
- Web security.
TU Wien has about 20,000 students and a heavy emphasis on research. The Faculty of Informatics comprises about 3,000 students and is the largest one in Austria. Vienna hosts several outstanding research institutes (including IST Austria, AIT, SBA, RIAT) with a strong focus on security and privacy and a long-standing collaboration track.
The postdoctoral researcher salary is highly competitive and ruled by level B1 of the Austrian Collective Agreement for the university staff, currently amounting to EUR 3.711,10 per/month/gross (14 times a year).
Finally, Vienna has repeatedly been ranked number 1 worldwide in the Mercer Quality of Living Survey.
TU Wien is committed to increasing female employment in leading scientific positions. Female applicants are explicitly encouraged to apply, and preference will be given to female applications when scientifically equally qualified.
Expressions of interest should be submitted by e-mail to christopher.vomastek (at) tuwien.ac.at and include in a single pdf
• A cover letter stating the candidate\'s motivation to apply, and the reason(s) why they should be selected for the position;
• A CV;
• A short research statement;
• Three most significant publications;
• The contact details of two referees.
Expressions of interest submitted by February 25, 2019 will receive full consideration.
Closing date for applications: 25 February 2019
Contact: Univ.-Prof. Dr. Matteo Maffei, matteo.maffei (at) tuwien.ac.at