IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
05 December 2021
Fez, Morocco, 18 July - 20 July 2022
Submission deadline: 25 February 2022
Notification: 22 April 2022
Bristol, United Kingdom, 8 August - 12 August 2022
Submission deadline: 25 February 2022
Notification: 23 May 2022
University of Southern Queensland
Closing date for applications:
Contact: To find out more about this opportunity, please contact Dr Zhaohui Tang on +61 7 4631 2464 or Zhaohui.Tang@usq.edu.au.
North Carolina State University
Closing date for applications:
Contact: Aydin Aysu
Ruhr-Universitaet, Faculty of Computer Science, Bochum, Germany
The Horst Görtz Institute for IT Security (HGI) in Bochum, Germany is one of the most renowned institutes in the field of IT Security in Europe. The Horst Görtz Institute for IT Security (HGI) in Bochum, Germany is one of the most renowned institutes in the field of IT Security in Europe. The HGI hosts 26 faculty members, maintains extensive networks and has produced numerous successful start-ups. HGI is home to the Cluster of Excellence "CASA: Cyber Security in the Age of Large-Scale Adversaries", funded with approximately 30 million euros. This outstanding environment offers excellent working conditions in a highly topical and exciting field. In addition, there is a very good working atmosphere in a young and diverse group of researchers. The Faculty of Computer Science at Ruhr-Universität Bochum invites applications for a tenured Full Professorship for System Security. Applicants should have an excellent track record in research and teaching in at least one of the following areas:
- OS and software security
- Network and distributed systems security
- Malware analysis
- Analysis of network and security protocols
- Security analysis of hardware designs and binaries
- Machine learning and security.
We are looking for a scientist with an internationally visible research profile, who complements existing focus areas. We expect a willingness to cooperate with the Horst Görtz Institute for IT Security as well as an active role in current and planned projects, especially in the Cluster of Excellence "CASA: Cyber Security in the Age of Large Scale Adversaries". The Max Planck Institute for Security and Privacy offers additional possibilities for collaboration. The working language is English. Fluent German is not a prerequisite for a successful engagement at HGI. The official job add can be found here. Applications with the usual documents are requested by January 10, 2022 to the Dean of the Faculty of Computer Science at Ruhr-Universität Bochum, Alexander May, e-mail: career@casa.rub.de . Further information can be found here: https://informatik.rub.de/en/ https://casa.rub.de/en/Closing date for applications:
Contact: Alexander May, Dean of the Faculty of Computer Science at Ruhr-Universität Bochum
More information: https://informatik.rub.de/en/
Fraunhofer AISEC, Garching (near Munich), Germany
The work covers different aspects in the areas the design of new physical structures for tamper protection and PUF primitives, characterization of the structures, design of measurement circuits, research on attacks and countermeasures, system design, development of firmware, and statistical assessments, depending on the background of the candidate.
The candidate must hold a master's degree in electrical engineering, security, physics, or a related field, and have at least intermediate German language levels (B2). The position supports the candidate to work towards a PhD in collaboration with the Technical University of Munich.
If you are interested, please apply via the following link: https://www.aisec.fraunhofer.de/de/jobs/wissenschaftliche-stellen/aisec-2021-6.html
Closing date for applications:
Contact: Matthias Hiller (matthias.hiller@aisec.fraunhofer.de)
Aalto University, Department of Computer Science, Espoo, Finland
The Department of Computer Science (https://www.aalto.fi/en/department-of-computer-science) is home to world-class research in modern computer science, combining research on foundations and innovative applications. An international community with 47 professors and more than 400 employees from 45 countries, it is the largest department at Aalto University and the largest computer science unit in Finland. The department consistently ranks high in global rankings, for example,1st in Northern countries and 56th worldwide in Times Higher Education subject ranking 2020. Diversity is part of who we are, and we actively work to ensure our community’s diversity and inclusiveness. We warmly encourage qualified candidates from all backgrounds to join our community. We offer competitive salaries and start-up packages to new faculty. The contract includes occupational health benefits. For international hires, we offer relocation services.
Closing date for applications:
Contact: Please contact Associate Professor Casper Lassenius or in recruitment process related questions HR Coordinator Laura Kuusisto-Noponen; emails firstname.lastname@aalto.fi.
More information: https://aalto.wd3.myworkdayjobs.com/en-US/aalto/job/Otaniemi-Espoo-Finland/Assistant-or-Associate-Professors-in-Computer-Science_R32265
NTT Research, Sunnyvale, CA
Closing date for applications:
Contact: To apply and for further details see https://careers.ntt-research.com/cis
University of South Florida
Candidates must possess a PhD by the start date. We welcome applications from candidates with a background in mathematical cryptology (in particular: cryptography based on (ideal) lattices, isogenies, and codes).
The position carries a teaching load of 3 courses a year (within the Maths & Stats department). The initial contract is for 1 year, and may be renewed for up to 2 additional years based on satisfactory performance in both research and teaching.
The successful candidate will collaborate with the members of the newly created USF Center for Cryptographic Research (https://www.usf-crypto.org/).
Additional details, and application link are available here: https://www.mathjobs.org/jobs/list/19124
Closing date for applications:
Contact: Jean-Francois Biasse or Giacomo Micheli (see USF's webpage for contact information: http://math.usf.edu/)
More information: https://www.mathjobs.org/jobs/list/19124
University of Toronto, Department of Computer Science; Toronto, Canada
Closing date for applications:
Contact: Eitan Grinspun
More information: https://academicjobsonline.org/ajo/jobs/19687
Tako Boris Fouotsa, Christophe Petit
In this paper, firstly, we propose a new countermeasure to the GPST adaptive attack on SIDH. Our countermeasure does not require key disclosure as in SIKE, nor multiple parallel instances as in k-SIDH. We translate our countermeasure into a key validation method for SIDH-type schemes. Secondly, we use our key validation to design HealSIDH, an efficient SIDH-type static-static key interactive exchange protocol. Thirdly, we derive a PKE scheme SHealS using HealSIDH. SHealS uses larger primes compared to SIKE, has larger keys and ciphertexts, but only $4$ isogenies are computed in a full execution of the scheme, as opposed to $5$ isogenies in SIKE. We prove that SHealS is IND-CPA secure relying on a new assumption we introduce and we conjecture its IND-CCA security. We suggest HealS, a variant of SHealS using a smaller prime, providing smaller keys and ciphertexts.
As a result, HealSIDH is a practically efficient SIDH based (interactive) key exchange incorporating a "direct" countermeasure to the GPST adaptive attack.
Vladimir Sedlacek, Jesús-Javier Chi-Domínguez, Jan Jancar, Billy Bob Brumley
Claudio Orlandi, Divya Ravi, Peter Scholl
In this work, we study the bottleneck complexity of MPC in the preprocessing model, where parties are given correlated randomness ahead of time. We present two constructions of bottleneck-efficient MPC protocols, whose bottleneck complexity is independent of the number of parties:
1. A protocol for computing abelian programs, based only on one-way functions. 2. A protocol for selection functions, based on any linearly homomorphic encryption scheme.
Compared with previous bottleneck-efficient constructions, our protocols can be based on a wider range of assumptions, and avoid the use of fully homomorphic encryption.
Lei Xu, Huayi Duan, Anxin Zhou, Xingliang Yuan, Cong Wang
We aim to fill this gap by advancing the understanding of LAAs from a fundamental algebraic perspective. Our investigation starts by revealing that the index matrices of a plaintext database and its encrypted image can be linked by linear transformation. The invariant characteristics preserved under the transformation encompass and surpass the information exploited by previous LAAs. They allow one to unambiguously link encrypted queries with corresponding keywords, even with only partial knowledge of the database. Accordingly, we devise a new powerful attack and conduct a series of experiments to show its effectiveness. In response, we propose a new security notion to thwart LAAs in general, inspired by the principle of local differential privacy (LDP). Under the notion, we further develop a practical countermeasure with tunable privacy and efficiency guarantee. Experiment results on representative real-world datasets show that our countermeasure can reduce the query recovery rate of LAAs, including our own.
Guilherme Perin, Lichao Wu, Stjepan Picek
Sourav Das, Tom Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, Ling Ren
In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol. In a network of $n$ nodes, our ADKG protocol can tolerate up to $t
David Heath, Vladimir Kolesnikov, Stanislav Peceny
Motivated by procuring a subset in a menu of computational services or tasks, we consider GC evaluation of k-out-of-n branches, whose indices are known (or eventually revealed) to the GC evaluator E. Our stack-and-stagger technique amortizes GC computation in this setting. We retain the communication advantage of SGC, while significantly improving computation and wall-clock time. Namely, each GC party garbles (or evaluates) the total of n branches, a significant improvement over the O(nk) garblings/evaluations needed by standard SGC. We present our construction as a garbling scheme.
Our technique brings significant overall performance improvement in various settings, including those typically considered in the literature: e.g. on a 1Gbps LAN we evaluate 16-out-of-128 functions ~7.68x faster than standard stacked garbling.