IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
13 October 2017
Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia, Mahdi Zamani
To achieve our asynchronous MPC result, we define the threshold counting problem and present a distributed protocol to solve it in the asynchronous setting. This protocol is load balanced, with computation, communication and latency complexity of $O(\log{n})$, and can also be used for designing other load-balanced applications in the asynchronous communication model.
Zhe Li, San Ling, Chaoping Xing, Sze Ling Yeo
Mark Zhandry, Cong Zhang
12 October 2017
Temasek Laboratories, NTU, Singapore
Candidates should ideally have already completed, or be close to completing a PhD degree in mathematics, computer science, electrical engineering, or related disciplines, with strong track record in R&D (publications in international journals and conferences). Master degree with relevant research experience can be considered.
You will be joining a dynamic group performing research on embedded security, specific to physical attacks. This position is available from December 2017. The initial contract will be one year. There are strong possibilities for extensions upon successful performance. TL offers competitive salary package plus other benefits.
Review of applications will start immediately until position is filled.
Interested candidates should send their detailed CVs, cover letter and references ,
Closing date for applications: 28 February 2018
Contact: Shivam Bhasin, Co-Principle Investigator: sbhasin (at) ntu.edu.sg
Laboratoire Hubert Curien, University of Lyon, Saint-Etienne, France
For a new project which addresses the problem of secure and privacy in MPSoC architectures, we proposes a Post Doc position to work on security evaluation of heterogeneous MPSoC with ARM core. We are looking for candidates with an outstanding Ph.D in hardware/software security and a strong publication record in this field. Knowledge of French is not mandatory.
The Post-Doc position will start at the beginning of 2018 (flexible starting date), it is funded for 14 months.
To apply please send your detailed CV (with publication list), motivation for applying (1 page) and names of at least two people who can provide reference letters (e-mail).
Closing date for applications: 18 December 2017
Contact: Prof. Lilian BOSSUET lilian.bossuet(at)univ-st-etienne.fr
11 October 2017
Hemi Leibowitz, Ania Piotrowska, George Danezis, Amir Herzberg
Léo Ducas
Although our improvement is only sub-exponential, its practical effect in relevant dimensions is quite significant. We implemented it over a simple sieve algorithm with $(4/3)^{n+o(n)}$ complexity, and it outperforms the best sieve algorithms from the literature by a factor 10 in dimensions 70-80. It performs less than an order of magnitude slower than pruned enumeration in the same range.
By design, this improvement can also be applied to most other variants of sieve algorithms, including LSH sieve algorithms and tuple-sieve algorithms. In this light, we may expect sieve-techniques to outperform pruned enumeration in practice in the near future.
Yuanqi Shen, Amin Rezaei, Hai Zhou
Fabrice Benhamouda, Olivier Blazy, Léo Ducas, Willy Quach
Only one construction of an SPHF over lattices has been proposed in the standard model, by Katz and Vaikuntanathan at Asiacrypt'09. But this construction has an important drawback: it only works for an ad-hoc language of ciphertexts. Concretely, the corresponding decryption procedure needs to be tweaked, now requiring $q$ many trapdoor inversion attempts, where $q$ is the modulus of the underlying Learning With Errors (LWE) problem.
Using harmonic analysis, we explain the source of this limitation, and propose a way around it. We show how to construct SPHFs for standard languages of LWE ciphertexts, and explicit our construction over a tag-IND-CCA2 encryption scheme à la Micciancio-Peikert (Eurocrypt'12). We then improve our construction and our analysis in the case where the tag is known in advance or fixed (in the latter case, the scheme is only IND-CPA) with a super-polynomial modulus, to get a stronger type of SPHF, which was never achieved before for any language over lattices.
Finally, we conclude with applications of these SPHFs: password-based authenticated key exchange, honest-verifier zero-knowledge proofs, and a relaxed version of witness encryption.
Guillaume Bonnoron, Léo Ducas, Max Fillinger
In this work, we propose new techniques allowing to perform more operations per bootstrapping in FHEW-type schemes (EUROCRYPT'13). While maintaining the quasi-quadratic $\tilde O(n^2)$ complexity of the whole cycle, our new scheme allows to evaluate gates with $\Omega(\log n)$ input bits, which constitutes a quasi-linear speed-up. Our scheme is also very well adapted to large threshold gates, natively admitting up to $\Omega(n)$ inputs. This could be helpful for homomorphic evaluation of neural networks.
Our theoretical contribution is backed by a preliminary prototype implementation, which can perform $6$-to-$6$ bit gates in less than $10$ seconds on a single core, as well as threshold gates over $63$ input bits even faster.
Jeffrey Hoffstein, Jill Pipher, William Whyte, Zhenfei Zhang
We show that by replacing the uniform sampling in pqNTRUSign with a bimodal Gaussian sampling, we can further reduce the size of a signature. As an example, we show that the size of the signature can be as low as 4608 bits for a security level of 128 bits.
The most significant new contribution, enabled by this Gaussian sampling version of pqNTRUSign, is that we can now perform batch verification, which allows the verifier to check approximately 2000 signatures in a single verification process.
S. Fauskanger, I. Semaev
Paulo S. L. M. Barreto, Bernardo David, Rafael Dowsley, Kirill Morozov, Anderson C. A. Nascimento
Thomas Unterluggauer, Thomas Korak, Stefan Mangard, Robert Schilling, Luca Benini, Frank Gürkaynak, Michael Muehlberghuber
Wei Feng, Yu Qin, Shijun Zhao, Dengguo Feng
Sumanta Sarkar, Habeeb Syed
Jérémy Chotard, Edouard Dufour Sans, Duong Hieu Phan, David Pointcheval
Yusong Du, Baodian Wei
Aarhus University, Denmark
The department has research groups within \"Algorithms and Data Structures\" Data-Intensive Systems\",\"Cryptography and Security\", \"Mathematical Computer Science\", \"Logic and Semantics\", \"Ubiquitous Computing and Interaction\", \"Computer-Mediated Activity\", \"Use, Design and Innovation\", and \"Programming Languages”. Moreover, we wish to build competencies within Machine Learning and Systems Security.
Applicants within all areas of computer science are welcome.
Applicants for tenure-track positions are expected to have a PhD and research experience corresponding to a couple of years as postdoc or similar. Applicants must document a promising record of original research and an aptitude for teaching.
Applicants for associate professor positions are expected to have research experience from several years as assistant professor or similar. Applicants must document a strong record of original research and have teaching experience at undergraduate/graduate level.
All applicants are requested to include a link to their Google Scholar profile in their application.
Recommendation letters can be uploaded together with your other application material; however, you can also ask referees to submit letters directly to the e-mail address shradras (at) jobsys.au.dk no later than 5 January 2018. The subject of the e-mail should include the phrase \"Assistant Professor (tenure-track) or Associate Professor in Computer Science, name of applicant”.
Deadline
All applications must be made online and received by: 5/1/2018
Closing date for applications: 5 January 2018
More information: http://www.au.dk/en/about/vacant-positions/scientific-positions/stillinger/Vacancy/show/934877/5283/
University of Vermont
The Department of Computer Science at the University of Vermont is seeking applicants for a tenure-track position at the rank of Assistant Professor, with duties to start in late August of 2018. Preference will be given to researchers in the areas of computer security and privacy. We interpret these areas broadly, and areas of particular interest include: network security, embedded device security including IoT and medical devices, and critical infrastructure security including health and energy systems.
Applications from women, veterans, individuals with disabilities and people from diverse racial, ethnic, and cultural backgrounds are encouraged. The University is especially interested in candidates who can contribute to the diversity and excellence of the academic community. To that end candidates must provide a diversity impact statement as part of the application detailing how they will further the diversity of the unit through their research, teaching and/or service at the University.
The applicant must submit a current curriculum vitae identifying their specific area of expertise, a statement of teaching philosophy, a detailed statement of research interests, a teaching diversity impact statement, and names of at least three people who can provide letters of reference, at least one of which can comment on teaching. All application materials must be submitted online at http://www.uvmjobs.com, posting number [F923PO]. Inquiries may be addressed to Dr. Christian Skalka, Search Committee Chairperson (ceskalka (at) uvm.edu). Review of applications will begin December 1, 2017 and continue until the position is filled.
Closing date for applications: 31 December 2017
Contact:
Christian Skalka, Associate Professor, Search Committee Chairperson, ceskalka (at) uvm.edu
More information: https://www.uvmjobs.com/postings/26888