IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
14 September 2022
Reo Eriguchi, Kaoru Kurosawa, Koji Nuida
Oana Ciobotaru, Fatemeh Shirazi, Alistair Stewart, Sergey Vasilyev
13 September 2022
University College Dublin
Closing date for applications:
Contact: The position is supervised by Asst. Prof. Dr. Madhusanka Liyanage (https://scholar.google.fi/citations?user=p1n0ioUAAAAJ&hl=en) and Asst. Prof. Dr. Shen Wang (https://scholar.google.com/citations?user=rPAOzIwAAAAJ&h).
The University of Adelaide, Australia
This is a fixed term (18 months) position with a flexible start date up to January 2023.
Apply at: https://careers.adelaide.edu.au/cw/en/job/510702
Closing date for applications:
Contact: Yuval Yarom yval(at)cs.adelaide.edu.au
J.P. Morgan Chase & Co.
The Cryptography Architect will be responsible for guiding how advanced and innovative cryptography is leveraged at JPMorgan Chase. As an experienced member of the Emerging Technologies Security group within the Cybersecurity & Technology Controls organization, you will interact with like-minded cryptographers and a group of passionate security engineers to work on concrete applications of advanced cryptography schemes. You will also have the opportunity to collaborate with other cryptographers on research projects.
The position requires strong academic knowledge as well as some industry experience in vetting and applying advanced cryptography schemes to secure complex IT infrastructure, customer-facing services, and sensitive customer and enterprise data.
Knowledge, experience, and capability required for the role include:
- Expertise in both mainstream encryption schemes and key exchange protocols as well as quantum-safe cryptography
- Strong familiarity with NIST post-quantum cryptography standardization & migration efforts
- Hands-on experience with implementing, testing and deploying advanced cryptographic schemes
- Familiarity with NIST Cryptographic Standards and Guidelines
- Proficiency in multiple programming languages, e.g., Java, C#, JavaScript, C/C++
- Ability to convey complex concepts in a clear & concise manner to a wide range of audience
- Proven track record in publishing papers (academia, whitepaper, position paper etc.)
- Proven track record in working with diverse teams to achieve goals
- Driving enterprise-wide transformative security technology initiatives
- PhD (preferred) or MS in computer science
Closing date for applications:
Contact: Hubert Le Van Gong, Ph.D. | Managing Director | Cybersecurity & Technology Controls
More information: https://jpmc.fa.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/210337824/?utm_medium=jobshare
J.P. Morgan Chase & Co.
The Applied Cryptography Architect will be responsible for leveraging innovative cryptography at JPMorgan Chase. As a member of the Emerging Technologies Security group within the Cybersecurity & Technology Controls organization, you will work alongside cryptographers and a group of passionate security engineers to solve complex security problems and support the deployment of cryptography-based solutions.
The position requires extensive knowledge and industry experience in combining cryptography and security best-practices to secure complex IT infrastructure, customer-facing services, and sensitive customer and enterprise data.
Knowledge, experience, and capability required for the role include:
- Expertise in applying mainstream cryptographic primitives, including digital signatures, public-key ciphers, block ciphers Good understanding and hands-on experience of network security protocols (TLS etc.)
- Familiarity with NIST post-quantum cryptography standardization & migration efforts
- Security solution development utilizing cryptographic agility principles and elements
- Proficiency in multiple programming languages, e.g., Java, C#, JavaScript, C/C++
- Hands-on data protection solution development utilizing industry standard security protocol and best-practices
- Application knowledge of public key infrastructure (PKI) and digital certificates (e.g., X.509)
- Ability to convey complex concepts and ideas in a clear and concise manner to a wide range of audience
- Proven track record in working with diverse teams to achieve goals
- Driving enterprise-wide transformative security technology initiatives
- MS (preferred) or BS in computer science
Closing date for applications:
Contact: Hubert Le Van Gong, Ph.D. | Managing Director | Cybersecurity & Technology Controls
More information: https://jpmc.fa.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/210337262/?utm_medium=jobshare
University of Oxford, Department of Computer Science; Oxford, UK
Closing date for applications:
Contact: James Worrell
12 September 2022
Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs
As our main result, we show how to construct ideal obfuscation in the PrO model, starting from functional encryption (FE), which in turn can be based on well-studied polynomial hardness assumptions. In contrast, we know that ideal obfuscation cannot be instantiated in the basic random oracle model under any assumptions. We believe our result gives a heuristic justification for the following: (1) most natural security goals implied by ideal obfuscation are achievable in the real world; (2) we can construct obfuscation from FE with polynomial security loss.
We also discuss how to interpret our result in the PrO model as a construction of ideal obfuscation using simple hardware tokens or as a way to bootstrap ideal obfuscation for PRFs to that for all functions.
Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé
First, we reduce worst-case mod-uSVP to worst-case NTRU. For this, we rely on an oracle for id-SVP, the problem of finding short non-zero vectors in ideal lattices. Using the worst-case id-SVP to worst-case NTRU reduction from Pellet-Mary and Stehlé [ASIACRYPT'21],this shows that worst-case NTRU is equivalent to worst-case mod-uSVP.
Second, we give a random self-reduction for mod-uSVP. We put forward a distribution D over mod-uSVP instances such that solving mod-uSVP with a non-negligible probability for samples from D allows to solve mod-uSVP in the worst-case. With the first result, this gives a reduction from worst-case mod-uSVP to an average-case version of NTRU where the NTRU instance distribution is inherited from D. This worst-case to average-case reduction requires an oracle for id-SVP.
Gustavo Banegas, Juliane Krämer, Tanja Lange, Michael Meyer, Lorenz Panny, Krijn Reijnders, Jana Sotáková, Monika Trimoska
Arnab Roy, Aakash Chowdhury, Elisabeth Oswald
Si Chen, Junfeng Fan
Xiaofeng Xie
Alexander Wagner, Felix Oberhansl, Marc Schink
David Naccache, Ofer Yifrach-Stav
Let $n$ be a $k$-bit Mersenne number whose factors are unknown. Consider an $\ell$-bit secret number $x=2^{k/2}a+b$. We observe that there are parameter configurations where a chunk of the value $b^2$ is leaked even if $k<2\ell$.
This observation does not endanger any known scheme and in particular not Squash.
Subhranil Dutta, Tapas Pal, Amit Kumar Singh, Sourav Mukhopadhyay
Debranjan Pal, Upasana Mandal, Mainak Chaudhury, Abhijit Das, Dipanwita Roy Chowdhury
Brent Waters, Hoeteck Wee, David J. Wu
In this work, we develop new techniques for constructing MA-ABE for the class of subset policies (which captures policies such as conjunctions and DNF formulas) whose security can be based in the plain model without random oracles. We achieve this by relying on the recently-proposed "evasive" learning with errors (LWE) assumption by Wee (EUROCRYPT 2022) and Tsabury (CRYPTO 2022).
Along the way, we also provide a modular view of the MA-ABE scheme for DNF formulas by Datta et al. (EUROCRYPT 2021) in the random oracle model. We formalize this via a general version of a related-trapdoor LWE assumption by Brakerski and Vaikuntanathan (ITCS 2022), which can in turn be reduced to the plain LWE assumption. As a corollary, we also obtain an MA-ABE scheme for subset policies from plain LWE with a polynomial modulus-to-noise ratio in the random oracle model. This improves upon the Datta et al. construction which relied on LWE with a sub-exponential modulus-to-noise ratio. Moreover, we are optimistic that the generalized related-trapdoor LWE assumption will also be useful for analyzing the security of other lattice-based constructions.
Yi Deng, Xinxuan Zhang
We use knowledge encryption to construct the first three-round (weakly) simulatable oblivious transfer. This protocol satisfies (fully) simulatable security for the receiver, and weakly simulatable security ($(T, \epsilon)$-simulatability) for the sender in the following sense: for any polynomial $T$ and any inverse polynomial $\epsilon$, there exists an efficient simulator such that the distinguishing gap of any distinguisher of size less than $T$ is at most $\epsilon$.
Equipped with these tools, we construct a variety of fundamental cryptographic protocols with low round-complexity, assuming only the existence of two-round oblivious transfer with game-based security. These protocols include three-round delayed-input weak zero knowledge argument, three-round weakly secure two-party computation, three-round concurrent weak zero knowledge in the BPK model, and a two-round commitment with weak security under selective opening attack. These results improve upon the assumptions required by the previous constructions. Furthermore, all our protocols enjoy the above $(T, \epsilon)$-simulatability (stronger than the distinguisher-dependent simulatability), and are quasi-polynomial time simulatable under the same (polynomial hardness) assumption.