Bonus

Torben Pedersen lends his name to an “information-theoretically hiding” one of these protocols. For 10 points each:
[10h] Name these two-step protocols that consist of a namesake initial phase followed by a “reveal” phase. These binding cryptographic primitives allow one party to select a value that cannot be changed after it is selected.
ANSWER: commitment schemes [accept bit commitment schemes; accept Pedersen commitment scheme or information-theoretically hiding commitment scheme or commit phase; prompt on schemes]
[10e] Manuel Blum’s seminal paper on commitment schemes is titled for performing this action “by telephone.” Performing this physical action once is the prototypical example of a Bernoulli trial.
ANSWER: coin flipping [accept descriptions such as flipping a coin or winning a coin toss or playing heads or tails; accept “Coin Flipping by Telephone”]
[10m] Blum’s procedure for coin flipping by telephone is based on one of these functions. Due to their pre-image resistance, hash functions are often considered these functions, which are easy to compute but difficult to invert.
ANSWER: one-way functions [or OWFs; accept trapdoor functions or trapdoor one-way functions]
<Other Science>
Answerlines and category may not exactly match the version played at all sites

Back to bonuses

Conversion

Summary

TournamentExact Match?HeardPPBEasy %Medium %Hard %
2025 ACF NationalsYes2316.9687%74%9%