IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
22 May 2023
Ping Wang, Yiting Su
Ghada Almashaqbeh, Rohit Chatterjee
In this paper, we investigate the relation between these two technologies; whether one can replace the other, or complement each other such that combining them brings the best of both worlds. Towards this goal, we review the quantum and unclonable polymer models, and existing unclonable cryptographic primitives. Then, we discuss whether these primitives can be built using the other technology, and show alternative constructions and notions when possible. We also offer insights and remarks for the road ahead. We believe that this study will contribute in advancing the field of unclonable cryptography on two fronts: developing new primitives, and realizing existing ones using new constructions.
Tabitha Ogilvie
We identify the dependence of HE noise on the underlying data as a critical barrier to privacy, and derive new results on the Differential Privacy under this constraint. We apply these ideas to a proof of concept HE application, ridge regression training using gradient descent, and are able to achieve privacy budgets of $\varepsilon \approx 2$ after 50 iterations.
Luke Harmon, Gaetan Delavignette, Arnab Roy, David Silva
17 May 2023
Lund University, Faculty of Engineering, Department of Electrical and Information Technology
Senior researchers will be active in the project and provide supervision. The work will primarily be funded through WASP (https://wasp-sweden.org/).
The main duties of doctoral students are to devote themselves to their research studies which includes participating in research projects and third cycle courses. The work duties can also include teaching and other departmental duties (no more than 20%).
Apply here: https://lu.varbi.com/what:job/jobID:627038/?lang=en
Closing date for applications:
Contact: Qian Guo
More information: https://lu.varbi.com/what:job/jobID:627038/?lang=en
Institute for Advancing Intelligence, TCG CREST, Kolkata
Closing date for applications:
Contact: nilanjan.datta@tcgcrest.org, avijit.dutta@tcgcrest.org, avik.chakraborti@tcgcrest.org
More information: https://www.tcgcrest.org/institutes/iai/
Rome, Italy, 14 December - 15 December 2023
Submission deadline: 31 May 2023
Notification: 31 July 2023
Copenhagen, Denmark, 30 November 2023
Submission deadline: 25 June 2023
Notification: 5 August 2023
Atlanta, United States, 31 October - 2 November 2023
Submission deadline: 1 July 2023
Notification: 10 August 2023
16 May 2023
Dai xiaokang, Jingwei Chen, Wenyuan Wu, Yong Feng
In addition, as an independent result, we have also proved the regularity of the hash function mapped to the prime-order group and its Cartesian product.
As an application of the above results, we improved the multi-key fully homomorphic encryption\cite{TCC:BraHalPol17} and answered the question raised at the end of their work in positive way : we have GSW type ciphertext rather than Dual-GSW, and the improved scheme has shorter keys and ciphertexts
S Murugesh
Mehmet Sabir Kiraz, Enrique Larraia, Owen Vaughan
Koustabh Ghosh, Jonathan Fuchs, Parisa Amiri Eliasi, Joan Daemen
Jeffrey Champion, David J. Wu
In this work, we study a similar question of leveraging succinctness for zero-knowledge. Our starting point is a batch argument for NP, a primitive that allows a prover to convince a verifier of $T$ NP statements $x_1, \ldots, x_T$ with a proof whose size scales sublinearly with $T$. Unlike SNARGs for NP, batch arguments for NP can be built from group-based assumptions in both pairing and pairing-free groups and from lattice-based assumptions. The challenge with batch arguments is that the proof size is only amortized over the number of instances, but can still encode full information about the witness to a small number of instances.
We show how to combine a batch argument for NP with a local pseudorandom generator (i.e., a pseudorandom generator where each output bit only depends on a small number of input bits) and a dual-mode commitment scheme to obtain a NIZK for NP. Our work provides a new generic approach of realizing zero-knowledge from succinctness and highlights a new connection between succinctness and zero-knowledge.
Xiaohan Yue
Saleh Khalaj Monfared, Tahoura Mosavirik, Shahin Tajik
Yupu Hu, Dong Siyue, Wang Baocang, Dong Xingting
In this paper we restrict IO to be a real white box (RWB). Under such restriction we point out that LV16/Lin17 CFE algorithms being inserted into AJ15 IO frame are invalid. More detailedly, such insertion makes the adversary gradually learn the shape of the function, therefore the scheme is not secure. In other words, such scheme is not a real IO scheme, but rather a garbling scheme. It needs to be said that RWB restriction is reasonable, which means the essential contribution of IO for cryptography research.
Quang Dao, Jim Miller, Opal Wright, Paul Grubbs
In this paper, we fill this knowledge gap via a broad theoretical and practical study of F-S in implementations of modern proof systems. We perform a survey of open-source implementations and find 36 weak F-S implementations affecting 12 different proof systems. For four of these---Bulletproofs, Plonk, Spartan, and Wesolowski's VDF---we develop novel knowledge soundness attacks accompanied by rigorous proofs of their efficacy. We perform case studies of applications that use vulnerable implementations, and demonstrate that a weak F-S vulnerability could have led to the creation of unlimited currency in a private blockchain protocol. Finally, we discuss possible mitigations and takeaways for academics and practitioners.
Ginevra Giordani, Lorenzo Grassi, Silvia Onofri, Marco Pedicini
Erica Blum, Jonathan Katz, Julian Loss, Kartik Nayak, Simon Ochsenreither
We propose Abraxas, a generic approach for constructing a hybrid protocol based on any protocol $\Pi_\mathsf{fast}$ and any asynchronous protocol $\Pi_\mathsf{slow}$ to achieve (1)~security and performance equivalent to $\Pi_\mathsf{slow}$ under arbitrary network behavior; (2)~performance equivalent to $\Pi_\mathsf{fast}$ when conditions are favorable. We instantiate Abraxas with the best existing protocols for $\Pi_\mathsf{fast}$ (Jolteon) and $\Pi_\mathsf{slow}$ (2-chain VABA), and show experimentally that the resulting protocol significantly outperforms Ditto, the previous state-of-the-art hybrid protocol.