We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts Programmable Hash Functions, introduced by Hofheinz and Kiltz at Crypto 2008, with two main differences. First, an APHF works over bilinear groups, and it is asymmetric in the sense that, while only {em secretly} computable, it admits an isomorphic copy which is publicly computable. Second, in addition to the usual programmability, APHFs may have an alternative property that we call programmable pseudorandomness. In a nutshell, this property states that it is possible to embed a pseudorandom value as part of the function's output, akin to a random oracle. In spite of the apparent limitation of being only secretly computable, APHFs turn out to ...
In this work, we study the question of what set of simple-to-state assumptions suffice for construct...
We propose and analyze a simple strategy for constructing 1-key constrained pseudorandom functions (...
One of the current challenges in cryptographic research is the development of advanced cryptographic...
We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts P...
We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts P...
Abstract. We introduce the notion of asymmetric programmable hash functions (APHFs, for short), whic...
We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts P...
A pseudorandom function (PRF) is a keyed function F : K × X → Y where, for a random key k ∈ K, the f...
We introduce two new cryptographic primitives: functional digital signatures and functional pseudora...
Pseudorandom functions (PRFs) are the building blocks of symmetric-key cryptography. Almost all cent...
Abstract. A pseudorandom function (PRF) is a keyed function F: K × X → Y where, for a random key k ∈...
A key-homomorphic pseudorandom function (PRF) family {Fs: D → R} allows one to efficiently compute t...
A key-homomorphic pseudorandom function (PRF) family {Fs: D → R} allows one to efficiently compute t...
Boneh et al. (Crypto 13) and Banerjee and Peikert (Crypto 14) constructed pseudorandom functions (PR...
In 1984, Goldreich, Goldwasser and Micali formalized the concept of pseudorandom functions and propo...
In this work, we study the question of what set of simple-to-state assumptions suffice for construct...
We propose and analyze a simple strategy for constructing 1-key constrained pseudorandom functions (...
One of the current challenges in cryptographic research is the development of advanced cryptographic...
We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts P...
We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts P...
Abstract. We introduce the notion of asymmetric programmable hash functions (APHFs, for short), whic...
We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts P...
A pseudorandom function (PRF) is a keyed function F : K × X → Y where, for a random key k ∈ K, the f...
We introduce two new cryptographic primitives: functional digital signatures and functional pseudora...
Pseudorandom functions (PRFs) are the building blocks of symmetric-key cryptography. Almost all cent...
Abstract. A pseudorandom function (PRF) is a keyed function F: K × X → Y where, for a random key k ∈...
A key-homomorphic pseudorandom function (PRF) family {Fs: D → R} allows one to efficiently compute t...
A key-homomorphic pseudorandom function (PRF) family {Fs: D → R} allows one to efficiently compute t...
Boneh et al. (Crypto 13) and Banerjee and Peikert (Crypto 14) constructed pseudorandom functions (PR...
In 1984, Goldreich, Goldwasser and Micali formalized the concept of pseudorandom functions and propo...
In this work, we study the question of what set of simple-to-state assumptions suffice for construct...
We propose and analyze a simple strategy for constructing 1-key constrained pseudorandom functions (...
One of the current challenges in cryptographic research is the development of advanced cryptographic...