Document Zbl 1527.94019 - zbMATH Open

[1] Andrychowicz, M.; Dziembowski, S.; Malinowski, D.; Mazurek, Ł.; Böhme, R.; Brenner, M.; Moore, T.; Smith, M., Fair two-party computations via bitcoin deposits, Financial Cryptography and Data Security, 105-121 (2014), Heidelberg: Springer, Heidelberg · doi:10.1007/978-3-662-44774-1_8 [2] Badertscher, C., Gazi, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: composable proof-of-stake blockchains with dynamic availability. In: ACM CCS 2018, Oct. (2018) [3] Badertscher, C.; Maurer, U.; Tschudi, D.; Zikas, V.; Katz, J.; Shacham, H., Bitcoin as a transaction ledger: a composable treatment, Advances in Cryptology - CRYPTO 2017, 324-356 (2017), Cham: Springer, Cham · Zbl 1407.94077 · doi:10.1007/978-3-319-63688-7_11 [4] Baum, C., David, B., Dowsley, R.: Insured MPC: efficient secure computation with financial penalties. In: FC 2020, Feb. (2020) · Zbl 1459.94096 [5] Baum, C., David, B., Dowsley, R., Kishore, R., Nielsen, J.B., Oechsner, S.: Craft: composable randomness beacons and output-independent abort MPC from time. Cryptology ePrint Archive, Paper 2020/784 (2020). https://eprint.iacr.org/2020/784 [6] Baum, C.; David, B.; Dowsley, R.; Nielsen, JB; Oechsner, S.; Canteaut, A.; Standaert, F-X, TARDIS: a foundation of time-lock puzzles in UC, Advances in Cryptology - EUROCRYPT 2021, 429-459 (2021), Cham: Springer, Cham · Zbl 1479.94124 · doi:10.1007/978-3-030-77883-5_15 [7] Baum, C.; Orsini, E.; Scholl, P.; Hirt, M.; Smith, A., Efficient secure multiparty computation with identifiable abort, Theory of Cryptography, 461-490 (2016), Heidelberg: Springer, Heidelberg · Zbl 1406.94025 · doi:10.1007/978-3-662-53641-4_18 [8] Baum, C.; Orsini, E.; Scholl, P.; Soria-Vazquez, E.; Micciancio, D.; Ristenpart, T., Efficient constant-round MPC with identifiable abort and public verifiability, Advances in Cryptology - CRYPTO 2020, 562-592 (2020), Cham: Springer, Cham · Zbl 07614580 · doi:10.1007/978-3-030-56880-1_20 [9] Bendlin, R.; Damgård, I.; Orlandi, C.; Zakarias, S.; Paterson, KG, Semi-homomorphic encryption and multiparty computation, Advances in Cryptology - EUROCRYPT 2011, 169-188 (2011), Heidelberg: Springer, Heidelberg · Zbl 1281.94015 · doi:10.1007/978-3-642-20465-4_11 [10] Bentov, I.; Kumaresan, R.; Garay, JA; Gennaro, R., How to use bitcoin to design fair protocols, Advances in Cryptology - CRYPTO 2014, 421-439 (2014), Heidelberg: Springer, Heidelberg · Zbl 1335.94032 · doi:10.1007/978-3-662-44381-1_24 [11] Bitansky, N., Goldwasser, S., Jain, A., Paneth, O., Vaikuntanathan, V., Waters, B.: Time-lock puzzles from randomized encodings. In: ITCS 2016, Jan. (2016) · Zbl 1334.94062 [12] Boneh, D.; Bonneau, J.; Bünz, B.; Fisch, B.; Shacham, H.; Boldyreva, A., Verifiable delay functions, Advances in Cryptology - CRYPTO 2018, 757-788 (2018), Cham: Springer, Cham · Zbl 1444.94046 · doi:10.1007/978-3-319-96884-1_25 [13] Boneh, D.; Naor, M.; Bellare, M., Timed commitments, Advances in Cryptology — CRYPTO 2000, 236-254 (2000), Heidelberg: Springer, Heidelberg · Zbl 0989.94517 · doi:10.1007/3-540-44598-6_15 [14] Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, Oct. (2001) [15] Canetti, R.; Dodis, Y.; Pass, R.; Walfish, S.; Vadhan, SP, Universally composable security with global setup, Theory of Cryptography, 61-85 (2007), Heidelberg: Springer, Heidelberg · Zbl 1129.94014 · doi:10.1007/978-3-540-70936-7_4 [16] Cascudo, I., David, B.: SCRAPE: scalable randomness attested by public entities. In: ACNS 17, July (2017) · Zbl 1521.94035 [17] Cascudo, I.; David, B.; Moriai, S.; Wang, H., ALBATROSS: publicly attestable batched randomness based on secret sharing, Advances in Cryptology - ASIACRYPT 2020, 311-341 (2020), Cham: Springer, Cham · Zbl 1511.94173 · doi:10.1007/978-3-030-64840-4_11 [18] Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: 18th ACM STOC, May (1986) [19] Coan, BA; Dolev, D.; Dwork, C.; Stockmeyer, LJ, The distributed firing squad problem, SIAM J. Comput., 18, 5, 990-1012 (1989) · Zbl 0679.68051 · doi:10.1137/0218068 [20] Couteau, G., Roscoe, A.W., Ryan, P.Y.A.: Partially-fair computation from timed-release encryption and oblivious transfer. In: ACISP 21, Dec. (2021) · Zbl 1521.68052 [21] David, B.; Gaži, P.; Kiayias, A.; Russell, A.; Nielsen, JB; Rijmen, V., Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain, Advances in Cryptology - EUROCRYPT 2018, 66-98 (2018), Cham: Springer, Cham · Zbl 1423.94066 · doi:10.1007/978-3-319-78375-8_3 [22] De Feo, L.; Masson, S.; Petit, C.; Sanso, A.; Galbraith, SD; Moriai, S., Verifiable delay functions from supersingular isogenies and pairings, Advances in Cryptology - ASIACRYPT 2019, 248-277 (2019), Cham: Springer, Cham · Zbl 1456.94070 · doi:10.1007/978-3-030-34578-5_10 [23] Dolev, D.; Reischuk, R.; Strong, HR, Early stopping in byzantine agreement, J. ACM, 37, 4, 720-741 (1990) · Zbl 0711.68008 · doi:10.1145/96559.96565 [24] Dolev, D., Strong, H.R.: Polynomial algorithms for multiple processor agreement. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 401-407. ACM (1982) [25] Ephraim, N.; Freitag, C.; Komargodski, I.; Pass, R.; Canteaut, A.; Ishai, Y., Continuous verifiable delay functions, Advances in Cryptology - EUROCRYPT 2020, 125-154 (2020), Cham: Springer, Cham · Zbl 1479.94164 · doi:10.1007/978-3-030-45727-3_5 [26] Freitag, C.; Komargodski, I.; Pass, R.; Sirkin, N.; Nissim, K.; Waters, B., Non-malleable time-lock puzzles and applications, Theory of Cryptography, 447-479 (2021), Cham: Springer, Cham · Zbl 1511.94101 · doi:10.1007/978-3-030-90456-2_15 [27] Garay, J.; MacKenzie, P.; Prabhakaran, M.; Yang, K.; Halevi, S.; Rabin, T., Resource fairness and composability of cryptographic protocols, Theory of Cryptography, 404-428 (2006), Heidelberg: Springer, Heidelberg · Zbl 1112.94011 · doi:10.1007/11681878_21 [28] Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. J. Crypt. (1), Jan. (2012) · Zbl 1272.94032 [29] Hazay, C.; Scholl, P.; Soria-Vazquez, E.; Takagi, T.; Peyrin, T., Low cost constant round MPC combining BMR and oblivious transfer, Advances in Cryptology - ASIACRYPT 2017, 598-628 (2017), Cham: Springer, Cham · Zbl 1420.94072 · doi:10.1007/978-3-319-70694-8_21 [30] Ishai, Y.; Ostrovsky, R.; Zikas, V.; Garay, JA; Gennaro, R., Secure multi-party computation with identifiable abort, Advances in Cryptology - CRYPTO 2014, 369-386 (2014), Heidelberg: Springer, Heidelberg · Zbl 1335.94053 · doi:10.1007/978-3-662-44381-1_21 [31] Katz, J.; Loss, J.; Xu, J.; Pass, R.; Pietrzak, K., On the security of time-lock puzzles and timed commitments, Theory of Cryptography, 390-413 (2020), Cham: Springer, Cham · Zbl 1485.94098 · doi:10.1007/978-3-030-64381-2_14 [32] Katz, J.; Maurer, U.; Tackmann, B.; Zikas, V.; Sahai, A., Universally composable synchronous computation, Theory of Cryptography, 477-498 (2013), Heidelberg: Springer, Heidelberg · Zbl 1316.68051 · doi:10.1007/978-3-642-36594-2_27 [33] Kiayias, A.; Russell, A.; David, B.; Oliynykov, R.; Katz, J.; Shacham, H., Ouroboros: a provably secure proof-of-stake blockchain protocol, Advances in Cryptology - CRYPTO 2017, 357-388 (2017), Cham: Springer, Cham · Zbl 1407.94128 · doi:10.1007/978-3-319-63688-7_12 [34] Kiayias, A.; Zhou, H-S; Zikas, V.; Fischlin, M.; Coron, J-S, Fair and robust multi-party computation using a global transaction ledger, Advances in Cryptology - EUROCRYPT 2016, 705-734 (2016), Heidelberg: Springer, Heidelberg · Zbl 1371.94643 · doi:10.1007/978-3-662-49896-5_25 [35] Kumaresan, R., Bentov, I.: How to use bitcoin to incentivize correct computations. In: ACM CCS 2014, Nov. (2014) · Zbl 1335.94032 [36] Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: 38th ACM STOC, May (2006) · Zbl 1301.94119 [37] Lindell, Y., Lysyanskaya, A., Rabin, T.: Sequential composition of protocols without simultaneous termination. In: Ricciardi, A., editor, PODC 2002 (2002) · Zbl 1292.68023 [38] Pietrzak, K.: Simple verifiable delay functions. In: ITCS 2019, Jan. (2019) · Zbl 1547.94404 [39] Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto (1996) [40] VDF Alliance Team. Vdf alliance (2020). https://www.vdfalliance.org/what-we-do [41] Wesolowski, B.; Ishai, Y.; Rijmen, V., Efficient verifiable delay functions, Advances in Cryptology - EUROCRYPT 2019, 379-407 (2019), Cham: Springer, Cham · Zbl 1509.94139 · doi:10.1007/978-3-030-17659-4_13