IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
18 November 2017
Guangzhou University, Guangzhou, China
PhD candidates will be provided full research scholarship, allowances, free single dorm room, and round-trip tickets (twice a year). PostDoc researchers will be offered competitive salary package plus other benefits.
Interested candidates please send your CV, reference letters, and copies of certificates to Prof. Jin Li. PostDocs please add your publication list.
More information about Prof. Jin Li:
http://www.scholat.com/jinli71
https://scholar.google.com/citations?user=7GDV2vUAAAAJ&hl=en&oi=ao
Closing date for applications: 30 June 2018
Contact: Prof. Jin Li
Email: jinli71 (at) gmail.com
17 November 2017
Candidates for IACR Director:
- Tancrède Lepoint: 330
- Masayuki Abe: 301
- Moti Yung: 283
- Josh Benaloh: 227
Bangalore, India, 4 January - 8 January 2018
Agency for Science, Technology and Research (A*STAR), Singapore
JOB DESCRIPTION
This security project is related to “Computing on Encrypted Data” and address how to efficiently outsource computation with fully homomorphic encryption, leakage-resilient cryptography, lattice-based cryptography and secure multi-party computation. The project is to address data security problems and develop new security technologies by focusing on Fully Homomorphic Encryption (FHE). The applicant will need to develop optimise and implement FHE schemes in field level. Furthermore, an in depth security analysis of the proposed systems will be required. Highly motivated candidates interested in this research area are welcome to apply. Candidates are expected to have thorough understanding of the state-of-the-art research in this field and with breadth of knowledge of the current issues and recent technology advancements. An in depth security analysis of the proposed systems will be required. Specific skills required strong background in mathematics and preferably experience with implementing advanced mathematical structures.
DESIRED SKILLS AND EXPERIENCE
PhD in Applied Mathematics or equivalent
Strong interest in secure and efficient cryptographic implementations
Experience in developing prototypes in a research environment
Highly self-motivated and willing to learn new technology
Demonstrated potential to excel in collaborative research spanning multiple research areas
Prior experience in embedded software or hardware design is a plus point
Closing date for applications: 31 December 2018
Contact:
- Khin Mi Mi Aung
- Senior Scientist
- Agency for Science, Technology and Research (A*STAR), Singapore
More information: http://www.a-star.edu.sg/dsi
Continental Automotive Singapore
Your task is to define, implement and execute Security and Privacy attack methods and their countermeasures for in-vehicle networks, Car2X and Backend services.
Responsibilities:
• Define security tests for embedded systems, backend, Smartphone & Connectivity
• Develop countermeasures for detected vulnerabilities
• Develop tools to demonstrate the efficiency of the security mechanisms
• Develop and refine the Security and Privacy concept for connected services between vehicle and backend services
• Implementation of novel Security & Privacy mechanisms
Requirements:
• University degree in computer science, electrical engineering or mathematics with a deep focus on security, privacy, cryptology, or similar
• In-depth Experiences with projects related to cloud security, smartphone security and backend security
• Knowledge of Security Risk Analysis methods (e.g. STRIDE)
• Knowledge of Security Source Code Analysis methods
• Knowledge of Quantum cryptography is preferred
• An application with several years of experience in the field of Automotive Security and Privacy is preferred
• Good & open communication
• Mobility to collaborate creatively in international teams
Please apply as soon as possible.
Link:
https://krb-sjobs.brassring.com/tgwebhost/jobdetails.aspx?jobId=1118857&PartnerId=30050&SiteId=5879&JobReqLang=1&JobSiteId=5879&JobSiteInfo=1118857_5879&phid=89434&codes=SM_Linkedin&nonloginid=
Closing date for applications: 1 March 2018
Contact: Estelle Wang
Estelle.wang (at) continental-corporation.com
15 November 2017
Yang Wang , Mingqiang Wang
In this paper, we give a new provable secure NTRUEncrypt in standard model under canonical embedding over any cyclotomic field. We give an reduction from a simple variant of RLWE - an error distribution discretized version of RLWE, hence from worst-case ideal lattice problems, to our NTRUEncrypt. In particular, we get a union bound for reduction parameters and module for all choices of plaintext space, so that our NTRUEncrypt can send more encrypted bits in one encrypt process with higher efficiency and stronger security. Furthermore, our scheme's decryption algorithm succeeds with probability $1-n^{\o(\sqrt{n\log n})}$ comparing with the previous works' $1-n^{-\o(1)}$, making our scheme more practical in theory.
Vahid Amin Ghafari, Honggang Hu
Qiuxiang Dong, Dijiang Huang, Jim Luo, Myong Kang
Qiuxiang Dong, Dijiang Huang, Jim Luo, Myong Kang
Weijia Wang, Zhijie Wang, Bing Li, Qiuxiang Dong, Dijiang Huang
14 November 2017
The TCC Test of Time award was introduced in 2015. It recognizes outstanding papers, published in the Theory of Cryptography Conference (TCC) at least eight years ago, making a significant contribution to the theory of cryptography, preferably with influence also in other area of cryptography, theory, and beyond. For more information about the Test of Time award, including information on nominating a paper, please see the page at http://www.iacr.org/workshops/tcc/awards.html.
13 November 2017
Sadegh Jamshidpour, Zahra Ahmadian
11 November 2017
Singapore University of Technology and Design (SUTD)
We are seeking applications for a tenure track assistant professor on network and system security, which is available immediately. The candidates should have track record of strong R&D capability, with publications at top security conferences.
Interested candidates please send your CV to Prof. Jianying Zhou (faculty search committee).
Closing date for applications: 31 March 2018
Contact: jianying_zhou (at) sutd.edu.sg
More information: https://istd.sutd.edu.sg/
ENS Paris, FUAS, HU, ATOS, WALLIX
- ENS Paris seeks 1 PostDoc to work on the design of new functional encryption schemes, both in the single-input and multi-input settings. The candidate will be joining the ENS Crypto Team (https://crypto.di.ens.fr) and is expected to have a strong academic record with demonstrated experience in the design of cryptographic schemes. Contact: Michel Abdalla (michel.abdalla (at) ens.fr)
- Flensburg University seeks 2 PhD/PostDocs to research novel lattice and pairing-based functional encryption schemes. Your host will be Prof. Dr. Sebastian Gajek, chair of the ITSC group (https://www.itsc.inf.hs-flensburg.de/). Contact: Sebastian Gajek (sebastian.gajek (at) hs-flensburg.de)
- University of Helsinki seeks a PhD student or a PostDoc to research optimisations of functional encryption schemes for efficient hardware based implementations. Your host will be Dr. Kimmo Järvinen, Senior Researcher in Secure Systems group in Department of Computer Science. Contact: Dr. Kimmo Järvinen (kimmo.u.jarvinen (at) helsinki.fi)
- Atos seeks a software developer with experience in cryptography to participate in the implementation of functional encryption systems, in addition to participating in other e-identity and cybersecurity research projects. This position is based in Spain, in the Atos Research & Innovation division Contact: Pedro Soria-Rodriguez (pedro.soria (at) atos.net)
- Wallix seeks a researcher with relevant experience in cryptography, that is interested both in research and proper implementation of primitives and applied cryptography. The position within the Innovation Department is based in Paris, France. Contact: Henri Binsztok (hbinsztok at wallix.com)
Closing date for applications: 1 February 2018
Contact:
- ENS: Michel Abdalla (michel.abdalla (at) ens.fr)
- FUAS: Sebastian Gajek (sebastian.gajek (at) hs-flensburg.de)
- HU: Dr. Kimmo Järvinen (kimmo.u.jarvinen (at) helsinki.fi)
- ATOS: Pedro Soria-Rodriguez (pedro.soria (at) atos.net)
- WALLIX: Henri Binsztok (hbinsztok at wallix.com)
David Pouliot, Scott Griffy, Charles V. Wright
In this paper, we present the first efficiently searchable, easily deployable database encryption scheme that is provably secure against inference attacks even when used with real, low-entropy data. Ours is also the only efficiently searchable construction that provides any provable security for protecting multiple related attributes (columns) in the same database. Using this ESE construction as a building block, we give an efficient construction for performing range queries over encrypted data.
We implemented our constructions in Haskell and used them to query encrypted databases of up to 10 million records. In experiments with a local Postgres database and with a Google Cloud Platform database, the response time for our encrypted queries is not excessively slower than for plaintext queries. With the use of parallel query processing, our encrypted queries can achieve similar and in some cases superior performance to queries on the plaintext.
Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
Our main result is the construction of a $2$-split state, rate-$\frac{1}{2}$ NMRE. While NMREs are interesting in their own right and can be directly used in applications such as in the construction of tamper-resilient cryptographic primitives, we also show how to use them, in a black-box manner, to build a $3$-split-state (standard) NMCs with rate $\frac{1}{3}$. This improves both the number of states, as well as the rate, of existing constant-rate NMCs.
Haodong Jiang, Zhenfeng Zhang, Long Chen, Hong Wang, Zhi Ma
In this paper, by using a novel proof technique, we present QROM security reductions for two widely used generic transformations without suffering any ciphertext overhead. Meanwhile, the security bounds are much tighter than the ones derived by utilizing Targhi and Unruh's proof technique. Thus, our QROM security proofs not only provide a solid post-quantum security guarantee for previous KEM schemes, but also simplify the constructions and reduce the ciphertext sizes. We also provide QROM security reductions for Hofheinz-Hoevelmanns-Kiltz modular transformations (TCC 2017), which can help to obtain a variety of combined transformations with different requirements and properties.
Incheon, Korea, 4 June 2018
Submission deadline: 20 January 2018
Notification: 10 March 2018
Songdo, Korea, 4 June - 8 June 2018
Submission deadline: 8 December 2017
Notification: 3 March 2018
Amalfi, Italy, 5 September - 7 September 2018
Submission deadline: 10 April 2018
Notification: 8 June 2018