IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
07 February 2023
Elisa Giurgea, Tudor Hutu, Emil Simion
ePrint ReportHannah Davis, Christopher Patton, MIke Rosulek, Phillipp Schoppmann
ePrint ReportWe propose a formal framework for the analysis of VDAFs and apply it to two candidate protocols. The first is based on the Prio system of Corrigan-Gibbs and Boneh (NSDI 2017). Prio is fairly mature and has been deployed in real-world applications. We prove that, with only minor changes, the current draft of the standardized version achieves our security goals. The second candidate is the recently proposed Poplar system from Boneh et al. (IEEE S\&P 2021). The deployability of Poplar is less certain. One difficulty is that the interactive step requires two rounds of broadcast messages, whereas Prio requires just one. This makes Poplar less suitable for many deployment scenarios. We show the round complexity can be improved, at the cost of higher bandwidth.
Noam Mazor
ePrint ReportPrabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu
ePrint ReportRebecca Schwerdt, Laurin Benz, Wasilij Beskorovajnov, Sarai Eilebrecht, Jörn Müller-Quade, Astrid Ottenhues
ePrint ReportDanielle Movsowitz Davidow, Yacov Manevich
ePrint ReportIrimia Alexandru-Vasile
ePrint ReportIonuț Roșca, Alexandra-Ina Butnaru, Emil Simion
ePrint ReportTudorică Radu, Rares Radu, Emil Simion
ePrint ReportCarsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen
ePrint ReportDmitrii Koshelev
ePrint ReportAdam Caulfield, Nabiha Raza, Peizhao Hu
ePrint ReportAkin Ünal
ePrint ReportConcretely, against PRGs $F : \mathbb{Z}_q^{n} \rightarrow \mathbb{Z}_q^{m}$ that are computed by polynomials of degree $d$ over a field $\mathbb{Z}_q$ and have a stretch of $m = n^{1+e}$ we give an attack with space and time complexities $n^{O(n^{1 - \frac{e}{d-1}})}$ and noticeable advantage $1 - {O(n^{1 - \frac{e}{d-1}}/{q})}$, if $q$ is large. If $F$ is of constant locality $d$ and $q$ is constant, we construct a second attack that has a space and time complexity of $n^{O(\log(n)^{\frac{1}{(q-1)d-1}} \cdot n^{1 - \frac{e}{(q-1)d-1}})}$ and noticeable advantage $1-O((\log(n)/n^e)^{\frac{1}{(q-1)d-1}})$.
Chloé Gravouil
ePrint Report06 February 2023
University of North Texas, Denton, USA
Job PostingClosing date for applications:
Contact: Please contact Drs. Stephanie Ludi (stephanie.ludi@unt.edu) or Kirill Morozov (kirill.morozov@unt.edu) for any inquiries.
More information: https://jobs.untsystem.edu/postings/68591
Inria and ENS, Paris, France
Job PostingClosing date for applications:
Contact: Phong Nguyen ( Phong.Nguyen at inria.fr )
More information: https://jobs.inria.fr/public/classic/en/offres/2022-05411
01 February 2023
Aarhus, Denmark, 9 June 2023
Event CalendarSubmission deadline: 28 February 2023
Notification: 31 March 2023
Virtual event, Anywhere on Earth, 28 February - 2 March 2023
Event CalendarKASTEL — Institute of Information Security and Dependability, KIT, Karlsruhe, Germany
Job PostingA solid background in provable security is required (for PhD students: successfully attended courses or a master’s thesis on the subject). Experiences with secure multi-party computation or UC-based security are a plus. For PostDocs, a track record in research on privacy-preserving protocols is expected, including publications at reputable conferences such as Crypto, Eurocrypt, ACM CCS, PETS, etc.
You will be a member of the KASTEL Security Research Labs (https://zentrum.kastel.kit.edu). Your research will be dealing with privacy-preserving cryptographic building blocks and protocols for important application scenarios and result in both theoretical security concepts (protocol designs, security models and proofs, etc.) and their efficient implementation. You will have the opportunity to regularly visit other reputable research institutions for IT security and cryptography such as the University of Luxembourg.
As the positions should be filled as soon as possible, your application will be evaluated promptly. If you are interested, please send an email including your CV and a list of publications (for PostDocs) to andy.rupp@partner.kit.edu.
Closing date for applications:
Contact: Andy Rupp (andy.rupp@partner.kit.edu, PI at KASTEL)
University of Bergen, Department of Informatics
Job PostingThere is a vacancy for up to 2 positions as PhD Research Fellow in Informatics – Cryptology at the Department of Informatics, University of Bergen, Norway. Both positions are funded by the university and are for a fixed-term period of 4 years.
Potential work tasks include:
- Statistical and algebraic cryptanalysis of modern block and stream ciphers
- Cryptanalysis of lattice-based postquantum cryptography protocols
- Construction of cryptographically optimal functions and related objects
The working environment for this position will be at the Selmer Center in Secure Communication. The Selmer Center is one of the top ICT research groups with main research in areas of sequence design, coding theory, cryptology, Boolean functions, information security, and quantum information theory.
The candidate should have the following qualifications:
- A master's degree or equivalent education in mathematics, computer science, or a related area
- Experience with general-purpose programming languages
- Knowledge of discrete mathematics, linear algebra and probability theory
- Knowledge of cryptographic schemes and protocols
- Proficiency in both written and oral English
We can offer:
- a good and professionally stimulating working environment
- salary as PhD research fellow (code 1017) in the state salary scale
- enrolment in the Norwegian Public Service Pension Fund
- good welfare benefits
Application deadline: March 1, 2023
To apply and for more information: https://www.jobbnorge.no/en/available-jobs/job/236961/phd-research-fellow-in-informatics-cryptology-up-to-2-positions
Closing date for applications:
Contact: Nikolay Kaleyski, Department of Informatics, University of Bergen, Norway (firstname.surname@uib.no)
More information: https://www.jobbnorge.no/en/available-jobs/job/236961/phd-research-fellow-in-informatics-cryptology-up-to-2-positions