[{"volume":2951,"publisher":"Springer Nature","citation":{"ista":"Maurer U, Pietrzak KZ. 2004. Composition of random systems: When two weak make one strong. First Theory of Cryptography Conference, 2004. TCC: Theory of Cryptography Conference, LNCS, vol. 2951, 410–427.","ama":"Maurer U, Pietrzak KZ. Composition of random systems: When two weak make one strong. In: <i>First Theory of Cryptography Conference, 2004</i>. Vol 2951. Springer Nature; 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>","chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “Composition of Random Systems: When Two Weak Make One Strong.” In <i>First Theory of Cryptography Conference, 2004</i>, 2951:410–27. Springer Nature, 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,” in <i>First Theory of Cryptography Conference, 2004</i>, Cambridge, MA, United, 2004, vol. 2951, pp. 410–427.","short":"U. Maurer, K.Z. Pietrzak, in:, First Theory of Cryptography Conference, 2004, Springer Nature, 2004, pp. 410–427.","apa":"Maurer, U., &#38; Pietrzak, K. Z. (2004). Composition of random systems: When two weak make one strong. In <i>First Theory of Cryptography Conference, 2004</i> (Vol. 2951, pp. 410–427). Cambridge, MA, United: Springer Nature. <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>","mla":"Maurer, Ueli, and Krzysztof Z. Pietrzak. “Composition of Random Systems: When Two Weak Make One Strong.” <i>First Theory of Cryptography Conference, 2004</i>, vol. 2951, Springer Nature, 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>."},"year":"2004","date_updated":"2026-09-11T12:11:09Z","doi":"10.1007/978-3-540-24638-1_23","publication_identifier":{"eisbn":["9783540246381"],"isbn":["9783540210009"]},"publication":"First Theory of Cryptography Conference, 2004","author":[{"full_name":"Maurer, Ueli","first_name":"Ueli","last_name":"Maurer"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"conference":{"location":"Cambridge, MA, United","name":"TCC: Theory of Cryptography Conference","end_date":"2004-02-21","start_date":"2004-02-19"},"fulldoi":"https://doi.org/10.1007/978-3-540-24638-1_23","title":"Composition of random systems: When two weak make one strong","page":"410 - 427","alternative_title":["LNCS"],"publist_id":"3471","language":[{"iso":"eng"}],"status":"public","publication_status":"published","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.\r\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.\r\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","article_processing_charge":"No","oa_version":"None","extern":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:02:01Z","month":"03","intvolume":"      2951","OA_type":"closed access","type":"conference","_id":"3208","day":"19"}]