IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
02 January 2020
Norwegian University of Science and Technology (NTNU), Trondheim, Norway
Job PostingAn opportunity has arisen for a 3-year postdoctoral researcher to be appointed as soon as possible. The candidate will be concerned with design and analysis of different cryptographic primitives and protocols. Examples may include lightweight identification and authentication protocols, key management protocols providing long-term security, incremental cryptographic primitives, and quantum-secure protocols based on different post-quantum primitives. Technique of formal analysis, including reductionist security and suitable symbolic analysis methods, may be used.
The candidate will work on a project entitled "Lightweight Cryptography for Future Smart Networks" funded by the Norwegian Research Council. The project will develop new primitives and protocols for lightweight cryptography fitting the needs of the two critical and strongly related future network architectures, IoT and 5G.
Postdoctoral candidates are normally remunerated from NOK 515 200 before tax per year. Completion of a doctoral degree in cryptology or network security is required.
Applicants should send an expression of interest to Colin Boyd together with a recent CV.
Closing date for applications:
Contact: Prof Colin Boyd
Cryptanalysis Taskforce @ Nanyang Technological University, Singapore
Job Posting- tool aided cryptanalysis, such as MILP, CP, STP, and SAT
- machine learning aided cryptanalysis and designs
- privacy-preserving friendly symmetric-key designs
- quantum cryptanalysis
- cryptanalysis against SHA-3 and AES
Closing date for applications:
Contact: Asst Prof. Jian Guo, guojian@ntu.edu.sg
More information: http://team.crypto.sg
Spanish National Research Council (CSIC -Consejo Superior de Investigaciones Científicas)
Job PostingClosing date for applications:
Contact: David Arroyo Guardeño, email: david.arroyo (at) csic.es
More information: http://www.ciencia.gob.es/portal/site/MICINN/menuitem.791459a43fdf738d70fd325001432ea0/?vgnextoid=909662ecfa1de610VgnVCM
Marc Beunardeau, Fatima-Ezzhara El Orche, Diana Maimut, David Naccache, Peter B. Roenne, Peter Y.A. Ryan
ePrint Report31 December 2019
CHES
30 December 2019
Rajeev Anand Sahu, Agnese Gini, Ankan Pal
ePrint ReportJoon-Woo Lee, Young-Sik Kim, Jong-Seon No
ePrint ReportChang-Bin Wang, Shu-Mei Hsu, Hsiang Chang, Jue-Sam Chou
ePrint ReportAshwin Jha, Mridul Nandi
ePrint ReportAlex Ozdemir, Riad S. Wahby, Dan Boneh
ePrint ReportIn this work, we use a combination of existing and novel techniques to implement an RSA accumulator inside of a SNARK, and use it as a replacement for a Merkle tree. We specifically optimize the accumulator for compatibility with SNARKs. Our experiments show that the resulting system can dramatically reduce costs compared to existing approaches that use Merkle trees for committing to the current state. These results apply broadly to any system that needs to offload batches of state updates to an untrusted server.
Kwang Ho Kim, Junyop Choe, Sihem Mesnager
ePrint ReportSubsequently, in \cite{Bluher2004,HK2008,HK2010,BTT2014,Bluher2016,KM2019,CMPZ2019,MS2019}, the $\GF{Q}$-zeros of $P_a(X)$ have been studied: in \cite{Bluher2004} it was shown that the possible values of the number of the zeros that $P_a(X)$ has in $\GF{Q}$ is $0$, $1$, $2$ or $p^{\gcd(n, k)}+1$. Some criteria for the number of the $\GF{Q}$-zeros of $P_a(x)$ were found in \cite{HK2008,HK2010,BTT2014,KM2019,MS2019}. However, while the ultimate goal is to identify all the $\GF{Q}$-zeros, even in the case $p=2$, it was solved only under the condition $\gcd(n, k)=1$ \cite{KM2019}.
We discuss this equation without any restriction on $p$ and $\gcd(n,k)$. New criteria for the number of the $\GF{Q}$-zeros of $P_a(x)$ are proved. For the cases of one or two $\GF{Q}$-zeros, we provide explicit expressions for these rational zeros in terms of $a$. For the case of $p^{\gcd(n, k)}+1$ rational zeros, we provide a parametrization of such $a$'s and express the $p^{\gcd(n, k)}+1$ rational zeros by using that parametrization.
Jean-Philippe Aumasson
ePrint ReportYuyin Yu, Nikolay Kaleyski, Lilya Budaghyan, Yongqiang Li
ePrint ReportJintai Ding, Joshua Deaton, Kurt Schmidt, Vishakha, Zheng Zhang
ePrint ReportJoel Alwen, Margarita Capretto, Miguel Cueto, Chethan Kamath, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter
ePrint ReportShohei Egashira, Yuyu Wang, Keisuke Tanaka
ePrint ReportChanghai Ou, Degang Sun, Siew-Kei Lam, Xinping Zhou, Kexin Qiao, Qu Wang
ePrint ReportRamiro Martínez, Paz Morillo
ePrint ReportAs an application we present Zero-Knowledge Proofs of Knowledge of relations between committed messages. The resulting commitment scheme is perfectly binding with overwhelming probability over the choice of the public key, and computationally hiding under the RLWE assumption. Compared with previous Stern-based commitment scheme proofs we decrease computational complexity, improve the size of the parameters and reduce the soundness error of each round.