# Trapdoor implementation [closed]

X-posting from SO

Please refer to this secure index paper. On page#6, a trapdoor is defined as

Trapdoor(Kpriv, w): Given the master key Kpriv = (k1, . . . , kr) and word w, output the trapdoor for word w as Tw = (f(w, k1), . . . , f(w, kr))


Can someone please explain it to me using an example?

Let's say we've a word hello for which we want to generate a trap door. So, do I first encrypt it with k1 and then take it's hash. And do the same with key k2, k3 etc. Once we have all the hashes, simple concatenate them. Is my understanding correct?

-
Please don't crosspost in quick succession! If you think the post is better off here than on Stack Overflow, please flag the copy over there for migration. – Raphael Feb 3 at 1:20
Do you want us to read the paper for you? You'd have to give us a bit more motivation than just "I don't understand <random definition>"... – vonbrand Feb 3 at 2:11
Voted to close - only helpful for people reading this specific paper. – Yuval Filmus Feb 3 at 18:08

## closed as too localized by Yuval Filmus, Pål GD, Gilles♦Feb 3 at 20:07

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, see the FAQ.