Search
Search Results
-
-
-
-
-
-
-
-
-
-
-
-
-
-
The Multi-user Security of MACs via Universal Hashing in the Ideal Cipher Model
The security of block-cipher-based hash-then-encrypt-type message authentication codes (MACs) has been proven with universal hash functions. Thus,...
-
Improved Meet-in-the-Middle Attacks on Nine Rounds of the AES-192 Block Cipher
In the single-key attack scenario, meet-in-the-middle (MitM) attack method has led to the best currently published cryptanalytic results on the AES...
-
TFHE Public-Key Encryption Revisited
Fully homomorphic encryption allows directly processing encrypted data without having to decrypt it. The result of the computation is encrypted,...
-
SoK: Parameterization of Fault Adversary Models Connecting Theory and Practice
Since the first fault attack by Boneh et al. in 1997, various physical fault injection mechanisms have been explored to induce errors in electronic...
-
Towards Compact Identity-Based Encryption on Ideal Lattices
Basic encryption and signature on lattices have comparable efficiency to their classical counterparts in terms of speed and key size. However,...
-
Cutting the GRASS: Threshold GRoup Action Signature Schemes
Group actions are fundamental mathematical tools, with a long history of use in cryptography. Indeed, the action of finite groups at the basis of the...
-
Differential Privacy for Free? Harnessing the Noise in Approximate Homomorphic Encryption
Homomorphic Encryption (HE) is a type of cryptography that allows computing on encrypted data, enabling computation on sensitive data to be...