1 Adaptive Secret Sharing for Monotone Circuits

For many cryptographic primitives, it is relatively easy to achieve selective security (where the adversary commits a-priori to some of the choices to be made later in the attack) but appears difficult to achieve the more natural notion of adaptive security (where the adversary can make all choices on the go as the attack progresses). A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption (Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b). Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework that connects all of these works and allows us to present them in a unified and simplified fashion. Moreover, we use the framework to derive a new result for adaptively secure secret sharing over access structures defined via monotone circuits. We envision that further applications will follow in the future. Underlying our framework is the following simple idea. It is well known that selective security, where the adversary commits to n-bits of information about his future choices, automatically implies adaptive security at the cost of amplifying the adversary’s advantage by a factor of up to 2. However, in some cases the proof of selective security proceeds via a sequence of hybrids, where each pair of adjacent hybrids locally only requires some smaller partial information consisting of m n bits. The partial information needed might be completely different between different pairs of hybrids, and if we look across all the hybrids we might rely on the entire n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security, at the cost of amplifying the adversary’s advantage by a factor of only 2 2. In all of our examples using the above framework, the different hybrids are captured by some sort of a graph pebbling game and the amount of information that the adversary needs to commit to in each pair of hybrids is bounded by the maximum number of pebbles in play at any point in time. Therefore, coming up with better strategies for proving adaptive security translates to various pebbling strategies for different types of graphs. ∗Aarhus University, Denmark. Email: zahra@cs.au. dk. Supported by CTIC (under grant 61061130540) and by the Advanced ERC grant MPCPRO. †IST Austria, Am Campus 1, 3400 Klosterneuburg, Austria. Email: {ckamath,pietrzak}@ist.ac. at. Supported by the European Research Council, ERC consolidator grant (682815 TOCNeT). ‡IST Austria, Am Campus 1, 3400 Klosterneuburg, Austria. Email: karen.klein@ist.ac. at. §Department of Computer Science and Applied Mathematics, Weizmann Institute of Science Israel, Rehovot 76100, Israel. Email: ilan.komargodski@weizmann.ac. il. Supported in part by grants from the Israel Science Foundation and by a Levzion Fellowship. ¶Northeastern University. Department of Computer Science. wichs@ccs.neu. edu. Research supported by NSF grants CNS-1314722, CNS-1413964.