Search
Search Results
-
Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques
In this paper, we revisit the difference enumeration technique for LowMC and develop new algebraic techniques to achieve efficient key-recovery...
-
Algebraic Meet-in-the-Middle Attack on LowMC
By exploiting the feature of partial nonlinear layers, we propose a new technique called algebraic meet-in-the-middle (MITM) attack to analyze the...
-
New cryptanalysis of LowMC with algebraic techniques
LowMC is a family of block ciphers proposed by Albrecht et al. at EUROCRYPT 2015, which is tailored specifically for FHE and MPC applications. At...
-
On recovering block cipher secret keys in the cold boot attack setting
This paper presents a general strategy to recover a block cipher secret key in the cold boot attack setting. More precisely, we propose a...
-
A Three-Stage MITM Attack on LowMC from a Single Plaintext-Ciphertext Pair
The block cipher LowMC was proposed by Albrecht et al. at EUROCRYPT 2015 for a low multiplicative complexity. Over the years, LowMC has been...
-
The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers
Inserting backdoors in encryption algorithms has long seemed like a very interesting, yet difficult problem. Most attempts have been unsuccessful for...
-
Practical Homomorphic Evaluation of Block-Cipher-Based Hash Functions with Applications
Fully homomorphic encryption (FHE) is a powerful cryptographic technique allowing to perform computation directly over encrypted data. Motivated by...
-
Related-Key Differential Cryptanalysis of GMiMC Used in Post-Quantum Signatures
With the urgency of the threat imposed by quantum computers, there is a strong interest in making the signature schemes quantum resistant. As the...
-
Improved Quantum Analysis of SPECK and LowMC
As the prevalence of quantum computing is growing in leaps and bounds over the past few years, there is an ever-growing need to analyze the...
-
The Inverse of \(\chi \) and Its Applications to Rasta-Like Ciphers
Rasta and Dasta are two fully homomorphic encryption friendly symmetric-key primitives proposed at CRYPTO 2018 and ToSC 2020, respectively. It can be...
-
Improved homomorphic evaluation for hash function based on TFHE
Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic...
-
Big Brother Is Watching You: A Closer Look at Backdoor Construction
With the advent of Malicious (Peyrin and Wang, Crypto’20), the question of a cipher with an intentional weakness which is only known to its designer...
-
Improved Homomorphic Evaluation for Hash Function Based on TFHE
Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic...
-
Scaling Mobile Private Contact Discovery to Billions of Users
Mobile contact discovery is a convenience feature of messengers such as WhatsApp or Telegram that helps users to identify which of their existing...
-
3-Party Distributed ORAM from Oblivious Set Membership
Distributed Oblivious RAM (DORAM) protocols allow a group of participants to obliviously access a secret-shared array at a secret-shared index, and...
-
Scalable Multi-party Private Set Union from Multi-query Secret-Shared Private Membership Test
Multi-party private set union (MPSU) allows \(k(k\ge 3)\)...
-
Post-quantum ID-Based Ring Signatures from Symmetric-Key Primitives
Ring signatures and ID-based cryptography are considered promising in terms of application. A ring signature authenticates messages while the author...
-
Differential Power Analysis of the Picnic Signature Scheme
This work introduces the first differential side-channel analysis of the Picnic Signature Scheme, an alternate candidate in the ongoing competition...
-
New Attacks on LowMC Instances with a Single Plaintext/Ciphertext Pair
Cryptanalysis of the LowMC block cipher when the attacker has access to a single known plaintext/ciphertext pair is a mathematically challenging...
-
Algebraic Attacks on Round-Reduced Rain and Full AIM-III
Picnic is a NIST PQC Round 3 Alternate signature candidate that builds upon symmetric primitives following the MPC-in-the-head paradigm. Recently,...