IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
08 June 2022
Gilad Stern, Ittai Abraham
ePrint ReportHosein Hadipour, Maria Eichlseder
ePrint ReportIn this paper, we propose integral key-recovery attacks on up to 32 rounds by improving both the integral distinguisher and the key-recovery approach substantially. For the distinguisher, we show how to model the monomial prediction technique proposed by Hu et al. at ASIACRYPT 2020 as a SAT problem and thus create a bit-oriented model of WARP taking the key schedule into account. Together with two additional observations on the properties of WARP's construction, we extend the best previous distinguisher by 2 rounds (as a classical integral distinguisher) or 4 rounds (for a generalized integral distinguisher). For the key recovery, we create a graph-based model of the round function and demonstrate how to manipulate the graph to obtain a cipher representation amenable to FFT-based key recovery.
Jiangshan Long, Changhai Ou, Zhu Wang, Shihui Zheng, Fei Yan, Fan Zhang, Siew-Kei Lam
ePrint ReportParker Newton, Silas Richelson
ePrint ReportIn this work, we identify an obstacle for proving the hardness of LWR via a reduction from LWE in the above parameter regime. Specifically, we show that any "point-wise" reduction from LWE to LWR can be used to directly break the corresponding LWE problem. A reduction is "point-wise" if it maps LWE samples to LWR samples one at a time. Our argument goes roughly as follows: first we show that any point-wise reduction from LWE to LWR must have good agreement with some affine map; then we use a Goldreich-Levin-type theorem to extract the LWE secret given oracle access to a point-wise reduction with good affine agreement. Both components may be of independent interest.
Chenar Abdulla Hassan, Oğuz Yayla
ePrint ReportPatrick Derbez, Marie Euler, Pierre-Alain Fouque, Phuong Hoa Nguyen
ePrint ReportThomas Schamberger, Lukas Holzbaur, Julian Renner, Antonia Wachter-Zeh, Georg Sigl
ePrint Report07 June 2022
Technology Innovation Institute (TII) - Abu Dhabi, UAE
Job PostingTechnology Innovation Institute (TII) is a publicly funded research institute, based in Abu Dhabi, United Arab Emirates. It is home to a diverse community of leading scientists, engineers, mathematicians, and researchers from across the globe, transforming problems and roadblocks into pioneering research and technology prototypes that help move society ahead.
Cryptography Research Center
In our connected digital world, secure and reliable cryptography is the foundation of digital information security and data integrity. We address the world’s most pressing cryptographic questions. Our work covers post-quantum cryptography, lightweight cryptography, cloud encryption schemes, secure protocols, quantum cryptographic technologies and cryptanalysis.
Position: Post Quantum Cryptography Expert
Skills required for the job
Qualifications
Closing date for applications:
Contact:
Mehdi Messaoudi - Talent Acquisition Manager
mehdi.messaoudi@tii.ae
University of Technology Sydney, Sydney, New South Wales, Australia
Job PostingThe School of Electrical & Data Engineering is deeply engaged in research of national and international standing in many areas. Key areas include: wireless communications and networking, Internet of Things (IoT), applied electro-magnetics and antennas, electrical systems and power electronics, image processing, computer vision, machine learning, cybersecurity, big data analytics and big data systems, and RF IC design. Our School hosts three IEEE Fellows and 3 ARC DECRA grant holders and we conduct research funded by government agencies and national and international industry partners.
About the role
Conduct research in:
1) Computing on encrypted data technologies in the context of privacy-preserving Federated Learning in particular secure multi-party computation and homomorphic encryption
2) Design and development of trustworthy digital cleanrooms/marketplaces using privacy-preserving computing technologies
About you
• Computer Science or Engineering PhD in cryptographic communication protocols or secure multi-party computation or federated learning.
• Thorough knowledge of the mathematical and statistical foundations of cryptographic systems.
• Proficient in one or more of the following: Rust, Go, C++, C, Python, Java.
• Demonstrated record of research in cryptographic communication protocols or secure multi-party computation.
Closing date for applications:
Contact: A/Prof Justin Lipman
email: justin.lipman@uts.edu.au
More information: https://www.seek.com.au/job/57060632
Temasek Laboratories, National University of Singapore, Singapore
Job PostingClosing date for applications:
Contact: Dr Chik How Tan, tsltch@nus.edu.sg
06 June 2022
Ling Song, Nana Zhang, Qianqian Yang, Danping Shi, Jiahao Zhao, Lei Hu, and Jian Weng
ePrint ReportKaibo Liu, Xiaozhuo Gu, Peixin Ren, and Xuwen Nie
ePrint ReportJelle Vos, Mauro Conti, and Zekeriya Erkin
ePrint ReportHuawei Liu, Zilong Wang, and Liu Zhang
ePrint ReportIn this paper, we focus on constructing an automatic search model that can more accurately characterize the BDPT propagation. Firstly, we define a new notion named BDPT Trail, which divides the BDPT propagation into three parts: the division trail K, division trail L, and Key-Xor operation. Secondly, we improve the insufficiency of the previous methods of calculating division trails and propose an effective algorithm that can obtain more valid division trails L of the S-box operation. Thirdly, we propose a new algorithm that models each Key-Xor operation based on MILP technique for the first time. Based on this, we can accurately characterize the Key-Xor operation by solving these MILP models. After that, by selecting appropriate initial BDPT and stopping rules, we construct an automatic search model that more accurately characterizes the BDPT propagation. As a result, our automatic search model is applied to search integral distinguishers for some block ciphers. For Rectangle, we find a 10-round integral distinguisher which is one more round than the previous best results. For Simon64, we can find more balanced bits than the previous longest distinguishers. For Present, we find a better 9-round integral distinguisher with less active bits.
Sergiu Bursuc and Sjouke Mauw
ePrint ReportReza Ghasemi and Alptekin Küpçü
ePrint ReportYacov Manevich and Adi Akavia
ePrint ReportIn this work we formulate a new cryptographic primitive: Attribute Verifiable Timed Commitment which enables to prove that a timed commitment commits to a value which possesses certain attributes. Using our cryptographic primitive, we describe a new cross chain atomic swap protocol that operates without blockchain derived time and unlike the state of the art, all parties can instantly abort the swap without waiting for the safety timeouts to expire.
In order to prove in zero knowledge that a secret committed to using a timed commitment has a claimed hash value, we employ the "MPC in the head" technique by Ishai et al. and implement our zero-knowledge proof protocol and evaluate its performance. As part of our techniques, we develop a novel and efficient procedure for integer Lower-Than validation in arithmetic circuits which may be of independent interest.