{"_id":"3208","status":"public","publisher":"Springer","volume":2951,"conference":{"name":"TCC: Theory of Cryptography Conference"},"year":"2004","alternative_title":["LNCS"],"page":"410 - 427","quality_controlled":0,"date_updated":"2021-01-12T07:41:48Z","type":"conference","publication_status":"published","day":"19","month":"03","author":[{"last_name":"Maurer","full_name":"Maurer, Ueli M","first_name":"Ueli"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak"}],"intvolume":"      2951","title":"Composition of random systems: When two weak make one strong","extern":1,"citation":{"ama":"Maurer U, Pietrzak KZ. Composition of random systems: When two weak make one strong. In: Vol 2951. Springer; 2004:410-427. doi:<a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">10.1007/978-3-540-24638-1_23</a>","apa":"Maurer, U., &#38; Pietrzak, K. Z. (2004). Composition of random systems: When two weak make one strong (Vol. 2951, pp. 410–427). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">https://doi.org/10.1007/978-3-540-24638-1_23</a>","chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “Composition of Random Systems: When Two Weak Make One Strong,” 2951:410–27. Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">https://doi.org/10.1007/978-3-540-24638-1_23</a>.","ieee":"U. Maurer and K. Z. Pietrzak, “Composition of random systems: When two weak make one strong,” presented at the TCC: Theory of Cryptography Conference, 2004, vol. 2951, pp. 410–427.","ista":"Maurer U, Pietrzak KZ. 2004. Composition of random systems: When two weak make one strong. TCC: Theory of Cryptography Conference, LNCS, vol. 2951, 410–427.","short":"U. Maurer, K.Z. Pietrzak, in:, Springer, 2004, pp. 410–427.","mla":"Maurer, Ueli, and Krzysztof Z. Pietrzak. <i>Composition of Random Systems: When Two Weak Make One Strong</i>. Vol. 2951, Springer, 2004, pp. 410–27, doi:<a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">10.1007/978-3-540-24638-1_23</a>."},"abstract":[{"text":"A new technique for proving the adaptive indistinguishability of two systems, each composed of some component systems, is presented, using only the fact that corresponding component systems are non-adaptively indistinguishable. The main tool is the definition of a special monotone condition for a random system F, relative to another random system G, whose probability of occurring for a given distinguisher D is closely related to the distinguishing advantage ε of D for F and G, namely it is lower and upper bounded by ε and (1+ln1), respectively.\nA concrete instantiation of this result shows that the cascade of two random permutations (with the second one inverted) is indistinguishable from a uniform random permutation by adaptive distinguishers which may query the system from both sides, assuming the components’ security only against non-adaptive one-sided distinguishers.\nAs applications we provide some results in various fields as almost k-wise independent probability spaces, decorrelation theory and computational indistinguishability (i.e., pseudo-randomness).","lang":"eng"}],"date_published":"2004-03-19T00:00:00Z","doi":"10.1007/978-3-540-24638-1_23","date_created":"2018-12-11T12:02:01Z","publist_id":"3471"}