IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
04 September 2022
CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Job PostingThe group of Prof. Dr. Cas Cremers at CISPA has multiple open positions. CISPA is one of the leading research institutions in Information Security worldwide, and is situated in Saarbrücken, Germany.
Positions are fully funded and we offer at least two year contracts with optional extension.
We have several ongoing projects in the areas of:
- Provable security : methodologies and automation (e.g., (manual) computational proofs, our work on the Tamarin Prover, or other tools),
- Protocol design, and
- Secure messaging.
We highly welcome new directions, and appreciate applicants with a passion for projects that are different from, but possibly connected to, our ongoing research.
Positions are fully funded and full-time.
Application deadline: September 22, 2022.
For more information, please click the link (title) of this job posting.
Closing date for applications:
Contact: Cas Cremers
More information: https://cispa.saarland/group/cremers/positions/index.html
CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Job PostingThe group of Prof. Dr. Cas Cremers at CISPA has open positions. CISPA is one of the leading research institutions in Information Security worldwide, and is situated in Saarbrücken, Germany.
We have several open projects in the areas of:- Provable security : methodologies and automation (e.g., (manual) computational proofs, our work on the Tamarin Prover, or other tools),
- Protocol design, and
- Secure messaging.
Positions are fully funded and full-time.
Application deadline: September 22, 2022.
For more information, please click the link (title) of this job posting.
Closing date for applications:
Contact: Cas Cremers
More information: https://cispa.saarland/group/cremers/positions/index.html
31 August 2022
Han-Bing Yu, Qun-Xiong Zheng, Yi-Jian Liu, Jing-Guo Bi, Yu-Fei Duan, Jing-Wen Xue, You Wu, Yue Cao, Rong Cheng, Lin Wang, Bai-Shun Sun
ePrint ReportHaoyu Zheng, Shengke Zeng, Hongwei Li, Zhijun Li
ePrint ReportNicolas Huber, Ralf Kuesters, Toomas Krips, Julian Liedtke, Johannes Mueller, Daniel Rausch, Pascal Reisert, Andreas Vogt
ePrint ReportSeveral e-voting systems have been proposed to address these issues by hiding (parts of) the tally. This property is called tally-hiding. Existing tally-hiding e-voting systems in the literature aim at hiding (part of) the tally from everyone, including voting authorities, while at the same time offering verifiability, an important and standard feature of modern e-voting systems which allows voters and external observers to check that the published election result indeed corresponds to how voters actually voted. In contrast, real elections often follow a different common practice for hiding the tally: the voting authorities internally compute (and learn) the full tally but publish only the final result (e.g., the winner). This practice, which we coin publicly tally-hiding, indeed solves the aforementioned issues for the public, but currently has to sacrifice verifiability due to a lack of practical systems.
In this paper, we close this gap. We formalize the common notion of publicly tally-hiding and propose the first provably secure verifiable e-voting system, called Kryvos, which directly targets publicly tally-hiding elections. We instantiate our system for a wide range of both simple and complex voting methods and various result functions. We provide an extensive evaluation which shows that Kryvos is practical and able to handle a large number of candidates, complex voting methods and result functions. Altogether, Kryvos shows that the concept of publicly tally-hiding offers a new trade-off between privacy and efficiency that is different from all previous tally-hiding systems and which allows for a radically new protocol design resulting in a practical e-voting system.
Jakob Feldtkeller, Jan Richter-Brockmann, Pascal Sasdrich, Tim Güneysu
ePrint ReportCas Cremers, Charlie Jacomme, Philip Lukert
ePrint ReportHowever, modern security protocols often contain elements for which such tools were not originally designed, such as protocols that construct, by design, terms of unbounded size, such as counters, trees, and blockchains. Protocol analysis tools such as Tamarin and ProVerif have some very restricted support, but typically lack the ability to effectively reason about dynamically growing unbounded-depth terms.
In this work, we introduce subterm-based proof techniques that are tailored for automated protocol analysis in the Tamarin prover. In several case studies, we show that these techniques improve automation (allow for analyzing more protocols, or remove the need for manually specified invariants), efficiency (reduce proof size for existing analyses), and expressive power (enable new kinds of properties). In particular, we provide the first automated proofs for TreeKEM, S/Key, and Tesla Scheme~2; and we show substantial benefits, most notably in WPA2 and 5G-AKA, two of the largest automated protocol proofs.
Milad Seddigh, Mahdi Esfahani, Sarani Bhattacharya, Mohammad Reza Aref, Hadi Soleimany
ePrint ReportLiliya Akhmetzyanova, Evgeny Alekseev, Alexandra Babueva, Stanislav Smyshlyaev
ePrint ReportZhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, Kui Ren
ePrint ReportEnes Pasalic, Amar Bapić, Fengrong Zhang, Yongzhuang Wei
ePrint ReportDaniel J. Bernstein
ePrint ReportJunichi Tomida
ePrint ReportAmit Jana, Mostafizar Rahman, Dhiman Saha
ePrint ReportSimilarly, for KATAN32, DEEPAND modeling improves the 42-round trail with $2^{-11}$ probability to $2^{-7}$. DEEPAND seems to capture the underlying correlation better when multiple AND gates are at play and can be adapted to other classes of ciphers as well.
Orr Dunkelman, Eran Lambooij, Shibam Ghosh
ePrint ReportSenpeng wang, Dengguo Feng, Bin Hu, Jie Guan, Tairong Shi
ePrint ReportCHES
We welcome proposals of challenge organisation for CHES 2023.
Interested? Please refer to the call: https://ches.iacr.org/2023/challenge.php
Gainesville, United States, 1 May - 4 May 2023
Event CalendarKarlsruhe Institute of Technology, Germany
Job PostingYou 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 proofs, etc.) and their efficient implementation (e.g., a demonstrator). The contract will initially be limited to 1 year, but can be extended to several years (particularly for PhD candidates).
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 (PI at KASTEL)
More information: https://zentrum.kastel.kit.edu/english/index.php
Institute of Science and Technology Austria (ISTA)
Job PostingISTA invites applications for several open positions in all areas of computer science including cryptography, systems security and privacy.
We offer:
- A highly international and interdisciplinary research environment with English as working language on campus
- State-of-the-art facilities and scientific support services
- Substantial start-up package and attractive salary
- Guaranteed annual base funding including funding for PhD students and postdocs
- An international Graduate School with high admissions criteria and a rigorous training program
- Leadership program
- Employee Assistance program
- Dual Career support packages
- Child-care facilities on campus (for children aged 3 months till school age)
ISTA is an international institute dedicated to basic research and graduate education in the natural, mathematical, and computational sciences. The Institute fosters an interactive, collegial, and supportive atmosphere, sharing space and resources between research groups whenever possible, and facilitating cross-disciplinary collaborations.
Assistant professors receive independent group leader positions with an initial contract of six years, at the end of which they are reviewed by international peers. If the evaluation is positive, an assistant professor is promoted to a tenured professor.
Candidates for tenured positions are distinguished scientists in their respective research fields and typically have at least six year of experience in leading a research group.
ISTA values diversity and is committed to equal opportunities. We strive to increase the number of women, particularly in fields where they are underrepresented, and therefore we strongly encourage female researchers.
Please apply online at: www.ista.ac.at/jobs/faculty
The closing date for applications is October 27, 2022.
Closing date for applications:
Contact:
Prof. Krzysztof Pietrzak (pietrzak@ista.ac.at) or Prof. Lefteris Kokoris Kogias (ekokoris@ista.ac.at)