Pages that link to "Item:Q5255805"

The following pages link to How to withstand mobile virus attacks (extended abstract) (Q5255805):

Displaying 19 items.

• Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares (Q306248) (← links)
• The infection time of graphs (Q858307) (← links)
• Tight bound on mobile Byzantine agreement (Q897904) (← links)
• Secure distributed storage and retrieval (Q1575652) (← links)
• Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register (Q1686114) (← links)
• Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
• Approximate agreement under mobile Byzantine faults (Q1755583) (← links)
• Adaptively secure distributed public-key systems. (Q1853497) (← links)
• Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
• Communication-efficient proactive MPC for dynamic groups with dishonest majorities (Q2096629) (← links)
• Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps (Q2110369) (← links)
• Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
• Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
• Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
• Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
• Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities (Q2229260) (← links)
• Cryptography and cryptographic protocols (Q5138490) (← links)
• Distributed protocols against mobile eavesdroppers (Q6084554) (← links)
• An efficient publicly verifiable and proactive secret sharing scheme (Q6112179) (← links)