IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
10 May 2022
M. Rajululkahf
Aside from the cost of memory access and input/output processing, Băhēm requires only three additions (one per-session, two per-block) and one XOR operation in order to encrypt or decrypt, and is also highly parallelise-able.
Despite Băhēm's 1-bit overhead per cleartext bit, its early prototype, Alyal, achieved similar run-time speeds to OpenSSL's ChaCha20; slightly faster decryption, while slightly slower encryption when the TRNG was prepared in a file in advance. This demonstrates that Băhēm is practicality usable for many real-world application scenarios.
Later implementations, with better TRNG optimisations and parallelism, must allow the prototype a faster run-time for both, encryption and decryption.
Joon-Woo Lee, Eunsang Lee, Young-Sik Kim, Jong-Seon No
Norica Băcuieți, Joan Daemen, Seth Hoffert, Gilles Van Assche, Ronny Van Keer
Malik Imran, Felipe Almeida, Andrea Basso, Sujoy Sinha Roy, Samuel Pagliarini
Diego Aranha, Chuanwei Lin, Claudio Orlandi, Mark Simkin
Previously, practically relevant laconic PSI protocols were only known from factoring-type assumptions. The contributions of this work are twofold: 1) We present the first laconic PSI protocol based on assumptions over pairing-friendly elliptic curves; and 2) For the first time we provide empirical evaluation of any laconic PSI protocol by carefully implementing and optimising both our and previous protocols. Our experimental results shows that our protocol outperforms prior laconic PSI protocols.
Marzio Mula, Nadir Murru, Federico Pintore
Jungmin Park, N. Nalla Anandakumar, Dipayan Saha, Dhwani Mehta, Nitin Pundir, Fahim Rahman, Farimah Farahmandi, Mark M. Tehranipoor
Fuchun Guo, Willy Susilo
We show that the proposed chain-based unique signature scheme by Guo {\it et al.} must have the reduction loss $q^{1/n}$ for $q$ signature queries when each unique signature consists of $n$ BLS signatures. We use a meta reduction to prove this lower bound in the EUF-CMA security model under any non-interactive hardness assumption, and the meta-reduction is also applicable in the random oracle model. We also give a security reduction with reduction loss $4\cdot q^{1/n}$ for the chain-based unique signature scheme (in the EUF-CMA security model under the CDH assumption). This improves significantly on previous reduction loss $n\cdot q_H^{1/n}$ that is logarithmically tight at most. The core of our reduction idea is a {\em non-uniform} simulation that is specially invented for the chain-based unique signature construction.
Elena Kirshanova, Alexander May
We show that given more than $tm$ entries of the Goppa point vector $(\alpha_1, \ldots, \alpha_n)$ allows to recover the Goppa polynomial $g(x)$ and the remaining entries in polynomial time. Hence, in case $tm \approx \frac n 4$ roughly a fourth of a McEliece secret key is sufficient to recover the full key efficiently.
Let us give some illustrative numerical examples. For ClassicMcEliece with $(n,t,m)=(3488,64,12)$ on input $64\cdot 12+1=769$ Goppa points, we recover the remaining $3488-769=2719$ Goppa points in $\mathbb{F}_{2^{12}}$ and the degree-$64$ Goppa polynomial $g(x) \in \mathbb{F}_{2^{12}}[x]$ in $1$ minute.
For ClassicMcEliece with $(n,t,m)=(8192,128,13)$ on input $128\cdot 13+1=1665$ Goppa points, we recover the remaining $8192-1665=6529$ Goppa points in $\mathbb{F}_{2^{13}}$ and the degree-$128$ Goppa polynomial $g(x) \in \mathbb{F}_{2^{13}}[x]$ in $5$ minutes.
Our results also extend to the case of erroneous Goppa points, but in this case our algorithms are no longer polynomial time.
Hien Chu, Dario Fiore, Dimitris Kolonelos, Dominique Schröder
Mysten Labs (mystenlabs.com)
This role gives the opportunity to work closely with a senior team of experts in theoretical computer science, cryptography, language & systems design, while enjoying a high degree of ownership & autonomy in working conditions & task prioritization. We regularly publish to conferences like CCS, S&P, CRYPTO, NDSS, FC, AsicCCS, PETS, CT-RSA, ESORICS, ACNS etc.
While the following guidelines reflect some of our thinking about a background we would like to see in a candidate, we are committed to diversity, & more surprising profiles with a good argument to fit & capability are encouraged to apply.
Our ideal candidate would have:
- 2+ years of experience in hands-on software engineering for cryptographic operations, such as signature schemes, accumulators, key management, data encryption & compression.
- Understanding of fundamental cryptographic algorithms & underlying math for any of the following: hash functions, finite field arithmetic, polynomials (FFT) & elliptic curves.
- Experience implementing high-performance & parallelizable protocols in languages such as Rust, Go, Java, or C/C++.
- Experience implementing ZKP circuits or proof systems (Groth16, Halo, Plonk, STARKs, Marlin) is considered a plus.
Our team is 100% remote & we are hiring across the world. Here at Mysten Labs, you’ll be joining a world class team with tremendous growth potential. We raised our 1st funding round ($36m series A) from top Silicon Valley VCs led by Andreessen Horowitz (a16z) with participation from Redpoint, Lightspeed, Coinbase Ventures, Electric Capital, Standard Crypto, NFX, Slow Ventures, Scribble Ventures, Samsung Next, Lux Capital & many other great funds & angels!
Closing date for applications:
Contact: Kostas Chalkias (Chief Cryptographer) kostas {at} mystenlabs.com
More information: https://jobs.lever.co/mystenlabs/3733dd29-260f-41ac-80a6-127bd84aabd1
Composable Finance
You’ll be building the first ZK rollup in the Polkadot ecosystem with other exciting projects like Whirlpool Cash needing your expertise after.
As a high level blockchain developer with exposure to zero knowledge proofs, or cryptographer in the blockchain space with relevant programming skills, you’ll be working on cutting edge technology that will help shape DeFi.
Responsibilities
Requirements & skills:
Nice to have:
Perks: Competitive Crypto payments, all made in USDC.
Closing date for applications:
Contact: Maya Jerath
More information: https://incredulous.bamboohr.com/jobs/view.php?id=124
09 May 2022
University of Tübingen, Department of Computer Science; Tübingen, Germany
Research Topics: Development and analysis of cryptography-based privacy-preserving solutions for real-world healthcare problems. Topics of interest include (but are not limited to): privacy-preserving machine learning, genomic privacy, medical privacy as well as foundations for real-world cryptography.
Your profile:
- Completed Master's degree (or equivalent) at a top university with excellent grades in computer science, or a similar area.
- Knowledge in applied cryptography/security and cryptographic protocols.
- Knowledge in machine learning.
- Very good software development skills.
- Self-motivated, reliable, creative, can work independently and want to do excellent research.
Closing date for applications:
Contact: Dr. Mete Akgün (mete.akguen@uni-tuebingen.de)
PQShield
We are looking for a Cryptography Architect to join our team to help define the next generation of secure Hardware and Software implementations of Post Quantum Cryptography.
Responsibilities:Design, implement and analyse post quantum cryptographic algorithms including key exchange algorithms and digital signature schemes
- Investigate new and future algorithms, research potential implementations and optimisation for efficient implementation.
- Develop Architectural descriptions and models of PQ Cryptographic Algorithms
- Interface with the Engineering team, provide specifications for Micro-Architectural planning and implementation.
- Perform security analysis of Post Quantum and Classical Cryptography implementations
- Research and propose secure attack resistant (SCA, Fault) implementations of Post Quantum Algorithms.
- PhD or degree in Cryptography, Applied Cryptography, Mathematics or Computer Science
- 2+ years of work experience or research in the field of Post-Quantum Cryptography
- Knowledge of Secure Implementations of cryptography
- Knowledge of Side-channel analysis of cryptographic primitives
- Theoretical understanding of common side-channel countermeasures
- Programming skills , C/C++, Python, Mathematics tools
Closing date for applications:
Contact: Graeme Hickey
More information: https://pqshield.com/
Institute of Systems Architecture, Chair of Systems Engineering (www.inf.tu-dresden.de/sya/se)
Closing date for applications:
Contact: Prof. Dr. Christof Fetzer se@mailbox.tu-dresden.de
08 May 2022
University of Warsaw
Closing date for applications:
Contact: Stefan Dziembowski
More information: https://szkolydoktorskie.uw.edu.pl/en/mathematics-and-computer-sciences-recruitment-2022-2023/
Spanish National Research Council
Closing date for applications:
Contact: david.arroyo@csic.es
More information: https://comfuturo.es/
Luxembourg Institute of Science and Technology, Luxembourg
(1) To predict software security defects before deployment and prevent security breaches.
(2) To develop a set of algorithms that allow quantifying software exploitability and facilitate the work of correcting its errors.
(3) To develop and apply new model-checking techniques to verify the security of software.
(4) To specify and develop two workflow-disruptive techniques which leverages Intel SGX enclave trusted but with the lowest impact on the software lifecycle and on its performance.
(5) To implement and test the developed solutions.
(6) To develop ex-ante information security policies for the demonstration and implement periodic reviews to objectively evaluate adherence to the policies.
Closing date for applications:
Contact: Dr. Qiang Tang (qiang.tang@list.lu)
IO Global, remote working opportunity
We are leaders in the research field, with more than a hundred research papers published in the most influential cryptography conferences and journals (NDSS, ICDCS, EUROCRYPT, CRYPTO, SODA, ACM CCS, Financial Cryptography, ESORICS, S&P, Euro S&P, etc).
Your mission
- Define short, mid, and long term roadmaps for implementation of cryptographic primitives
- Synchronize with the Director of Engineering (or, by default, the CTO) to validate the roadmap, requirements, and strategy for the cryptographic engineering team
- Define and structure the team that is required to satisfy this roadmap
- Provide secure implementations of the cryptographic primitives required by IO projects
- Read and review cryptographic research papers and contribute when possible to implement them as prototypes
- Design, specify, implement, and improve cryptographic primitives in production-grade software directly or delegate to and supervise the applied cryptographers in charge of it
- Review, integrate, and improve common cryptographic primitives, and translate them to other programming languages or delegate/supervise the applied cryptographers in charge of it.
- A STEM Master’s or PhD degree Solid experience in managing small teams of cryptographic engineers
- Solid understanding of cryptography, its basic theories, and uses
- Senior expertise in developing cryptographic primitives in C/C++ and Rust
- Senior expertise in standard cryptography domains
- Ability to learn new domains like zero-knowledge proofs and MPC and project innovation roadmaps
- Clear understanding and experience of implementing cryptographic primitives delivered by researchers
Closing date for applications:
Contact: Aadil S.
More information: https://apply.workable.com/io-global/j/69087296EB/
Lund University
The Deal: Come here, do good research, share your knowledge. We'll pay you and help you shape your career towards your next goal! For further, official details, follow the link in the ad title.
Eyebird view of your role: You will be part of the research ecosystems around the SSF project SMARTY: Secure Software Update Deployment for the Smart City (RIT17-0035). This will give you access to an exciting workplace where you can foster research in collaboration with your new colleagues. As you'll be joining the security section of the SMARTY team, you will work with one senior researcher (Elena Pagnin) and one PhD student towards the following goals:
- Improving the efficiency of PQ primitives to better suit modern resourceful IoT devices.
- Investigating the potential of lightweight MPC for networks of IoT devices.
- Advancing the research frontiers in PETs, VC, and in other cryptographic schemes suitable for real-time system.
Funding & Timing: You get a 2-year, full-time employment as a Postdoctor at Lund university. The position is available immediately and with a flexible start date. There is an option to renew the contract for 1 additional year subject to acquiring funding (either by the candidate or by the host).
Closing date for applications:
Contact: Applications only via the official link: https://lu.varbi.com/en/what:job/jobID:500134/
More information: https://lu.varbi.com/en/what:job/jobID:500134/