Lesson plan
Distributed point function
In cryptography, a distributed point function is a cryptographic primitive that allows two distributed processes to share a piece of information, and compute functions of their shared information, without revealing the information itself to either process. It is a form of secret sharing. Given any two values a and b one can define a point function P_{a,b}(x) (a variant of the Kronecker delta function) by : P_{a,b}(x) = \begin{cases} b \qquad \text{for } x=a\\ 0 \qquad \text{for } x\ne a \end{cases} That is, it is zero everywhere except at a , where its value is b . A distributed point function consists of a family of functions f_k , parameterized by keys k , and a method for deriving two keys q and r from any two input values a and b , such that for all x , : P_{a,b}(x) = f_q(x) \oplus f_r(x), where \oplus denotes the bitwise exclusive or of the two function values. However, given only one of these two keys, the values of f for that key should be indistinguishable from random. It is known how to construct an efficient distributed point function from another cryptographic primitive, a one-way function. In the other direction, if a distributed point function is known, then it is possible to perform private information retrieval.…
Article summary
In cryptography, a distributed point function is a cryptographic primitive that allows two distributed processes to share a piece of information, and compute functions of their shared information, without revealing the information itself to either process. It is a form of secret sharing. Given any two values a and b one can define a point function P_{a,b}(x) (a variant of the Kronecker delta function) by : P_{a,b}(x) = \begin{cases} b \qquad \text{for } x=a\\ 0 \qquad \text{for } x\ne a \end{cases} That is, it is zero everywhere except at a , where its value is b . A distributed point function consists of a family of functions f_k , parameterized by keys k , and a method for deriving two keys q and r from any two input values a and b , such that for all x , : P_{a,b}(x) = f_q(x) \oplus f_r(x), where \oplus denotes the bitwise exclusive or of the two function values. However, given only one of these two keys, the values of f for that key should be indistinguishable from random. It is known how to construct an efficient distributed point function from another cryptographic primitive, a one-way function. In the other direction, if a distributed point function is known, then it is possible to perform private information retrieval.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.