A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
In addition, we introduce a referee committee and partial sets in each committee, and design a recovery procedure in case the leader is malicious. ... In order to break the performance bottlenecks, we propose a reputation mechanism for selecting leaders. The term of reputation in our design reflects each node's honest computation resources. ... SSChain  introduces a root chain in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa ...arXiv:2112.15322v1 fatcat:uaqrt57nt5hhxm6lxl5zua4jmq
Subsequently, we use our game-playing framework to prove quantum indifferentiability of the sponge construction, assuming a random internal function. ... First, we describe how Zhandry's compressed quantum oracles~(Crypto'19) can be used to do quantum lazy sampling of a class of non-uniform function distributions. ... In: Advances in Cryptology -CRYPTO 2019 -39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II. 2019, pp. 296-325. ...arXiv:1904.11477v4 fatcat:hlqvigznjnhe3bqls7t6t5n6fe