IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
28 February 2021
X-Logos LLC, Colorado Springs, CO, USA
Company's mission: Original solutions for the security and economic demands of data and data owners.
Seniority level: Open to discussion. Lack of industry experience can be compensated by academic achievements.
Industry: Information Technology, Cybersecurity, Data Science.
Available employment types: full-time, part-time, in-person, remote.
Responsibilities:
- Stay current with advances in cryptography, related areas, and the underlying mathematical subjects.
- Understand and implement existing cryptographic constructions in the literature and industry.
- Help to design and to evaluate new cryptographic schemes and protocols.
Minimum Qualifications:
- Ph.D. in Computer Science, Mathematics, Engineering, or another related field.
- Fluency in at least one of the following programming languages: C, C++, Python, Ruby, Go, Java.
- Reasonable proficiency in several topics in discrete mathematics (in particular, logic, group theory, probability, number theory, and linear algebra).
Preferred:
- Track record of peer-reviewed publications related to cryptography and mathematics in general.
- Experience with cryptanalysis.
Benefits:
- Work with challenging problems for deploying real-world applications of significant impact in the industry.
- Direct contact with crypto experts in in-depth discussions and analysis of ongoing projects.
- Learn from veterans from the industry of new technologies.
- Incentives for writing scientific papers, patents, and participating in academic conferences and other related events.
- Budget for investing in continued education (books, courses, seminars, certifications, among others).
- Visa sponsorship (when applicable).
- Dental, vision, and health insurance (for full-time employees).
- Salary to be defined according to the seniority and employment level.
Closing date for applications:
Contact: David Silva, david@x-logos.com
DFINITY
- Cryptography
- Distributed systems
- Formal verification
- Networking
- Computer
- Operating systems
- Embedded system
- Pen testing
Closing date for applications:
Contact: Jens Groth: jens AT dfinity.org
More information: https://dfinity.org/careers
DFINITY, Zurich and Bay Area
Closing date for applications:
Contact: Jens Groth: jens AT dfinity.org
More information: https://dfinity.org/careers
University of Tartu, Estonia
We are searching for candidates who are enthusiastic about driving forward the field of quantum cryptography (including post-quantum crypto), especially provable quantum security. The research takes place in the context of an ERC project that targets formally verified quantum cryptographic proofs.
For more information, see the link below. Please forward this to anyone potentially interested, and do not hesitate to contact me.
Closing date for applications:
Contact: Dominique Unruh, unruh@ut.ee
More information: https://crypto.cs.ut.ee/Main/PostdocInPost-QuantumCryptography
24 February 2021
Hanshen Xiao, Srinivas Devadas
We study the applications of such a framework from generalized linear regression models to modern learning techniques, such as deep learning. On the information theoretical privacy side, we compare three privacy interpretations: ambiguity, statistical indistinguishability (Differential Privacy) and PAC inference resistance, and precisely describe the information leakage of our framework. We show the advantages of this new random transform approach with respect to underlying privacy guarantees, computational efficiency and utility for fully connected neural networks.
Sergiu Carpov, Kevin Deforth, Nicolas Gama, Mariya Georgieva, Dimitar Jetchev, Jonathan Katz, Iraklis Leontiadis, M. Mohammadi, Abson Sae-Tang, Marius Vuille
Shuo Sun, Yongbin Zhou, Yunfeng Ji, Rui Zhang, Yang Tao
First, we propose a secure, efficient exponential Bernoulli sampling algorithm. It can be applied to Gaussian samplers based on rejection samplings. We apply it to FALCON, a candidate of round 3 of the NIST post-quantum cryptography standardization project, and reduce its signature generation time by 13.66%-15.52%.
Second, we develop a new Gaussian sampler based on rejection sampling. Our Algorithm can securely sample from Gaussian distributions with different standard deviations and arbitrary centers. We apply it to PALISADE (S&P'18), an open-source lattice cryptography library. The new implementation of trapdoor sampling in PALISADE has better performance while resisting timing attacks.
Third, we improve the efficiency of the COSAC sampler (PQC'20). The new COSAC sampler is 1.46x-1.63x faster than the original and has the lowest expected number of trials among all Gaussian samplers based on rejection samplings. But it needs a more efficient algorithm sampling from the normal distribution to improve its performance.
Tatsuki Ono, Song Bian, Takashi Sato
Guilherme Perin, Lichao Wu, Stjepan Picek
This paper proposes using a pruning strategy and recently proposed Lottery Ticket Hypothesis to improve the deep learning-based SCA. We demonstrate that we can find smaller neural networks that perform on the level of larger networks, where we manage to reduce the number of weights by more than 90% on average. Additionally, we show that pruning can help prevent overfitting and the effects of imbalanced data, reaching top attack performance for small networks when larger networks do not manage to break the target at all.
Xu Liu, Mingqiang Wang
Karim Baghery, Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy
Raghvendra Rohit, Kai Hu, Sumanta Sarkar, Siwei Sun
Jan-Pieter D'Anvers, Senne Batsleer
Jan Czajkowski
Yaroslav Balytskyi, Manohar Raavi, Anatoliy Pinchuk, Sang-Yoon Chang
Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen
Khorasgani, Maji, and Nguyen (EPRINT--2020) introduce the notion of secure non-interactive simulation (SNIS) as a natural cryptographic extension of concepts like non-interactive simulation and non-interactive correlation distillation in theoretical computer science and information theory. In SNIS, the parties apply local reduction functions to their samples to produce the samples of another distribution. This work studies the decidability problem of whether a sample from the noise $(X,Y)$ can securely and non-interactively simulate BSS samples. As is standard in analyzing non-interactive simulations, our work relies on Fourier analytic techniques to approach this decidability problem. Our work begins by algebraizing the simulation-based security definition of SNIS. Then, using this algebraized definition of security, we analyze the properties of the Fourier spectrum of the reduction functions.
Given $(X,Y)$ and BSS with parameter $\epsilon$, our objective is to distinguish between the following two cases. (A) Does there exist a SNIS from BSS$(\epsilon)$ to $(X,Y)$ with $\delta$-insecurity? (B) Do all SNIS from BSS$(\epsilon)$ to $(X,Y)$ incur $\delta'$-insecurity, where $\delta'>\delta$? We prove that there exists a bounded computable time algorithm achieving this objective for the following cases. (1) $\delta=\bigO{1/n}$ and $\delta'=$ positive constant, and (2) $\delta=$ positive constant, and $\delta'=$ another (larger) positive constant. We also prove that $\delta=0$ is achievable only when $(X,Y)$ is another BSS, where $(X,Y)$ is an arbitrary distribution over $\minusoo\times\minusoo$. Furthermore, given $(X,Y)$, we provide a sufficient test determining if simulating BSS samples incurs a constant-insecurity, irrespective of the number of samples of $(X,Y)$.
Technically, our work proceeds by demonstrating that the weight of the Fourier spectrum of the reduction functions is at most $\bigO{\delta}$ on higher-order components, where $\delta$ is the insecurity of the SNIS.
23 February 2021
National Yunlin University of Science and Technology, Douliou, Yunlin County, Taiwan
Keywords: Post-quantum cryptography, multivariate cryptography, multi-party computation, cryptographic protocols.
National Yunlin University of Science and Technology, Douliou, Yunlin County, Taiwan. YUNTECH is looking forward to recruiting young, talented and self-motivated students on two Ph.D. positions at PhD program of “Electrical Engineering and Computer Science” and “Information Management” to work on any of the following areas of applied cryptography under the supervision of Dr. Saru Kumari. Dr. Saru Kumari will join YUNTECH on 1st August 2021.
- Design of post-quantum cryptographic protocols
- Software and hardware implementation of post-quantum cryptographic protocols
- Multi-party computation
- Cryptographic protocols and their implementation
- Privacy-preserving cryptographic protocols for cloud/edge/fog computing
- Multivariate cryptographic protocols
- A bachelor & master degree in Computer Science/Information Security
- Strong mathematical background
- Proficient written and verbal communication skills in English
- Basic knowledge of blockchain technology
- Elementary knowledge of crypto-currencies and their security
What we provide: As one of the best engineering and technology universities, YUNTECH provides students with excellent academic and practical training, an excellent research environment, and strong supervision by world-class scholars. We help graduates to develop their career in information and telecommunication industry and semiconductor industry, the outstanding industry of Taiwan in the world. Students recommended by Dr Kumari will get a full tuition waiver and a monthly stipend.
How to apply:- CV (highlighting their interests and strengths)
- Transcripts
- via email with the subject line:- “Application for Ph.D. in applied cryptography at YUNTECH”, to Dr Saru Kumari at saryusiirohi@gmail.com keeping cc Hsin-I Huang (Sandy) at hsinyier@yuntech.edu.tw
- Application guide: https://reurl.cc/qmLgbg
- Application deadline: May 21, 2021.
Closing date for applications:
Contact: Dr Saru Kumari at saryusiirohi@gmail.com keeping cc Hsin-I Huang (Sandy) at hsinyier@yuntech.edu.tw
More information: https://eng.yuntech.edu.tw/
Villanova University, Philadelphia, PA, USA
Requirements: preferred to be at the majors of Cryptography, Mathematics, Computer Science, Computer Engineering, Electrical Engineering and related others. Familiar with cryptanalysis and fault attack/detection will be desirable. Proficiency in programming languages such as C/C++ etc. Good at English communication and writing. Great enthusiasm of doing research oriented tasks. Excellent team work member.
Degree: both B.S. and M.S. graduates or similar are warmly welcomed to apply. Start date: Fall 2021. It is always better to apply as early as possible. Positions are open until they are filled.
The 2021 U.S. News & World Report ranks Villanova as tied for the 53th best National University in the U.S (Famous Alumni includes the Current First Lady of the United States, etc.).
Brief introduction of Dr. Xie: Dr. Jiafeng Harvest Xie is currently an Assistant Professor at the Department of Electrical and Computer Engineering of Villanova University. His research interests include cryptographic engineering, hardware security, and VLSI digital design. He is the Best Paper Awardee of IEEE HOST 2019. He has served the Associate Editor for Microelectronics Journal, IEEE Access, and IEEE Trans. Circuits and Systems II. He has also been awarded the 2019 IEEE Access Outstanding Associate Editor.
Closing date for applications:
Contact: Jiafeng Xie
More information: https://www1.villanova.edu/villanova/engineering/departments/ece/facultyStaff/biodetail.html?mail=jiafeng.xie@villanova.edu&xsl=bio_long
IRISA, Rennes, France
Requirements:
Closing date for applications:
Contact: Annelie Heuser, annelie.heuser@irisa.fr
Kudelski Security, Switzerland and USA
Kudelski Security, a division of the Kudelski Group, is an innovative, independent Swiss provider of tailored cyber and media security solutions to enterprises and public sector institutions. Founded in 2012, Kudelski Security is headquartered in Phoenix, Arizona and Cheseaux-sur-Lausanne, Switzerland, and has offices all around the globe. For more information, please visit: www.kudelskisecurity.com
The Kudelski Security Research Team is looking for one (or more) researchers experienced with cryptography. You’ll join a multi-disciplinary team with members focused on cutting edge areas such as cryptography, quantum security, privacy preserving technologies, and AI security just to name a few. The position can be on-site or remote, and includes attractive salary and benefits depending on your seniority level.
Principal Duties:
Required:
For further information: https://careers.nagra.com/?page=adverti
Closing date for applications:
Contact: tommaso.gagliardoni@kudelskisecurity.com
More information: https://careers.nagra.com/?page=advertisement_display&id=11828