IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
18 December 2019
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni
ePrint ReportWe present constructions of ZAPs and NIWI for AM from Minicrypt and worst-case assumptions. We also present (a form of) NIZK with uniform soundness for NP, from Minicrypt and worst-case assumptions. We present analogous fine-grained constructions of all of the above, where the zero- knowledge adversary is limited to NC1. Specifically, we achieve fine-grained ZAPs and NIWI for NP from worst-case assumptions only and achieve a form of fine-grained NIZK with uniform soundness for NP from worst-case and Minicrypt assumptions.
Amin Rezaei, Yuanqi Shen, Hai Zhou
ePrint ReportSigurd Eskeland
ePrint ReportMorteza Adeli, Nasour Bagheri
ePrint ReportYongge Wang
ePrint ReportNorman Lahr, Ruben Niederhagen, Richard Petri, Simona Samardjiska
ePrint ReportMoni Naor, Lior Rotem, Gil Segev
ePrint ReportEquipped with our immediate key delivery property, we formalize strong notions of security for out-of-band authenticated group key exchange, and demonstrate that the existing protocols either do not satisfy our notions of security or are impractical (these include, in particular, the protocols deployed by Telegram, Signal and WhatsApp). Then, based on the existence of any passively-secure key-exchange protocol (e.g., the Diffie-Hellman protocol), we construct an out-of-band authenticated group key-exchange protocol satisfying our notions of security. Our protocol is inspired by techniques that have been developed in the context of fair string sampling in order to minimize the effect of adversarial aborts, and offers the optimal tradeoff between the length of its out-of-band value and its security.
Colin Boyd, Gareth T. Davies, Kristian Gjøsteen, Yao Jiang
ePrint ReportChitchanok Chuengsatiansup, Thomas Prest, Damien Stehlé, Alexandre Wallet, Keita Xagawa
ePrint ReportYanyan Liu, Yiru Sun
ePrint ReportClaude Crépeau, Arnaud Massenet, Louis Salvail, Lucas Stinchcombe, Nan Yang
ePrint ReportKarlsruhe Institute of Technology (KIT)
Job PostingThe "Intelligent System Security" research group at Karlsruhe Institute of Technology (KIT) is seeking to fill the position of
Two PhD Students/ Research Assistants (f/m/d)
in the field of Computer Security and Artificial Intelligence
Both positions are fully funded with the German salary level TV-L 13 (100%) and should be filled at the soonest possible date. In the beginning, the positions are limited to two years, but they offer the possibility of funding the entire duration of the PhD.
Research
Our research group works on the application of machine learning for computer security. In particular, we develop methods in the area of application security and system security, for instance, approaches for attack detection or vulnerability discovery in software and embedded devices. Also, the robustness, security, and interpretability of machine learning methods are central to our research.
Your Profile
We are looking for talented candidates that fulfill the following criteria and intend to pursue a PhD in computer science:
- Diploma or Master's degree in computer science or any related field
- Very good knowledge of computer security and/or machine learning
- Enthusiasm for conducting research on computer security
Field of Work
Possible research topics include, but are not limited to:
- The analysis of attacks and malware using machine learning
- Assisted discovery of vulnerabilities
- Fuzz Testing (Fuzzing) using machine learning
- Attacks against learning-based systems
- Explainability of machine learning in computer security
Application
Please send your application including a cover letter, your CV, and certificates/references to applications@intellisec.org. Make sure to point out why you are a good fit for us and research in computer security.
Application Deadline
12. January 2020
Closing date for applications:
Contact: Christian Wressnegger, https://intellisec.org/chris
More information: https://intellisec.de/jobs/phd-2020-en.html
Technical University of Denmark
Job PostingClosing date for applications:
Contact: Further information may be obtained Head of the Cyber Security Section Christian Damsgaard Jensen, mail: cdje@dtu.dk or Professor of Cryptology Lars Ramkilde Knudsen, mail: lrkn@dtu.dk.
More information: https://www.dtu.dk/english/about/job-and-career/vacant-positions/job?id=7b31b1b3-fb26-41cc-9852-59134bb47a9d
16 December 2019
Security & Privacy Group ( Academic Centre of Excellence in Cyber Security) University of Birmingham
Job PostingWe expect the candidates to have skills in digital circuit design (ASIC or FPGA), hardware/software implementation of algorithms, programming etc.
The Post-Doc and PhD will be working with Dr. Sujoy Sinha Roy and will be based at the Security and Privacy group of the University of Birmingham's School of Computer Science. The National Cyber Security Centre (NCSC) and the Engineering and Physical Sciences Research Council (EPSRC) jointly recognise the research group as an Academic Centre of Excellence in Cyber Security Research (ACE-CSR).
If you are interested in the Post-Doc or PhD position, please contact Dr. Sujoy Sinha Roy with a CV. For more information, please visit https://www.cs.bham.ac.uk/~sinharos/
Closing date for applications:
Contact: Dr. Sujoy Sinha Roy (s.sinharoy@cs.bham.ac.uk)
More information: https://www.cs.bham.ac.uk/~sinharos/
Linköping University, Sweden
Job PostingClosing date for applications:
Contact: Prof Jeff.Yan@liu.se
Barcelona, Espanya, 20 April - 22 April 2020
Event CalendarBin Wang, Xiaozhuo Gu, Yingshan Yang
ePrint ReportD. Papachristoudis, D. Hristu-Varsakelis, F. Baldimtsi, G. Stephanides
ePrint ReportThomas Plantard, Arnaud Sipasseuth, Willy Susilo, Vincent Zucca
ePrint ReportEshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
ePrint ReportA weak source $\mathbf{X}$ of the form $\mathbf{X}_1,...,\mathbf{X}_N$, where each $\mathbf{X}_i$ is on $n$ bits, is an $(N,K,n,k)$-source of locality $d$ if the following hold:
(1) Somewhere good sources: at least $K$ of the $\mathbf{X}_i$'s are independent, and each contains min-entropy at least $k$. We call these $\mathbf{X}_i$'s good sources, and their locations are unknown. (2) Bounded dependence: each remaining (bad) source can depend arbitrarily on at most $d$ good sources.
We focus on constructing extractors with negligible error, in the regime where most of the entropy is contained within a few sources instead of across many (i.e., $k$ is at least polynomial in $K$). In this setting, even for the case of $0$-locality, very little is known prior to our work. For $d \geq 1$, essentially no previous results are known. We present various new extractors for adversarial sources in a wide range of parameters, and some of our constructions work for locality $d = K^{\Omega(1)}$. As an application, we also give improved extractors for small-space sources.
The class of adversarial sources generalizes several previously studied classes of sources, and our explicit extractor constructions exploit tools from recent advances in extractor machinery, such as two-source non-malleable extractors and low-error condensers. Thus, our constructions can be viewed as a new application of non-malleable extractors. In addition, our constructions combine the tools from extractor theory in a novel way through various sorts of explicit extremal hypergraphs. These connections leverage recent progress in combinatorics, such as improved bounds on cap sets and explicit constructions of Ramsey graphs, and may be of independent interest.