IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
18 November 2022
President:
Michel Abdalla: 584
Vice-President:
Allison Bishop: 561
Treasurer:
Brian LaMacchia: 573
Secretary:
Benjamin Wesolowski: 563
Directors:
Shai Halevi: 274
Tal Malkin: 233
Bart Preneel: 364
Francisco Rodríguez Henríquez : 186
Peter Schwabe: 364
Hoeteck Wee : 233
Support for the creation of the IACR Communications in Cryptology:
Yes: 491, No: 128
Election verification data can be found at https://vote.heliosvoting.org/helios/e/IACR2022.
The election committee congratulates all elected members and thanks all candidates for their contributions to the IACR and willingness to serve.
17 November 2022
Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida
We implemented our sorting protocol with different optimizations and achieved concretely fast performance. For example, sorting one million items with 32-bit keys and 32-bit values takes less than 2 seconds with semi-honest security and about 3.5 seconds with malicious security. Finding the heavy hitters among hundreds of thousands of 256-bit values takes only a few seconds, compared to close to an hour in previous work.
Pratish Datta, Tapas Pal, Katsuyuki Takashima
Melissa Chase, Michele Orrù, Trevor Perrin, Greg Zaverucha
Valeria Nikolaenko, Sam Ragsdale, Joseph Bonneau, Dan Boneh
Arghya Bhattacharjee, Avik Chakraborti, Nilanjan Datta, Cuauhtemoc Mancillas-López, Mridul Nandi
Liliya Akhmetzyanova, Evgeny Alekseev, Alexandra Babueva, Andrey Bozhko, Stanislav Smyshlyaev
Sigurd Eskeland, Ahmed Fraz Baig
Katherine E. Stange
Fengrong Zhang, Enes Pasalic, Amar Bapić, Baocang Wang
Christoph U. Günther, Sourav Das, Lefteris Kokoris-Kogias
In this work, we tackle this problem and give two practical constructions for Asynchronous Proactive Secret Sharing. Our first construction uses recent advances in asynchronous protocols and achieves a communication complexity of $O(n^3)$ where $n$ is the total number of nodes in the network. The second protocol builds upon the first and uses sortition to drive down the communication complexity to $O(c n^2)$. Here, $c$ is a tunable parameter that controls the expected size of the sharing committee chosen using the existing random coin.
Additionally, we identify security flaws in prior work and ensure that our protocols are secure by giving rigorous proofs. Moreover, we introduce a related notion which we term Asynchronous Refreshable Secret Sharing — a functionality that also re-randomizes the secret itself. Finally, we demonstrate the practicability of our constructions by implementing them in Rust and running large-scale, geo-distributed benchmarks.
Kwan Yin Chan, Tsz Hon Yuen
Radical Semiconductor; Pasadena, CA
We are looking for highly-skilled, motivated, interdisciplinary, and diverse team members to help us build our very first custom OS, compiler stack, and cryptographic suite to run on our novel hardware. As an engineer in the earliest stages of Radical, your voice will be heard, and your decisions will impact the hardware that will one day end up in everyone’s wallet.
As an applied cryptographer, you will work directly with Radical’s VP of Information Security and CTO to develop a custom instruction set for implementing cryptographic algorithms, construct a compiler and simulator toolchain targeting this instruction set, and implement and optimize cryptographic algorithms using this toolchain. You will work closely with both the hardware and software design teams to create designs that offer high cryptographic agility with a small power and area footprint.
For full details, see our job posting under the "Jobs" tab at the link below.
Closing date for applications:
Contact: For applying, visit the link above. For any questions or hiring recommendations, reach out to katie@radicalsemiconductor.com.
More information: https://jobs.radicalsemiconductor.com
Rutgers University, DIMACS Center, Piscataway, NJ, USA
Closing date for applications:
Contact: Christine Spassione
More information: https://go.rutgers.edu/dimacsdeputy
16 November 2022
Tampere University, Unit of Computing Sciences, Tampere, Finland
Closing date for applications:
Contact: For more information, please contact: Professor Timo Hämäläinen, Computing Sciences Unit, timo.hamalainen@tuni.fi, tel. +358408490777 With questions related to the recruitment process, please contact HR specialist Meri Pere, meri.pere@tuni.fi.
More information: https://bit.ly/3UG3A2k
TU Wien
The selection follows a two-stage process: In stage one applicants apply for a tenure-track professorship at TU Wien (deadline 15 December 2022). In stage two, applicants apply for a WWTF grant together with a proponent of the applicant’s choice from TU Wien (deadline 15 March 2023).
The 14th Vienna Research Groups for Young Investigators call 2023 (https://wwtf.at/funding/programmes/vrg/#VRG23) is issued for up to three group leader positions as part of the WWTF’s Information and Communication Technology programme. WWTF especially encourages female candidates and takes unconventional research careers into consideration.
The WWTF grant amounts up to EUR 1.6 million for a total of 6-8 years. Successful candidates will be offered an Assistant-Professor position with tenure track at TU Wien.
The topics of interest include but are not limited
- intersection between machine learning and security & privacy
- usable security
- formal methods for security
- system and network security
- applied cryptography
Closing date for applications:
Contact: Matteo Maffei (first.last@tuwien.ac.at)
More information: https://www.tuwien.at/forschung/vienna-research-group-leader#c18022
University of Toronto, Department of Computer Science, Toronto, Canada
Closing date for applications:
Contact: Eitan Grinspun (recruit@cs.toronto.edu)
More information: https://web.cs.toronto.edu/employment-opportunities
Oregon State University
The cryptography research group at Oregon State University is led by Professors Mike Rosulek & Jiayu Xu. We have research interests in secure multi-party computation, password-based authentication, key agreement, and privacy-enhancing technologies.
Oregon State University is an R1 (high research activity) university, and its cryptography research group is highly rated on csrankings.org. Past graduates of the group have gone on to successful research positions in industry and academia. OSU is located in Corvallis, Oregon, a small college town (population 60k) located near Portland, the Pacific Ocean, and the Cascade Mountain range.
Students should have a BS degree in computer science or closely related technical discipline. A background in theoretical computer science and/or mathematics is preferred but not required.
Deadline for PhD applicants is December 1. Deadline for MS applicants is January 1. Interested students should select the CS degree program, and indicate an interest in the Cybersecurity research group.
For information on how to apply, see https://eecs.oregonstate.edu/academics/graduate/cs . For other questions, email rosulekm@eecs.oregonstate.edu or xujiay@oregonstate.edu
Closing date for applications:
Contact: Mike Rosulek & Jiayu Xu
More information: https://eecs.oregonstate.edu/academics/graduate/cs
Centre for Secure Information Technologies (CSIT), Queen’s University Belfast, UK
Closing date for applications:
Contact: Dr Ciara Rafferty
More information: https://www.qub.ac.uk/sites/QUBJobVacancies/ResearchJobs/