IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
16 January 2018
Hamburg, Germany, 27 August - 30 August 2018
Submission deadline: 1 April 2018
Notification: 27 May 2018
Hamburg, Germany, 27 August - 30 August 2018
Submission deadline: 16 March 2018
Notification: 30 May 2018
Pratish Datta, Tatsuaki Okamoto, Junichi Tomida
Abhinav Aggarwal, Yue Guo
Chen-Dong Ye, Tian Tian
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Foteini Baldimtsi, Sharon Goldberg, Leonid Reyzin, Omar Sagga
François Gérard, Keno Merckx
Florian Unterstein, Johann Heyszl, Fabrizio De Santis, Robert Specht, Georg Sigl
Romain Gay, Dennis Hofheinz, Lisa Kohl, Jiaxin Pan
While our scheme is still less compact than structure-preserving signature schemes \emph{without} tight security reduction, it significantly lowers the price to pay for a tight security reduction. In fact, when accounting for a non-tight security reduction with larger key (i.e., group) sizes, the computational efficiency of our scheme becomes at least comparable to that of non-tightly secure SPS schemes. Technically, we combine and refine recent existing works on tightly secure encryption and SPS schemes. Our technical novelties include a modular treatment (that develops an SPS scheme out of a basic message authentication code), and a refined hybrid argument that enables a lower security loss of \(O(\log Q)\) (instead of \(O(\lambda)\)).
15 January 2018
University College London
Closing date for applications: 12 February 2018
Contact: Sarah Meiklejohn, s.meiklejohn (at) ucl.ac.uk
More information: https://atsv7.wcn.co.uk/search_engine/jobs.cgi?owner=5041404&ownertype=fair&jcode=1707556&vt_template=965&adminview=1
CISPA – Helmholtz-Center i.G. Saarbruecken, Germany
A doctoral degree in computer science or related areas and an outstanding research track record are required. Applicants are expected to pursue an internationally visible research agenda and to build up their research team. Candidates for senior positions must be internationally renowned scientists.
The cybersecurity research center CISPA – Helmholtz Center i.G. provides a unique work environment that offers the advantages of a university department and a research laboratory alike: Faculty will be offered highly competitive research salaries and institutional funding; they enjoy academic freedom, and build and lead their team of PhD students and postdocs; they attract additional third-party funds, supervise doctoral theses, and are granted the opportunity to teach graduate and undergraduate courses. CISPA moreover offers outstanding technical infrastructure and administrative support.
CISPA is located in Saarbruecken, in the tri-border area of Germany, France, and Luxembourg. We maintain an international and diverse work environment and seek applications from outstanding researchers worldwide. The working language is English.
All applicants are strongly encouraged to submit their complete application by February 10, 2018 for full consideration. However, applications will continue to be accepted until February 28, 2018.
Qualified candidates should apply using the secure application form .
In case of any questions, please contact CISPA’s director Michael Backes at backes (at) cispa.saarland .
CISPA values diversity and is committed to equality. We provide special support for dual-career couples . Female researchers are encouraged to apply.
For more information about CISPA, see https://cispa.saarland
For further information about the Helmholtz Association, please refer to the official webpage or Wikipedia .
Closing date for applications: 28 February 2018
Contact: In case of any questions, please contact CISPA’s director Michael Backes at backes (at) cispa.saarland or Stephanie Boecker at boecker (at) cispa.saarland
More information: https://cispa.saarland/career/positions/faculty/
Singapore University of Technology and Design (SUTD), Singapore
I am looking for PhD interns with interest in cyber-physical system security (IoT, water, power grid, transportation, and autonomous vehicle etc.). The attachment will be at least 3 months. Allowance will be provided for local expenses.
Interested candidates please send your CV with a research statement to Prof. Jianying Zhou.
Contact: Prof. Jianying Zhou
Email: jianying_zhou (at) sutd.edu.sg
Closing date for applications: 31 March 2018
Contact: Prof. Jianying Zhou
More information: http://jianying.space/
Princeton, New Jersey, USA, 19 May - 25 May 2018
Submission deadline: 17 February 2018
14 January 2018
Emmanuel Prouff, Remi Strullu, Ryad Benadjila, Eleonora Cagli, Cecile Dumas
Mohammad Etemad, Mohammad Mahmoody, David Evans
Eftychios Theodorakis, John C. Mitchell
Our result implies a correspondence between the Learning With Errors (LWE) problems and both the Elliptic Curve Discrete Log problem (ECDLP) and the Discrete Logarithm (DLOG) problem. To illustrate this result, we provide a series of example transformations in the appendix. The concrete result of this paper is a prototype proof translation tool.
Christian Badertscher, Fabio Banfi, Ueli Maurer
Although introduced two decades ago, the question which security notions of signcryption are adequate in what applications has still not reached a fully satisfying answer, even for the basic ones. To address this question, we conduct a constructive analysis of this public-key primitive. Similar to previous constructive studies for other important primitives, this treatment allows to identify the natural goal that signcryption schemes should achieve and to formalize this goal in a composable language. More specifically, we capture the goal of signcryption as a gracefully-degrading secure network, which is basically a network of independent parties that allows secure communication between any two parties. However, when a party is compromised, its respective security guarantees are lost, while all guarantees for the remaining users stay unaffected. We show which security notions are sufficient to realize this kind of secure network from a certificate authority (or key registration resource) and insecure communication. As a finding of independent interest, our treatment shows that a weaker notion of the traditional insider security notion is actually sufficient.
Last but not least, our study unveils that the graceful-degradation property is actually an essential feature of signcryption that separates it from alternative and more natural constructions that achieve a secure network from the same assumptions. This shows the vital importance of the insider security notion for signcryption and strongly supports, in contrast to the initial belief, the recent trend to consider the insider security notion as the standard notion for signcryption.
Alex Biryukov, Aleksei Udovenko
Recently, Bos et al. proposed a generic attack on white-box primitives called differential computation analysis (DCA). This attack applies to most existent whitebox implementations both from academia and industry. The attack comes from side-channel cryptanalysis method. The most common method protecting against such side-channel attacks is masking. Therefore, masking can be used in white-box implementations to protect against the DCA attack. In this paper we investigate this possibility and present multiple generic attacks against masked white-box implementations. We use the term masking in a very broad sense. As a result, we deduce new constraints that any secure white-box implementation must satisfy. We suggest partial countermeasures against the attacks.
Some of our attacks were successfully applied to the WhibOx 2017 challenges.