IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
05 July 2023
Alishah Chator, Matthew Green, Pratyush Ranjan Tiwari
ePrint ReportMojtaba Bisheh Niasar, Daniel Lo, Anjana Parthasarathy, Blake Pelton, Bharat Pillilli, Bryan Kelly
ePrint ReportRasheed Kibria, Farimah Farahmandi, Mark Tehranipoor
ePrint ReportBoris Ryabko
ePrint ReportEliana Carozza, Geoffroy Couteau, Antoine Joux
ePrint ReportThe analysis of our construction is non-trivial and forms a core technical contribution of our work. It requires careful combinatorial analysis and combines several new ideas, such as analyzing soundness in a relaxed setting where a cheating prover is allowed to use any witness sufficiently close to a regular vector. We complement our analysis with an in-depth overview of existing attacks against RSD.
Our signatures are competitive with the best-known code-based signatures, ranging from $12.52$ KB (fast setting, with a signing time of the order of a few milliseconds on a single core of a standard laptop) to about $9$ KB (short setting, with estimated signing time of the order of 15ms).
Rujia Li, Xuanwei Hu, Qin Wang, Sisi Duan, Qi Wang
ePrint ReportPawel Cyprys, Shlomi Dolev, Oded Margalit
ePrint ReportIn order to enhance the security of our approach, we propose the integration of a secret-sharing scheme based on a linear polynomial. This helps mitigate collisions and adds an additional layer of perfect security. We thoroughly investigate the interactions between different aspects of one-way functions to strengthen the reliability of commitments. Lastly, we explore the possibility of nesting one-way functions as a countermeasure against potential backdoors.
Through our study, we aim to contribute to the advancement of secure encryption techniques by leveraging the inherent strengths of the one-time pad and carefully considering the interplay of various components in the design of one-way functions.
Tim Dokchitser, Alexandr Bulkin
ePrint Report04 July 2023
Chair of IT Security at the Brandenburg University of Technology Cottbus-Senftenberg
Job PostingCandidates must hold a Master’s degree or equivalent in Computer Science or related disciplines, or be close to completing it. If you are interested, please send your CV, transcript of records from your Master studies, and an electronic version of your Master's thesis (if possible), as a single pdf file. The positions will remain open until they are filled.
Closing date for applications:
Contact: Ivan Pryvalov (ivan.pryvalov@b-tu.de)
Aarhus University Crypto Group, Denmark
Job PostingClosing date for applications:
Contact: Sophia Yakoubov (sophia.yakoubov@cs.au.dk)
Leuven, Belgium, 25 March - 29 March 2024
FSE03 July 2023
SUTD, Singapore
Job PostingWe are looking for postdocs / research fellows with expertise on cybersecurity in general and CPS security in particular. The candidates should meet the following requirements.
Fresh PhD graduates are welcome to apply. Only short-listed candidates will be contacted for interview. Successful candidates will be offered internationally competitive remuneration. Interested candidates please send your CV to Prof. Jianying Zhou.
Closing date for applications:
Contact: Prof. Jianying Zhou [jianying_zhou@sutd.edu.sg]
Security Analysis of a Color Image Encryption Scheme Based on a Fractional‑Order Hyperchaotic System
George Teseleanu
ePrint ReportYujin Oh, Kyungbae Jang, Anubhab Baksi, Hwajeong Seo
ePrint ReportJoachim Zahnentferner
ePrint ReportQi Wang, Haodong Huang, Juyan Li
ePrint ReportMaxim Jourenko, Mario Larangeira
ePrint ReportRamiro Martínez, Paz Morillo, Sergi Rovira
ePrint ReportLorenzo Grassi, Dmitry Khovratovich, Reinhard Lüftenegger, Christian Rechberger, Markus Schofnegger, Roman Walch
ePrint ReportAlireza Kavousi, Aydin Abadi, Philipp Jovanovic
ePrint ReportThis paper presents the notion of timed secret sharing (TSS), providing lower and upper time bounds for secret reconstruction with the use of time-based cryptography. The recent advances in the literature including short-lived proofs [Asiacrypt 2022], enable us to realize an upper time bound shown to be useful in breaking public goods game, an inherent issue in secret sharing-based systems. Moreover, we establish an interesting trade-off between time and fault tolerance in a secret sharing scheme by having dealer gradually release additional shares over time, offering another approach with the same goal. We propose several constructions that offer a range of security properties while maintaining practical efficiency. Our constructions leverage a variety of techniques and state-of-the-art primitives.