IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
18 January 2021
Peter Kietzmann, Lena Boeckmann, Leandro Lanzieri, Thomas C. Schmidt, Matthias Wählisch
ePrint ReportTamer Mour
ePrint ReportZhongfeng Niu
ePrint ReportJan Sebastian Götte, Björn Scheuermann
ePrint ReportDavid W. Archer, Shahla Atapoor, Nigel P. Smart
ePrint ReportMadalina Bolboceanu, Zvika Brakerski, Devika Sharma
ePrint ReportIt is a known fact that an unstructured lattice can be cast as an ideal-lattice in some order of a number field (and thus, in a rather trivial sense, that ideals in orders are as general as unstructured lattices). However, it is not known whether this connection can be used to imply useful hardness results for structured lattices, or alternatively new algorithmic techniques for unstructured lattices.
In this work we show that the Order-LWE problem (a generalization of the well known Ring-LWE problem) on certain orders is at least as hard as the (unstructured) LWE problem. So in general one should not hope to solve Order-LWE more efficiently than LWE. However, we only show that this connection holds in orders that are very ``skewed'' and in particular irrelevant for cryptographic applications. We then discuss the ability to embed unstructured lattices in ``friendlier'' orders, which requires devising an algorithm for computing the conductor of relevant orders. One of our technical tools is an improved hardness result for Order-LWE, closing a gap left in prior work.
Rémi Géraud-Stewart, David Naccache
ePrint ReportThe new protocol relies upon elementary number-theoretic properties and can be implemented efficiently using very few operations. This contrasts with state-of-the-art zero-knowledge protocols for RSA modulus proper generation assessment.
The heuristic argument at the end of our construction calls for further cryptanalysis by the community and is, as such, an interesting research question in its own right.
Jintai Ding, Zheng Zhang, Joshua Deaton
ePrint ReportJoshua Deaton, Jintai Ding
ePrint ReportMark D. Aagaard, Nusa Zidaric
ePrint ReportSohyun Jeon, Hyang-Sook Lee, Jeongeun Park
ePrint ReportIn this paper, we present a practically efficient gadget decomposition algorithm where output follows a subgaussian distribution. We parallelize the existing practical subgaussian gadget decomposition algorithm, using bounded uniform distribution. Our algorithm is divided into two independent subalgorithms and only one algorithm depends on input. Therefore, the other algorithm can be considered as pre-computation. As an experimental result, our algorithm performs over 50\% better than the existing algorithm.
Misni Harjo Suwito, Yoshifumi Ueshige , Kouichi Sakurai
ePrint ReportJose Maria Bermudo Mera, Angshuman Karmakar, Tilen Marc, Azam Soleimanian
ePrint ReportThe RLWE assumption provides quantum-resistance security while in comparison with LWE assumption gives significant performance and compactness gains. In this paper we present the first IPFE scheme whose security is guaranteed relying on the RLWE assumption. The security proof requires developing two new results on ideal lattices. The first result is a variant of Ring-LWE, that we call multi-hint extended Ring-LWE, where some hints on the secret and the noise are given. We present a reduction from RLWE problem to this variant. The second tool is a special form of Leftover Hash Lemma (LHL) over rings, which we call Ring-LHL.
To demonstrate the efficiency of our scheme we provide an optimized implementation of RLWE-based IPFE scheme and show its performance on a practical use case.
Alberto Ibarrondo, Hervé Chabanne, Melek Önen
ePrint Report16 January 2021
Facebook Inc., Menlo Park, CA | Seattle, WA | New York, NY | San Francisco, CA
Job Posting
We seek Research Scientists to identify new opportunities and help build scientifically rigorous systems focused on enhancing technological guarantees for consumer privacy while simultaneously expanding the efficiency of Facebook’s market-leading advertising systems. Challenges include leveraging privacy-enhancing technologies such as multi-party computation, homomorphic encryption, federated analytics, and differential privacy to develop privacy-focused advertising solutions (private record-linkage, fraud prevention, reporting and experimentation, and collaborative inference) — all while maintaining performance at massive scale. Minimum Qualifications
Closing date for applications:
Contact: Apply Online or reach out to Benjamin Case (bmcase {at} fb DOT com) or Sanjay Saravanan
More information: https://www.facebook.com/careers/v2/jobs/121739569732425/
University College London, Department of Computer Science, London, UK
Job PostingWe have an open Research Fellow position at University College London, within the Information Security Research Group, to work with Professor Steven Murdoch. The Research Fellow will conduct research in the application of privacy-enhancing technologies to improve transparency of measures to prevent financial fraud and to enhance the level of consumer protection available to fraud victims.
The candidate should have (or be close to obtaining) a PhD or equivalent experience in Computer Science or a related field. Research experience in privacy-enhancing technologies, security usability, and/or payment systems is essential. A strong publication record in on or more of these fields, and experience of applied privacy-enhancing technologies is desirable.
This position is part of the REPHRAIN project (https://www.rephrain.ac.uk/), the UK National Research Centre on Privacy, Harm Reduction and Adversarial Influence Online.
The application deadline is 27 January 2021.Closing date for applications:
Contact: Professor Steven Murdoch (s.murdoch@ucl.ac.uk)
More information: https://murdoch.is/:/rephrainjob
CISPA Helmholtz Center for Information Security, Saarbruecken, Germany
Job PostingProf. Cas Cremers is looking to hire Ph.D. students and/or Post-doctoral researchers for his research group at the CISPA Helmholtz Center for Information Security in Germany.
Examples of topics that the group of Prof. Cremers has worked on:
- Models and proof methodologies for security
- Security protocol analysis tools: Scyther, Tamarin
- Secure messaging (eg Signal, post-compromise security) and key exchange
- Security standards: ISO, TLS 1.3, 5G, and IETF standard under development for secure messaging MLS, worked on DP3T, ...
The positions are fully funded.
Application deadline: February 18, 2021.
Follow the link to learn more -- you can apply directly, or alternatively (new!) Cas can apply to your open supervisor position.
Closing date for applications:
Contact: Cas Cremers
More information: https://twitter.com/CasCremers/status/1349754084363038726
University of Toronto, Department of Computer Science; Toronto, Canada
Job PostingThe Department of Computer Science at the University of Toronto invites applications for up to two full-time tenure stream positions in the areas of Security and Cryptography. The appointments will be at the rank of Assistant Professor and will commence on July 1, 2021, or shortly thereafter.
We seek applications from candidates conducting research in the areas of Security and Cryptography, broadly construed. We welcome exceptional candidates who transcend traditional backgrounds, and those whose research and teaching interests complement our existing strengths.
Applicants must have a Ph.D. in Computer Science or a related field by the date of appointment, or shortly thereafter, and demonstrate a strong record of excellence in research and a strong commitment to excellent teaching. Evidence of a commitment to equity, diversity, inclusion (EDI), and the promotion of a respectful and collegial learning and working environment will weigh favourably on the application.
Salary will be commensurate with qualifications and experience, and is competitive with our North American peers.Application materials for the position must be submitted online through AcademicJobsOnline at https://academicjobsonline.org/ajo/jobs/17700. The required materials are the candidate's curriculum vitae, list of publications, research statement, teaching statement, and at least three letters of reference (on letterhead, signed and scanned) uploaded to AcademicJobsOnline directly by the writers.
The University of Toronto offers the opportunity to teach, conduct research, and live in one of the most diverse metropolitan areas in the world. For more information about the Department of Computer Science see our website at www.cs.toronto.edu. If you have any questions about the position, please contact recruit@cs.toronto.edu.
Review of applications will begin on January 11, 2021, however the position will remain open until January 28, 2021.
Closing date for applications:
Contact:
Eitan Grinspun, recruit@cs.toronto.edu
More information: https://jobs.utoronto.ca/job/Toronto-Assistant-Professor-Security-and-Cryptography-ON/543569117/
14 January 2021
Debrecen, Hungary, 23 June - 25 June 2021
Event CalendarSubmission deadline: 11 April 2021
Notification: 30 January 2021
Washington, USA, 5 December - 8 December 2021
Event CalendarSubmission deadline: 25 March 2021
Notification: 27 May 2021