IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
29 March 2018
Sayandeep Saha, Debdeep Mukhopadhyay, Pallab Dasgupta
28 March 2018
King Khaled University. Abha, Saudi Arabia
time positions of Professor, Associate Professor and Assistant Professor in the following
fields:
Network Security
Information security
Computer Security
Hardware Security
Salary:
The University offers a competitive salary based on qualification, professional
experience, and the position offered, as follows:
Professor: $52,500 - $88,500 per annum.
Associate professor: $43,000- $73,000 per annum.
Assistant professor: $35,500 - $60,000 per annum.
Common Benefits:
? Free visa.
? Tax-free salary.
? Around 2-week vacation on each Islamic Eid.
? 60-days annually paid vacation.
? Annual air tickets for up to 4 family members to home country.
? Free Medical Services for all family members at all government hospitals.
? Children Education Allowance (Terms and Conditions apply).
? Annual housing allowance (Terms and Conditions apply).
? Furniture allowance upon arrival (Terms and Conditions apply).
? Weekends (Thursday and Friday) are off.
Closing date for applications:
Contact: Sarah Abu Ghazalah sabugazalah (at) kku.edu.sa
Also, all the documents should be sent via email to: ccs (at) kku.edu.sa
More information: http://www.cs.kku.edu.sa/en
Robert Bosch Research and Technology Center, Pittsburgh PA, USA
The Bosch Group operates in most countries in the world. With over 390,000 associates, a career at Bosch offers a chance to grow an exceptional career in an environment that values diversity, initiative and a drive for results.
Job Description
Ideal candidates for this position should have experience in at least one, preferably two or more of the following:
-(Distributed) system security and cloud computing, with emphasis on fault-tolerance, secure computation, secure function evaluation, implementation aspects of the above, knowledge of the blockchain and crypto currency architectures and applications thereof.
-System Security, network security, embedded security, trusted computing, hardware security
-Applied cryptography, privacy enhancing technologies
-Security and machine learning, applications of data miniing to security, intrusion detection, anomaly detection,
network security, applications of data mining to constrained environments (e.g., automotive networks)
-Software security, static and dynamic program analysis, automated vulnerability detection and patching, reverse engineering of software binaries, hardening techniques to protect software against reverse engineering, formal modelling, etc.
The candidate should have expert knowledge (evidenced by significant contributions in the form of publications and/or patents or patent applications) in at least one of the listed areas and be familiar with at least one other area (should be able to understand and contribute in deep technical discussions in the area). The candidate will be expected to be an active contributor, should have good written and oral communication skills, cross-team collaboration skills, and should be open to acquiring and applying new skills.
Closing date for applications: 31 December 2018
Contact: Contact: Dr. Jorge Guajardo Merchan (jorge DOT guajardomerchan AT us DOT bosch DOT com)
More information: https://jobs.smartrecruiters.com/BoschGroup/743999666848005-research-engineer?trid=eaeb2bda-02a4-4e9f-b357-957d3b6da7d7
TU Wien, Vienna, Austria
Expressions of interest are sought from researchers who have recently completed their PhD (2 – 8 years ago) with an excellent research track record. Selected candidates will, together with an experienced researcher of the Faculty of Informatics as a proponent, prepare a proposal to be submitted to the WWTF. Should this proposal be successful, the proposed project will be funded to the amount of 1.6 million euro by the WWTF for a period of 6 – 8 years. The Vienna University of Technology will also contribute to the funding of the project: during this time the successful candidate(s) will set up and manage his or her own research group as a group leader, and she or he will receive a tenure-track position (assistant professor), which will be later transformed into a tenured position (associate professor) subject to a positive overall assessment, with subsequent possibility of promotion to full professor.
Expressions of interest from researchers working in any area of Security and Privacy are welcome. These should be sent in digital format (a single pdf file) to Univ. Prof. Matteo Maffei (matteo.maffei (at) tuwien.ac.at) by May 1st, 2018. The expression of interest should include
- CV
- List of publications
- Short abstract of the envisioned research project (about 1 page)
Important Dates:
- May 1st, 2018: deadline for expressions of interest
- Mid of May: notification of the first screening phase
- July 12th, 2018: deadline for the final proposal
Closing date for applications: 1 May 2018
Contact: Univ. Prof. Matteo Maffei (matteo.maffei (at) tuwien.ac.at)
More information: https://www.wwtf.at/programmes/vienna_research_groups/#VRG18
DarkMatter, Abu Dhabi
Be encouraged to monitor and actively participate in external communities and forums in order to keep abreast of the latest developments, follow the constantly evolving requirements for Blockchain and permissioned ledgers within and across various market sectors, and expand DarkMatter?s positive presence in these communities.
Have a careful and critical eye to peer review and debug others code, and also to participate in automated deployments.
With many of our customers committed to putting all the resources necessary into developing and deploying the latest, most advanced Blockchain, cryptographic and other cyber security technologies, at DarkMatter you?ll have a chance to test your abilities, build your skills, and expand your horizons by designing for ‘impossible?, next-generation projects.
To bring your dream to life, you’ll need:
PhD or Master’s degree in Related Security field Cryptography, Applied Cryptography, Information Theory and Mathematics, IT, Computer Science
5+ years of experience working on large software projects (preferably including open-source projects)
Embedded Linux, baremetal / RTOS development and deployment
Ability to work with remote developers, leveraging git and other command-line based collaboration technologies
Comfortable developing with standard *nix toolchains (gcc, clang, perf, make, cmake, ASAN, TSAN, UBSAN)
Knowledge of symmetric and asymmetric cryptographic principles, hierarchical key management and identity management schemes
Familiarity with Financial Technology (FinTech) or related field is an added advantage
Deep understanding of Hyperledger, Ethereum or other Blockchain community technical issues
Closing date for applications: 19 December 2018
Contact: Sheila Morjaria - sheila.morjaria (at) darkmatter.ae
More information: https://grnh.se/uvwx8qo61
27 March 2018
Yang Yu, Léo Ducas
At PKC~2008, Plantard, Susilo and Win proposed a new variant of GGH, informally arguing resistance to such attacks. Based on this variant, Plantard, Sipasseuth, Dumondelle and Susilo proposed a concrete signature scheme, called DRS, that has been accepted in the round 1 of the NIST post-quantum cryptography project.
In this work, we propose yet another statistical attack and demonstrate a weakness of the DRS scheme: one can recover some partial information of the secret key from sufficiently many signatures. One difficulty is that, dued to the DRS reduction algorithm, the relation between the statistical leak and the secret seems more intricate. We work around this difficulty by training a statistical model, using a few features that we designed according to a simple heuristic analysis.
While we only recover partial information on the secret key, this information is easily exploited by lattice attacks, significantly decreasing their complexity. Concretely, we claim that, provided that $100\,000$ signatures are available, the secret key may be recovered using BKZ-$138$ for first set of DRS parameters submitted to the NIST. This puts the security level of this parameter set below $80$-bits (maybe even $70$ bits), for an original claim of $128$-bits.
Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
While lot of connections have been known from other gadgets to NMCs, this is the first result to show an application of NMCs to any information-theoretic primitive (other than tamper resilient circuits). Specifically, we give a general transformation that takes any augmented non-malleable code and builds a privacy amplification protocol. This leads to the following results:
(a) Assuming the existence of constant rate, optimal error (we say an $\epsilon$-(augmented) NMC has optimal error if $\epsilon$ = $2^{-O(message\ length)}$), two-state augmented non-malleable code there exists a $8$-round privacy amplification protocol with optimal entropy loss and min-entropy requirement $\Omega(\log(n)+ \kappa)$ (where $\kappa$ is the security parameter). In fact, "non-malleable randomness encoders" suffice.
(b) Instantiating our construction with the current best known augmented non-malleable code for $2$-split-state family [Li17], we get a $8$-round privacy amplification protocol with entropy loss $O(\log(n)+ \kappa \log (\kappa))$ and min-entropy requirement $\Omega(\log(n) +\kappa\log (\kappa))$.
Brice Minaud
Guido Marco Bertoni, Lorenzo Grassi, Filippo Melzani
Vireshwar Kumar, He Li, Noah Luther, Pranav Asokan, Jung-Min (Jerry) Park, Kaigui Bian, Martin B. H. Weiss, Taieb Znati
Phillipp Schoppmann, Adrià Gascón, Borja Balle
Ke Gu, Na Wu
25 March 2018
Atanu Basu , Indranil Sengupta
Björn Haase, Benoît Labrique
24 March 2018
Derby, U.K., 14 September - 15 September 2018
Submission deadline: 13 April 2018
23 March 2018
Iraklis Symeonidis, Gergely Biczók, Fatemeh Shirazi, Cristina Pérez-Solà, Jessica Schroers, Bart Preneel
Qichun Wang
In this paper, we determine the values of the minimum Hamming weights of $d$-CI Boolean functions in $n$ variables for infinitely many $n$'s and give a negative answer to the open problem proposed by Bhasin et al. We then present a method to construct minimum-weight 2-CI functions through Hadamard matrices, which can provide all minimum-weight 2-CI functions in $4k-1$ variables. Furthermore, we prove that the Carlet-Chen conjecture is equivalent to the famous Hadamard conjecture. Most notably, we propose an efficient method to construct low-weight $n$-variable CI functions through $d$-linearly independent sets, which can provide numerous minimum-weight $d$-CI functions. Particularly, we obtain some new values of the minimum Hamming weights of $d$-CI functions in $n$ variables for $n\leq 13$. We conjecture that the functions constructed by us are of the minimum Hamming weights if the sets are of absolute maximum $d$-linearly independent. If our conjecture holds, then all the values for $n\leq 13$ and most values for general $n$ are determined.
Gizem S. \c{C}etin, Berk Sunar
Jason LeGrow, David Jao, Reza Azarderakhsh
22 March 2018
Saikrishna Badrinarayanan, Dakshita Khurana, Amit Sahai, Brent Waters
Indeed, assuming ideal obfuscation, it is easy to see that every CCA-secure public-key encryption scheme is FE-compatible. Despite the recent success in using indistinguishability obfuscation to replace ideal obfuscation for many applications, we show that this phenomenon most likely will not apply here. We show that assuming fully homomorphic encryption and the learning with errors (LWE) assumption, there exists a CCA-secure encryption scheme that is provably not FE-compatible. We also show that a large class of natural CCA-secure encryption schemes proven secure in the random oracle model are not FE-compatible in the random oracle model.
Nevertheless, we identify a key structure that, if present, is sufficient to provide FE-compatibility. Specifically, we show that assuming sub-exponentially secure iO and sub-exponentially secure one way functions, there exists a class of public key encryption schemes which we call Special-CCA secure encryption schemes that are in fact, FE-compatible.
In particular, each of the following popular CCA secure encryption schemes (some of which existed even before the notion of FE was introduced) fall into the class of Special-CCA secure encryption schemes and are thus FE-compatible:
1) The scheme of Canetti, Halevi and Katz (Eurocrypt 2004) when instantiated with the IBE scheme of Boneh-Boyen (Eurocrypt 2004). 2) The scheme of Canetti, Halevi and Katz (Eurocrypt 2004) when instantiated with any Hierarchical IBE scheme. 3) The scheme of Peikert and Waters (STOC 2008) when instantiated with any Lossy Trapdoor Function.