IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
26 October 2023
Ignacio Cascudo, Bernardo David
ePrint ReportWe introduce a PVSS scheme over class groups that achieves similar efficiency to state-of-the art schemes that only allow for reconstructing a function of the secret, while our scheme allows the reconstruction of the original secret. Our construction generalizes the DDH-based scheme of YOLO YOSO to operate over class groups, which poses technical challenges in adapting the necessary NIZKs in face of the unknown group order and the fact that efficient NIZKs of knowledge are not as simple to construct in this setting.
Building on our PVSS scheme's ability to recover the original secret, we propose two DKG protocols for discrete logarithm key pairs: a biasable 1-round protocol, which improves on the concrete communication/computational complexities of previous works; and a 2-round unbiasable protocol, which improves on the round complexity of previous works. We also add publicly verifiable resharing towards anonymous committees to our PVSS, so that it can be used to efficiently transfer state among committees in the YOSO setting. Together with a recent construction of MPC in the YOSO model based on class groups (Braun et al. CRYPTO'23), this results in the most efficient full realization (i.e without assuming receiver anonymous channels) of YOSO MPC based on the CDN framework with transparent setup.
Kosuke Sakata, Tsuyoshi Takagi
ePrint ReportXiaopeng Zheng, Hongbo Li, Dingkang Wang
ePrint ReportApostolos Tzinas, Srivatsan Sridhar, Dionysis Zindros
ePrint ReportAmund Askeland, Svetla Nikova, Ventzislav Nikov
ePrint ReportAlessandro Chiesa, Ziyi Guan, Shahar Samocha, Eylon Yogev
ePrint ReportKnown constructions of PCD are obtained by recursively-composing SNARKs or related primitives. Unfortunately, these constructions do not come with security analyses that yield useful concrete security bounds, leaving practitioners in the dark about how to securely instantiate PCD constructions.
In this work we study the concrete security of recursive composition, with the goal of enabling practitioners to set efficient parameters for certain PCD constructions of practical interest. Our main result is that PCD obtained from SNARKs with \emph{straightline knowledge soundness} has essentially the same security as the underlying SNARK. In this setting, recursive composition incurs no security loss.
We describe how straightline knowledge soundness is achieved by SNARKs in several oracle models, including SNARKs that are deployed in practice. Crucially, SNARKs in these settings can be \emph{relativized}, allowing us to construct PCD without instantiating the SNARK's oracle explicitly. This results in a highly efficient security analysis of PCD that makes black-box use of the SNARK's oracle.
As a notable application, our work offers an idealized model that provides useful, albeit heuristic, guidance for setting the security parameters of \emph{recursive STARKs} currently used in blockchain systems.
Chenglian Liu, Sonia Chien-I Chen
ePrint ReportRicardo Jose Menezes Maia, Dustin Ray, Sikha Pentyala, Rafael Dowsley, Martine De Cock, Anderson Nascimento, Ricardo Jacobi
ePrint ReportSofiane Azogagh, Victor Deflour, Marc-Olivier Killijian
ePrint ReportJohannes Mono, Tim Güneysu
ePrint ReportThis work closes this gap, formally exploring the parameter space for BGV-like key switching. We introduce a new asymptotic bound for key switching complexity, thereby providing a new perspective on this crucial operation. We also explore the parameter space for the recently proposed double-decomposition technique by Kim et al. [24], which outperforms current state-of-the-art only in very specific circumstances. Furthermore, we revisit an idea by Gentry, Halevi, and Smart [19] switching primes in and out of the ciphertext and find novel opportunities for constant folding, speeding up key switching by up to 50% and up to 11.6%, respectively.
Zuodong Wu, Dawei Zhang, Yong Li, Xu Han
ePrint Report24 October 2023
Oxford, United Kingdom, 12 June - 14 June 2024
Event CalendarSubmission deadline: 19 January 2024
Notification: 15 March 2024
Toronto, Canada, 24 March 2024
Event CalendarLeuven, België, 17 January - 19 January 2024
Event CalendarIsla Vista, USA, 18 August - 22 August 2024
CRYPTOAbu Dhabi, United Arab Emirates, 5 March - 8 March 2024
Event CalendarSubmission deadline: 11 November 2023
Notification: 10 December 2023
Université de Lorraine, Nancy, France
Job PostingTwo assistant professor (maître de conférences) positions in computer science will open at University of Lorraine in Spring 2024, with the common topic of security and safety. Hired persons will conduct their research on these topics within one of the teams of the Loria research lab [1] (Nancy). Teaching will take place at Mines Nancy for one of the two positions, and Polytech Nancy for the other one. At Mines Nancy, the hired person may choose to teach entirely in English.
All relevant detailed information about these positions will be posted online in due time.
Potential applicants are encouraged to reach out well in advance.
IMPORTANT (in particular for foreign applicants) Applicants must enter the "qualification" process [2] before Nov. 10, 4pm, in order to apply. The application deadline is in March 2024.
Newly hired assistant professors typically have a reduced teaching load for at least the first year.
Links:
- [1] https://www.loria.fr/
- [2] https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/cand_qualification_droit_commun.htm
Closing date for applications:
Contact: Emmanuel.Thome@loria.fr
Chair of IT Security, Brandenburg University of Technology
Job PostingOur chair performs research and teaching in the area of IT Security with a strong focus on Network Security and Online Privacy. Our goal is to advance the state of the art in research and to educate qualified computer scientists in the area of IT Security who are able to meet the challenges of the growing demand on securing IT Systems and provide data protection in various areas of our life and society. More information about us can be found at https://www.b-tu.de/en/fg-it-sicherheit.
Tasks:
- Active research in the area of intrusion detection systems (IDS) for critical infrastructures, secure cyber-physical systems, and artificial intelligence / machine learning for traffic analysis
- Implementation and evaluation of new algorithms and methods
- Cooperation and knowledge transfer with industrial partners
- Publication of scientific results
- Assistance with teaching
Requirements:
- Master’s degree (or equivalent) and PhD degree (only for PostDocs) in Computer Science or related disciplines
- Strong interest in IT security and/or networking and distributed systems
- Knowledge of at least one programming language (C++, Java, etc.) and one scripting language (Perl, Python, etc.) or strong willingness to quickly learn new programming languages
- Linux/Unix skills
- Knowledge of data mining, machine learning, statistics and result visualization concepts is of advantage
- Excellent working knowledge of English; German is of advantage
- Excellent communication skills
- A detailed Curriculum Vitae
- Transcript of records from your Master studies
- An electronic version of your Master thesis, if possible should be sent in a single PDF file as soon as possible, but not later than 09.11.2023 at itsec-jobs.informatik@lists.b-tu.de.
Closing date for applications:
Contact:
Applications should be sent in a single PDF file till 09.11.2023 at itsec-jobs.informatik@lists.b-tu.de
Applications sent to email addresses other than that will be automatically discarded.
More information: https://www.b-tu.de/fg-it-sicherheit
Nanyang Technological University, School of Electrical and Electronic Engineering
Job PostingResponsibilities
The applicant is expected to possess an international reputation as a technological leader in the areas of quantum security technologies such as Quantum Cryptanalysis, Post-quantum Cryptography (PQC), Quantum Key Distribution Systems, Quantum-safe Communication and Privacy-preserving Computing, etc., and has an excellent record of distinguished academic and scholarly achievements in at least one area within quantum-safe cryptography or quantum communication system security. The job holder is expected to play a leading role to grow new capabilities, nurture innovative ideas and develop strategies jointly with other faculty members to attract funding and resources in the relevant areas of research.
Requirements
- A relevant PhD from a reputable university
- Extensive research and teaching experience in Computing, Communication and Data Space Security and Trust.
- Successful track record of academic/research leadership and team building
- Experience in cross-disciplinary research initiatives and collaboration
- Well-developed understanding of the priorities, operation and strategies of relevant funding bodies
- Strong network and ties with renowned international entities and organisations
- Internationally acclaimed with presentations such as plenary and/or keynote addresses at flagship conferences and prestigious journal publications.
Application (cover letter, detailed CV including publication list, research and teaching statements, citation report, and/or any other documents) can be submitted through the NTU Workday career portal https://ntu.wd3.myworkdayjobs.com/Careers/job/NTU-Main-Campus-Singapore/Professor--Tenured--in--Quantum-Sovereignty-and-Resilience--QUASAR--_R00015067.
Only shortlisted candidates will be notified.
Closing date for applications:
Contact: Prof Chang Chip Hong
More information: https://ntu.wd3.myworkdayjobs.com/Careers/job/NTU-Main-Campus-Singapore/Professor--Tenured--in--Quantum-Sovereignty-and-Resilience--QUASAR--_R00015067/apply
University of Innsbruck
Job PostingThe University of Innsbruck is located in the heart of the Alps, in the capital city of the Austrian state of Tyrol. The Security and Privacy Lab is engaged in research on a range of topics, including cryptography, privacy enhancing technologies (PETs) and digital currencies. Our working language is English.
How to apply? Formal application must be submitted via https://lfuonline.uibk.ac.at/public/karriereportal.details?asg_id_in=13843
Inquiries regarding the position and application to: arnab.roy[AT]uibk.ac.at
Closing date for applications:
Contact: Dr. Arnab Roy
More information: https://informationsecurity.uibk.ac.at/pdfs/vacancies/vacancy_note_MIP-13843.pdf