勋章
发表于 2025-3-28 15:33:03
http://reply.papertrans.cn/88/8755/875424/875424_41.png
抛弃的货物
发表于 2025-3-28 21:31:11
Invited Paper: Cross-Chain State Machine Replication a novel SMR protocol adapted for this model. Each state machine transition takes .(.) message delays, where . is the number of active participants, of which . may be Byzantine. This protocol makes novel use of path signatures [.] to keep replicas consistent. This protocol design cleanly separates a
Macronutrients
发表于 2025-3-29 00:09:17
http://reply.papertrans.cn/88/8755/875424/875424_43.png
好开玩笑
发表于 2025-3-29 06:59:39
http://reply.papertrans.cn/88/8755/875424/875424_44.png
FANG
发表于 2025-3-29 10:02:59
http://reply.papertrans.cn/88/8755/875424/875424_45.png
Amplify
发表于 2025-3-29 12:58:09
Blockchain in Dynamic Networksher a particular block is accepted. We establish the necessary conditions for the existence of a solution. We, however, prove that the solution, even under these necessary conditions is, in general, impossible. We then present two algorithms that solve the Blockchain Decision Problem under either th
紧张过度
发表于 2025-3-29 18:41:06
Improving the Efficiency of Report and Trace Ring Signatureswell-suited to protocols that target anonymity as a primary goal, for example, anonymous cryptocurrencies. However, standard ring signatures do not ensure that signers are held accountable if they act maliciously. Fraser and Quaglia (CANS’21) introduced a ring signature variant that they called repo
中子
发表于 2025-3-29 19:47:23
http://reply.papertrans.cn/88/8755/875424/875424_48.png
智力高
发表于 2025-3-30 00:44:13
Perpetual Torus Exploration by Myopic Luminous Robotsy few capabilities. They have a finite limited vision (myopic), they can only see robots at distance one or two. We show that the problem is impossible with only two luminous robots and also with three oblivious robots (without light). We design an optimal algorithm for three luminous robots using t
Horizon
发表于 2025-3-30 07:22:43
Optimal Algorithms for Synchronous Byzantine ,-Set Agreementh that at most . different values are decided by the correct (i.e., non-Byzantine) processes, in such a way that, if all the correct processes propose the same value ., they will decide . (when ., .-set agreement boils down to consensus). This paper presents a two-round algorithm that solves Byzanti