14:33:50 new paper: https://eprint.iacr.org/2022/550 14:58:16 "By applying ROAST to Σ = FROST, we obtain the first (non-trivial) asynchronous Schnorr threshold signature protocol" 14:58:18 "From an engineering point of view, ROAST is a simple wrapper around Σ, making it easy to implement as an independent layer that only calls Σ in a black-box manner." 14:58:27 it's an optimization of network communication for large groups of signers. 14:59:17 "Assuming that Σ is unforgeable under concurrent sessions and provides identifiable aborts, the application of ROAST to Σ yields a robust and asynchronous signing protocol" this prerequisite isn't achieved yet in monero 15:02:17 as soon prerequisite is achieved I'm sure it would not be so hard to optimize network communication and add some useful checks to detect malicious participants 15:04:20 "new paper: https://eprint.iacr...." <- thanks for sharing 18:19:50 Sounds interesting