IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
22 June 2018
Reynier Antonio de la Cruz Jiménez
Christina Boura, Anne Canteaut, Jérémy Jean, Valentin Suder
Dario Fiore, Elena Pagnin
Prabhanjan Ananth, Aayush Jain, Dakshita Khurana, Amit Sahai
We propose a new approach to constructing iO for general circuits. Unlike all previously known realizations of iO, we avoid the use of d-linear maps of degree $d\ge 3$.
At the heart of our approach is the assumption that a new weak pseudorandom object exists, that we call a perturbation resilient generator ($\Delta\mathsf{RG}$). Informally, a $\Delta\mathsf{RG}$ maps n integers to m integers, and has the property that for any sufficiently short vector $a\in \mathbb{Z}^m$, all efficient adversaries must fail to distinguish the distributions $\Delta\mathsf{RG}(s)$ and $(\Delta\mathsf{RG}(s)+a)$, with at least some probability that is inverse polynomial in the security parameter. We require that the $\Delta\mathsf{RG}$ be computable by degree-2 polynomials over Z. We use techniques building upon the Dense Model Theorem to deal with adversaries that have nontrivial but non-overwhelming distinguishing advantage.
As a result, we obtain iO for general circuits assuming:
- Subexponentially secure LWE
- Bilinear Maps
- $(1-1/poly(\lambda))$-secure 3-block-local PRGs
- $1/poly(\lambda)$-secure $\Delta\mathsf{RG}$s
Daniel P. Martin, Marco Martinoli
Nir Bitansky, Huijia Lin
We construct such 1ZK arguments based on the notion of multi-collision-resistant keyless hash functions, recently introduced by Bitansky, Kalai, and Paneth (STOC 2018). Relying on the constructed 1ZK arguments, subexponentially-secure time-lock puzzles, and other standard assumptions, we construct one-message fully-concurrent non-malleable commitments. This is the first construction that is based on assumptions that do not already incorporate non-malleability, as well as the first based on (subexponentially) falsifiable assumptions.
Tim Ruffing, Sri Aravinda Thyagarajan, Viktoria Ronge, Dominique Schröder
The existence of the attack does not contradict the formal security analyses of the two Zerocoin protocols but exposes the lack of an important missing property in the security model of Zerocoin. While the security definitions model that the attacker should not be able to create money out of thin air or steal money from honest users, it does not model that the attacker cannot destroy money of honest users. Fortunately, there are simple fixes for the security model and for both protocols.
Ebo van der Laan, Erik Poll, Joost Rijneveld, Joeri de Ruiter, Peter Schwabe, Jan Verschuren
Constantin-Catalin Dragan, Daniel Gardham, Mark Manulis
Hierarchical Attribute-based Signatures (HABS) introduced in this work support delegation of attributes along paths from the top-level authority down to the users while also ensuring that signatures produced by these users do not leak their delegation paths, thus extending the original privacy guarantees of ABS schemes. Our generic HABS construction also ensures unforgeability of signatures in the presence of collusion attacks and contains an extended tracebility property allowing a dedicated tracing authority to identify the signer and reveal its attribute delegation paths. We include public verification procedure for the accountability of the tracing authority.
We anticipate that HABS will be useful for privacy-preserving authentication in applications requiring hierarchical delegation of attribute-issuing rights and where knowledge of delegation paths might leak information about signers and their attributes, e.g., in intelligent transport systems where vehicles may require certain attributes to authenticate themselves to the infrastructure but remain untrackable by the latter.
Mengce Zheng
Hamid Nejatollahi, Nikil Dutt, Indranil Banerjee, Rosario Cammarota
21 June 2018
University of Amsterdam / Leiden University / Centrum Wiskunde & Informatica (CWI)
Supervision will be shared between QuSoft and Mathematisch Instituut (MI) Leiden, with Christian Schaffner (University of Amsterdam / QuSoft) and Peter Stevenhagen (MI Leiden) as main supervisors and Serge Fehr (CWI / MI Leiden / QuSoft) and Peter Bruin (MI Leiden) as co-supervisors.
You should hold a Master\'s degree (or expect to obtain this by the end of the academic year 2017/18) in computer science, mathematics or physics, with excellent grades and outstanding results, or a comparable degree.
Furthermore you should also possess:
- a strong background in cryptography, quantum algorithms and/or mathematics (relevant to post-quantum cryptography);
- demonstrated research abilities, e.g. by completion of an (undergraduate) research project;
- good academic writing and presentation skills;
- good social and organisational skills;
- full professional proficiency in spoken and written English.
See the link below for further information and for the application procedure.
Closing date for applications: 15 July 2018
Contact: Dr Christian Schaffner (c.schaffner (at) uva.nl)
More information: http://www.uva.nl/en/content/vacancies/2018/06/18-371-phd-candidate-in-quantum-cryptanalysis.html
Microsoft Research, Redmond WA, USA
Closing date for applications: 1 August 2018
Contact: Kristin Lauter
Email: klauter (at) microsoft.com
University of Lübeck, Germany
Professor for Secure Software Systems (W2)
As future holder of the position, you should bring a proven scientific track record in IT Security, especially in at least one of the following areas:
- Security of Complex and Networked Software Systems
- Anonymity and Privacy
- Operating Systems Security
- Computer Forensics
You bring along a high potential for strengthening the profile of the new Institute for IT Security through research work, project management, and the acquisition of third party funds in the field of IT Security.
Your teaching tasks include participation in the courses of the degree programs of the Department of Computer Science/Engineering, especially in the new Bachelor’s and Master’s program in IT Security.
University of Lübeck offers excellent opportunities for interdisciplinary cooperation in the key areas of Computer Science, Medical Engineering, Robotics, e-Government, Data Science, as well as the Life Sciences and Medicine. In addition, the university supports activities in technology transfer.
For a detailed description of the position as well as necessary templates and further information on the application process, please visit the link below.
Closing date for applications: 18 July 2018
Contact: Susanne Markmann,
Büro der MINT-Sektionen
Email: mint.buero (at) uni-luebeck.de
More information: https://www.uni-luebeck.de/structure/sektionen/sektionen-mint/berufungsverfahren-stellen.html
Technische Universität Darmstadt in Darmstadt, Germany
We are looking for candidates interested in working at the intersection of privacy engineering, and applied cryptography. This project addresses two central challenges in the provision of cloud services: (1) client privacy, and (2) verifiable metering and billing. For challenge (1), we design and develop anonymous communication mechanisms for the cloud. For challenge (2), we build techniques for service verification and design an infrastructure for verifiable metering and billing, enabling clients to verify in real-time their service consumption and corresponding charges. By solving and combining both challenges we obtain privacy-preserving verifiable metering and billing. Further details on the project can be found here.
The vacancy is within the Collaborative Research Center CROSSING, funded by DFG, the German Research Foundation. Collaborative Research Centers are institutions funded by the German Research Foundation (DFG) and are established at universities to pursue a scientifically ambitious, complex, longterm research program. The goal of the center CROSSING is to provide cryptography-based security solutions enabling trust in new and next generation computing environments. For more information about CROSSING please visit www.crossing.tu-darmstadt.de.
As part of its research program CROSSING will develop an opensource software called OpenCCE which will allow users to deploy the developed solutions in a secure and easy way.
Applications will be considered until the positions are filled.
Closing date for applications: 30 September 2018
Contact: Applicants are kindly requested to send their applications to staff-sit (at) crisp-da.de with the subject “Funded PhD position in CRC CROSSING” and a single pdf (< 10MB).
More information: https://www.sit.informatik.tu-darmstadt.de
20 June 2018
Toronto, Canada, 15 October 2018
Submission deadline: 25 July 2018
Notification: 15 August 2018
18 June 2018
Universite Libre de Bruxelles, Belgium
The successful applicant will work on the analysis and design of searchable encryption schemes and on data structures enabling efficient search operations on encrypted data.
Candidates shall hold a PhD degree in Computer Science or related field, should have experience in the research field of the position and should be fluent in English.
Applications must include:
- A Curriculum Vitae
- A motivation letter
- The list of publications and a copy of three selected publications
- The copies of diplomas and certificates
- Two (or more) reference letters
- The date from which the applicant will be available
Applications must be sent to olivier.markowitch (at) ulb.ac.be and stefan.langerman (at) ulb.ac.be
Closing date for applications: 1 October 2018
Contact: Olivier Markowitch, Universite Libre de Bruxelles, Computer Science Department, olivier.markowitch (at) ulb.ac.be
More information: https://qualsec.ulb.ac.be/about-2/post-doc-position/
University of Luxembourg
Shaping research directions and producing results in one or more of the following topics:
Develop and analyse quantum-safe algorithms and protocols.
Explore the incorporation of quantum-safe algorithms in a TPM architecture.
Define security properties and models for a TPM against quantum adversaries.
Coordinating research projects and delivering outputs
Collaborating with partners in the FutureTPM project
Providing guidance to PhD and MSc students
Disseminating results through scientific publications
Closing date for applications: 6 July 2018
Contact: Peer Y A Ryan, peter.ryan (at) uni.lu or Alfredo Rial, alfredo.rial (at) uni.lu
More information: http://emea3.mrted.ly/1vbm4
University of Luxembourg
Research on the following topics in quantum cryptography and information theory:
Exploring formal definitions of the notion of deniability against various threat models.
Exploring the limits of what is achievable in terms of deniability using both classical and quantum mechanisms.
Designing and analysing novel protocols and mechanisms to achieve stronger forms of deniability.
Providing guidance to M.Sc. students
Closing date for applications: 6 July 2018
Contact: P Y A Ryan, peter.ryan (at) uni.lu
More information: http://emea3.mrted.ly/1vblq