IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
09 April 2019
Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima
Alisa Chernyaeva, Ilya Shirobokov, Alexander Davydov
Anat Paskin-Chernivasky, Artiom Radune
We initiate a systematic study of polynomial secret sharing schemes, where shares are (multi-variate polynomials) of secret and randomness vectors over some finite field. Our main hope is that the nice algebraic structure of polynomials would help obtain better lower bounds than those known for the general setting, extending over the class of multi-linear schemes.
Some of the concrete new results we prove in this work are as follows.\\ \textbf{On share complexity of polynomial schemes.}\\ First we studied degree 1 in randomness (where the degree of secret is unlimited). We have shown that a large subclass of these schemes are equivalent to multi-linear schemes, in the sense that for any such scheme, there exists an equivalent multi-linear scheme with very similar share complexity. Also, we have shown that the class of schemes of polynomials of degree exactly 2 in r, without degree 1 in r monomials, is very weak, and can implement only trivial access structures where the minterms consist of single parties.\\ Another observation we make refers to the share complexity (per bit) of multi linear schemes (polynomial schemes of total degree 1). We observe that the scheme by Liu et. al obtaining share complexity $O(2^{0.994n})$ can be transformed into a multi-linear scheme with similar share complexity per bit, for sufficiently long secrets. It is interesting to check, whether similar ideas could be applied to the recent improvement of Beimel et al. with share complexity $O(2^{0.862n})$ for general schemes, transforming it into a . \textbf{On the randomness complexity of polynomial schemes.}\\ We prove that for every degree 2 polynomial secret sharing scheme, there exists an equivalent degree-2 scheme with identical share complexity with randomness complexity bounded by $O(2^{2^n})$. For general polynomial secret sharing schemes, randomness complexity can be bounded by $SC^{O(SC)^2}$, where $SC$ is the share complexity of the original scheme. So far, bounds on randomness complexity were known only for multi linear schemes, demonstrating that $RC \leq SC$ is always achievable. Our bounds are not nearly as practical, and may be viewed as a proof of concept. One nice application of low (say polynomial) randomness complexity is transforming polynomial schemes with polynomial (in $n$) algebraic formulas $C(s,r)$, into a degree-3 scheme with only polynomial blowup in share complexity (using standard randomizing polynomials constructions).
Lewis Gudgeon, Pedro Moreno-Sanchez, Stefanie Roos, Patrick McCorry, Arthur Gervais
Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya Razenshteyn, M. Sadegh Riazi
Our secure protocols utilize a combination of additively-homomorphic encryption, garbled circuit and Oblivious RAM. Along the way, we introduce various optimizations to these primitives, which drastically improve concrete efficiency.
We evaluate the new protocols empirically and show that they are able to handle datasets that are significantly larger than in the prior work. For instance, running on two standard Azure instances within the same availability zone, for a dataset of 96 dimensional descriptors of 10000000 images, we can find 10 nearest neighbors with average accuracy 0.9 in under 10 seconds improving upon prior work by at least two orders of magnitude.
Leo Weissbart, Stjepan Picek, Lejla Batina
Núria Costa, Ramiro Martínez, Paz Morillo
University of York (UK)
Research supervision
If successful, you will conduct your research under the supervision of the Chair of Cyber Security Professor Delaram Kahrobaei: https://sites.google.com/a/nyu.edu/delaram-kahrobaei/ at University of York; and Director of York Interdisciplinary Centre for Cyber Security www.cs.york.ac.uk/security
Award funding
If successful, you will be supported for three years. Funding includes:
- £14,777 (2018/19 rate) per year stipend
- Home/EU tuition fees
- RTSG (training/consumables/travel) provision
Funding requirements
To be considered for this funding you must:
- meet the entrance requirements for a PhD in Computer Science
- be eligible to pay home/EU fees
We will look favourably on applicants that can demonstrate knowledge of cryptography, algebra, quantum computation, and who have strong programming and mathematical skills.
Apply for this studentship
1. Apply to study
- You must apply online for a full-time PhD in Computer Science.
- You must quote the project title Post-Quantum Cryptography in your application.
- There is no need to write a full formal research proposal (2,000-3,000 words) in your application to study as this studentship is for a specific project.
2. Provide a personal statement. As part of your application please provide a personal statement of 500-1,000 words with your initial thoughts on the research topic.
Deadlines
Applications are accepted all year round.
The start date for the studentship is flexible.
Project enquiries
Professor Delaram Kahrobaei, Chair of Cyber Security (delaram.kahrobaei (at) york.ac.uk):
https://sites.google.com/a/nyu.edu/delaram-kahrobaei/
Application enquiries
cs-pg-admissions (at) york.ac.uk
+44 (0)1904 325404
Closing date for applications: 24 July 2019
Contact: Professor Delaram Kahrobaei, Chair of Cyber Security
https://sites.google.com/a/nyu.edu/delaram-kahrobaei/
Director of York Interdisciplinary Centre for Cyber Security www.cs.york.ac.uk/security
More information: https://www.findaphd.com/phds/project/post-quantum-cryptography/?p104181
08 April 2019
Ecole centrale of Lyon, INL laboratory, Ecully, France
In particular, problematic sub-operations (non-linear operations leading to side channel leakage for example) of cryptographic algorithm will be implemented using the new operator in order to evaluate either its security and the energy consumption of the resulting change in the computation paradigm.
Closing date for applications: 10 May 2019
Contact: Cédric Marchand
More information: http://inl.cnrs.fr/files/Th%C3%A8ses20192020/INL04_EDEEA_Navarro_Marchand_2019.pdf
Nanyang Technological University, Singapore
We offer a globally competitive salary package and low income tax, plus an excellent research environment in Singapore. The initial contract will be for 2 years, and renewable subject to the performance. Interested candidates are to send their CV, and 2 reference letters to Dr. Le Su. Review of application will start immediately until the positions are filled.
Closing date for applications: 7 October 2019
Contact: Dr. Le Su, le.su (at) ntu.edu.sg
Nanyang Technological University, Singapore
We offer a globally competitive salary package and low income tax, plus an excellent research environment in Singapore. The initial contract will be for 2 years, and renewable subject to the performance. Interested candidates are to send their CV, and 2 reference letters to Dr. Le Su. Review of application will start immediately until the positions are filled.
Closing date for applications: 7 October 2019
Contact: Dr. Le Su, le.su (at) ntu.edu.sg
Karlsruhe Institute of Technology (KIT), Department of Informatics
The professorship will be dedicated to the combination of artificial intelligence and IT security. We seek a broad range of applicants with experience and focus in at least one of the following domains:
AI methods that improve the security of IT systems
IT security methods for AI-based systems.
KIT has research competence in various fields of IT security and artificial intelligence. In particular, the candidate is planned to be affiliated with the Competence Center for Applied Security Technology (KASTEL) as well as IT security research at KIT within the framework of the Helmholtz Association. In addition, it is expected that the candidate strengthens a strategic focus of secure and dependable systems at the Faculty of Informatics.
The new professor is expected to teach courses in the core curriculum of the department of Informatics, in both mandatory and elective areas. During the first three years, the teaching can be performed in English language.
The candidate is expected to actively shape research at KIT, to advance the personal development of her/himself and independently supervise doctoral researchers as well as graduate and undergraduate students. The new professor shall successfully combine collaborative work attitude with strong communication skills.
The initial appointment is for six years as a temporary civil servant or as an employee. An interim evaluation is carried out in the third year of service. If the final tenure evaluation is positive, the successful candidate will be promoted to a tenured full professorship (W3) in accordance with §15 (2) KITG.
Starting date:as soon as possible
Closing date for applications: 8 April 2019
Contact: Prof. Dr. Bernhard Beckert, email: bernhard.beckert (at) kit.edu
More information: https://www.pse.kit.edu/karriere/567.php
Chinese University of Hong Kong
- PhD degree in Computer Science
- Good track record in top conferences
- With system background (e.g., Linux)
- Experience in blockchain (e.g., Ethereum, Hyperledger)
Closing date for applications: 1 July 2019
Contact: Send your CV to ericlo (at) cse.cuhk.edu.hk using the email subject \"Post-doc applicant: [Your Name]\" (e.g., \"Post-doc applicant: Harry Porter\").
Nanyang Technological University, Singapore
NTU Singapore offers globally competitive salary package with extremely low income tax and an excellent environment for research. The contract will be initially for 2 years, and has the possibility to be extended subject to the availability of funding. The position will be open until filled, interested candidates are to send their CV and the contact information of 2 referees to Prof. Jian Guo.
Closing date for applications: 31 July 2019
Contact: Jian Guo, Assistant Professor, guojian (at) ntu.edu.sg
More information: http://catf.crypto.sg
Yeshiva University
This is a tenure eligible position depending on experience and qualifications. We offer an excellent compensation package, and a broad range of employee benefits, including immediate participation in the University’s retirement plan. Compensation commensurate with experience. Relocation assistance may be provided.
Closing date for applications: 11 September 2019
More information: https://apptrkr.com/1418527
Program Director/Tenure Track Faculty Member of Artificial Intelligence and Machine Learning (Tenure
Yeshiva University
Given the multidisciplinary mission of the Katz School, there will be opportunities to collaborate on research and initiatives with colleagues from other fields and schools; for example, Biotech, Mathematics, Economics, CyberSecurity, Data and Privacy Law (at Cardozo School of Law), and YU’s Innovation Lab. In particular, this is an opportunity for an entrepreneurial leader to take advantage of the University’s extensive connections to Israel’s startup community and groundbreaking work in Artificial Intelligence, Machine Learning, Computer Science, Biotech and Cybersecurity.
We offer an excellent compensation package, and a broad range of employee benefits, including immediate participation in the University’s retirement plan. Compensation commensurate with experience. Relocation assistance may be provided.
Closing date for applications: 11 September 2019
More information: https://apptrkr.com/1418515
Imperial College London
This position is funded by HM Government and is available only to UK citizens unfortunately. The studentship will last for 3.5 years and include tuition fees as a Home student and an attractive stipend of £24,000/year, plus a generous allowance for travel and subsistence.
Closing date for applications: 1 May 2019
Contact: Cong Ling (c.ling (at) imperial.ac.uk)
More information: https://www.jobs.ac.uk/job/BQT906/phd-studentship-in-post-quantum-cryptography
07 April 2019
Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, Justin Thaler
To drop these limitations, we introduce a new notion of ad hoc MIFE. In our setting, each source generates its own public key and issues individual, function-specific secret keys to an aggregator. For successful decryption, an aggregator must obtain a separate key from each source whose ciphertext is being computed upon. The aggregator could obtain multiple such secret keys from a user corresponding to functions of varying arity. For this primitive, we obtain the following results: We show that standard MIFE for general functions can be bootstrapped to ad hoc MIFE for free, i.e. without making any additional assumption. We provide a direct construction of ad hoc MIFE for the inner product functionality based on the Learning with Errors (LWE) assumption. This yields the first construction of this natural primitive based on a standard assumption.
At a technical level, our results are obtained by combining standard MIFE schemes and two-round secure multiparty computation (MPC) protocols in novel ways highlighting an interesting interplay between MIFE and two-round MPC in the construction of non interactive primitives.
Anubhab Baksi, Dhiman Saha, Sumanta Sarkar
03 April 2019
22 March - 26 March 2020
Submission deadline: 23 November 2019
Notification: 23 January 2020