IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
15 February 2023
Ahmad Al Badawi, Yuriy Polyakov
ePrint ReportOur performance evaluation suggests that the bootstrapping in the Cheon-Kim-Kim-Song (CKKS) scheme provides highest throughput and efficiently achieves large precision for vectors of real numbers, which are often used in machine learning applications. The Ducas-Micciancio (DM) and Chillotti-Gama-Georgieva-Izabachene (CGGI) schemes achieve the smallest latency (typically for small integers or small-precision fixed-point numbers) and provide a general capability for evaluating arbitrary functions (programmable bootstrapping) via lookup tables. The Brakerski-Gentry-Vaikuntanathan (BGV) and Brakerski/Fan-Vercauteren (BFV) schemes provide higher bootstrapping throughput than DM/CGGI for vectors of small integers or finite-field elements but do not support programmable bootstrapping.
The target audience is anyone interested in FHE. We intend to keep this paper up-to-date to include new bootstrapping results as they become available.
Ripon Patgiri, Laiphrakpam Dolendro Singh
ePrint ReportChaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi
ePrint ReportIn this work, we generalize the former result and prove simulation extractability in the programmable random oracle model, removing the need for the algebraic group model. Along the way, we establish a generic chain of reductions for Fiat-Shamir-transformed multi-round public-coin proofs to be simulation-extractable in the (programmable) random oracle model, which may be of independent interest.
Da Lin, Zejun Xiang, Runqing Xu, Shasha Zhang, Xiangyong Zeng
ePrint ReportXinxin Gong, Yonglin Hao, Qingju Wang
ePrint ReportHisham S. Galal, Amr M. Youssef
ePrint ReportMarloes Venema
ePrint ReportIn this work, we present the first compiler for attribute-based encryption schemes that supports such extensions. To this end, we generalize the definitions of pair encodings and the symbolic property. With our compiler, we flexibly instantiate any pair encodings that satisfy this new notion of the symbolic property in any pairing-friendly groups, and generically prove the resulting scheme to be selectively secure. To illustrate the effectiveness of our new compiler, we give several new multi-authority and hash-based constructions.
Soundes Marzougui, Ievgan Kabin, Juliane Krämer, Thomas Aulbach, Jean-Pierre Seifert
ePrint ReportWe accomplish the attack on FrodoKEM, a lattice-based KEM and third-round alternate candidate. We execute it on a Cortex-M4 board equipped with an STM32F4 micro-controller clocked at different frequencies.
Reyhaneh Rabaninejad, Alexandros Bakas, Eugene Frimpong, Antonis Michalas
ePrint ReportJianwei Li, Michael Walter
ePrint ReportAlessandro Budroni, Erik Mårtensson
ePrint ReportChloé Hébant, David Pointcheval, Robert Schädlich
ePrint ReportJoakim Brorsson, Bernardo David, Lorenzo Gentile, Elena Pagnin, Paul Stankovski Wagner
ePrint ReportKaizhan Lin, Jianming Lin, Shiping Cai, Weize Wang, Chang-An Zhao
ePrint ReportIn this paper, we present several new techniques to compress the public key of M-SIDH. Our method to compress the key is reminiscent of public-key compression in SIDH/SIKE, including torsion basis generation, pairing computation and discrete logarithm computation. We also prove that compressed M-SIDH is secure if M-SIDH is secure.
Experimental results showed that our approach fits well with compressed M-SIDH. It should be noted that most techniques proposed in this paper could be also utilized into other SIDH-like protocols.
14 February 2023
Award
Nominations for the 2023 Test-of-Time award (for papers published in 2008) will be accepted until Feb 15, 2023.
https://iacr.org/testoftime
Real World Crypto
RWC 2023 will take place in Tokyo, Japan on March 27-29 2023.
The registration site is now open:
https://rwc.iacr.org/2023/registration.php
Kyoto, Japan, 19 June - 22 June 2023
Event CalendarSubmission deadline: 20 March 2023
Notification: 19 April 2023
13 February 2023
Virtual event, Anywhere on Earth, 19 June - 22 June 2023
Event CalendarSubmission deadline: 1 March 2023
Notification: 9 April 2023
Centre for Secure Information Technologies (CSIT), Queen’s University Belfast, UK
Job PostingApplicants must have at least a 2:1 Honours Degree in Electrical and Electronics Engineering, Computer Science, Mathematics or closely related discipline.
International studentships are also available.
Closing date for applications:
Contact: Dr. Ayesha Khalid
More information: https://www.qub.ac.uk/courses/postgraduate-research/phd-opportunities/lightweight-post-quantum-cryptography-on-modern-opensource-riscv-processors.html
Centre for Secure Information Technologies (CSIT), Queen’s University Belfast, UK
Job PostingApplicants must have at least a 2:1 Honours Degree in Electrical and Electronics Engineering, Computer Science, Mathematics or closely related discipline.
International studentships are also available.
Closing date for applications:
Contact: Dr. Ayesha Khalid
More information: https://www.qub.ac.uk/courses/postgraduate-research/phd-opportunities/fault-tolerant-post-quantum-cryptography-systems-for-satellite-communications.html