Cryptanalysis of the multilinear map over the integers
We describe a polynomial-time cryptanalysis of the (approximate) multilinear map of Coron,
Lepoint and Tibouchi (CLT). The attack relies on an adaptation of the so-called zeroizing …
Lepoint and Tibouchi (CLT). The attack relies on an adaptation of the so-called zeroizing …
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions: Or: How to Secretly Embed a Circuit in Your PRF
Z Brakerski, V Vaikuntanathan - Theory of Cryptography: 12th Theory of …, 2015 - Springer
Abstract Boneh et al.(Crypto 13) and Banerjee and Peikert (Crypto 14) constructed
pseudorandom functions (PRFs) from the Learning with Errors (LWE) assumption by …
pseudorandom functions (PRFs) from the Learning with Errors (LWE) assumption by …
New and improved key-homomorphic pseudorandom functions
A Banerjee, C Peikert - Advances in Cryptology–CRYPTO 2014: 34th …, 2014 - Springer
A key-homomorphic pseudorandom function (PRF) family {F s: D→ R} allows one to
efficiently compute the value F s+ t (x) given F s (x) and F t (x). Such functions have many …
efficiently compute the value F s+ t (x) given F s (x) and F t (x). Such functions have many …
Symmetric primitives with structured secrets
N Alamati, H Montgomery, S Patranabis - … Barbara, CA, USA, August 18–22 …, 2019 - Springer
Securely managing encrypted data on an untrusted party is a challenging problem that has
motivated the study of a wide variety of cryptographic primitives. A special class of such …
motivated the study of a wide variety of cryptographic primitives. A special class of such …
Generic constructions of robustly reusable fuzzy extractor
Y Wen, S Liu, D Gu - Public-Key Cryptography–PKC 2019: 22nd IACR …, 2019 - Springer
Abstract Robustly reusable Fuzzy Extractor (rrFE) considers reusability and robustness
simultaneously. We present two approaches to the generic construction of rrFE. Both of …
simultaneously. We present two approaches to the generic construction of rrFE. Both of …
Related-key security for pseudorandom functions beyond the linear barrier
Related-key attacks (RKAs) concern the security of cryptographic primitives in the situation
where the key can be manipulated by the adversary. In the RKA setting, the adversary's …
where the key can be manipulated by the adversary. In the RKA setting, the adversary's …
Efficient public-key cryptography with bounded leakage and tamper resilience
We revisit the question of constructing public-key encryption and signature schemes with
security in the presence of bounded leakage and tampering memory attacks. For signatures …
security in the presence of bounded leakage and tampering memory attacks. For signatures …
Functional encryption: deterministic to randomized functions from simple assumptions
Functional encryption (FE) enables fine-grained control of sensitive data by allowing users
to only compute certain functions for which they have a key. The vast majority of work in FE …
to only compute certain functions for which they have a key. The vast majority of work in FE …
An algebraic framework for pseudorandom functions and applications to related-key security
In this work, we provide a new algebraic framework for pseudorandom functions which
encompasses many of the existing algebraic constructions, including the ones by Naor and …
encompasses many of the existing algebraic constructions, including the ones by Naor and …
[HTML][HTML] Cryptanalysis of the CLT13 multilinear map
In this paper, we describe a polynomial time cryptanalysis of the (approximate) multilinear
map proposed by Coron, Lepoint, and Tibouchi in Crypto13 (CLT13). This scheme includes …
map proposed by Coron, Lepoint, and Tibouchi in Crypto13 (CLT13). This scheme includes …