Aleksei UdovenkoApparently I can only get a #Eurocrypt paper (or two) once every 5 years 🙃 (since 2016)
SalusaSecondus#Eurocrypt here we come!
CosicBe🐝The COSIC blog has been buzzing lately!
Looking for a fun read? Check out Oliver’s hilarious post on "The REAL Best Papers of #Eurocrypt 2025"
👉 https://www.esat.kuleuven.be/cosic/blog/the-real-best-papers-of-eurocrypt-2025/
Missed #Eurocrypt or curious about FHE, PCGs, MPC, ZKPs and more? Dive into:
🔗 https://www.esat.kuleuven.be/cosic/cosic-cryptography-blog/
Looking for a fun read? Check out Oliver’s hilarious post on "The REAL Best Papers of #Eurocrypt 2025"
👉 https://www.esat.kuleuven.be/cosic/blog/the-real-best-papers-of-eurocrypt-2025/
Missed #Eurocrypt or curious about FHE, PCGs, MPC, ZKPs and more? Dive into:
🔗 https://www.esat.kuleuven.be/cosic/cosic-cryptography-blog/
Our researcher Oliver Zajonc wrote one of his funny blog posts on "The REAL Best Papers of..." #Eurocrypt 2025. He presents "the best papers, as awarded by a biased panel of judge on the basis of entertainment value alone, none of that relevance and scientific achievement here".
➡️Quickly head on over to
https://www.esat.kuleuven.be/cosic/blog/the-real-best-papers-of-eurocrypt-2025/ to read it!
➡️Quickly head on over to
https://www.esat.kuleuven.be/cosic/blog/the-real-best-papers-of-eurocrypt-2025/ to read it!
👉COSIC's postdoctoral researcher Shahla Atapoor attended #Eurocrypt 2025 in Madrid and wrote an interesting blog post on the paper "MPC with Publicly Identifiable Abort from Pseudorandomness and Homomorphic Encryption".
Check out the blog here: https://www.esat.kuleuven.be/cosic/blog/eurocrypt-2025-mpc-with-publicly-identifiable-abort-from-pseudorandomness-and-homomorphic-encryption/
Check out the blog here: https://www.esat.kuleuven.be/cosic/blog/eurocrypt-2025-mpc-with-publicly-identifiable-abort-from-pseudorandomness-and-homomorphic-encryption/
"Towards Optimally Secure Deterministic Authenticated Encryption Schemes" was presented today at #IACR #Eurocrypt 2025 in Madrid.
https://link.springer.com/chapter/10.1007/978-3-031-91107-1_1
https://link.springer.com/chapter/10.1007/978-3-031-91107-1_1
Towards Optimally Secure Deterministic Authenticated Encryption Schemes
The public comments received for the review process for NIST (SP) 800-38A pointed out two important issues that most companies face: (1) the limited security that AES can provide due to its 128-bit block size and (2) the problem of nonce-misuse in practice. In this...
This morning our researcher Robin Geelen presented "Fully Homomorphic Encryption for Cyclotomic Prime Moduli" at #IACR #Eurocrypt 2025 in Madrid.
🔎Interested in this topic? Robin wrote a blog post to explain everything: https://www.esat.kuleuven.be/cosic/blog/eurocrypt-2025-a-new-fhe-scheme-for-high-precision-arithmetic/
#fhe #cryptography
🔎Interested in this topic? Robin wrote a blog post to explain everything: https://www.esat.kuleuven.be/cosic/blog/eurocrypt-2025-a-new-fhe-scheme-for-high-precision-arithmetic/
#fhe #cryptography
Our researcher Erik Pohle attended #Eurocrypt 2025 in Madrid and wrote a blog post on "Efficient Pseudorandom Correlation Generators for Any Finite Field" presented by Yizhou Yao. Check it out here:
https://www.esat.kuleuven.be/cosic/blog/eurocrypt-2025-efficient-pseudorandom-correlation-generators-for-any-finite-field/
https://www.esat.kuleuven.be/cosic/blog/eurocrypt-2025-efficient-pseudorandom-correlation-generators-for-any-finite-field/
Michiel Verbauwhede presented "Cryptanalysis of Full SCARF" today at #eurocrypt 2025 in Madrid, Spain: https://link.springer.com/chapter/10.1007/978-3-031-91107-1_14
Cryptanalysis of Full SCARF
SCARF is a tweakable block cipher dedicated to cache address randomization, proposed at the USENIX Security conference. It has a 10-bit block, 48-bit tweak, and 240-bit key. SCARF is aggressively optimized to meet the harsh latency constraints of cache address...
Mingjie Chen presented "Computing the endomorphism ring of a supersingular elliptic curve from a full rank suborder" today at #eurocrypt 2025 in Madrid, Spain: https://link.springer.com/chapter/10.1007/978-3-031-91095-1_16
Computing the Endomorphism Ring of a Supersingular Elliptic Curve from a Full Rank Suborder
In this paper, we study the problem of computing the endomorphism ring of a supersingular elliptic curve given the knowledge of a full rank suborder. We provide a polynomial time quantum algorithm to solve this problem in full generality. This result enhances our...