How to withstand mobile virus attacks (extended abstract)
From MaRDI portal
(Redirected from Publication:5255805)
Cited in
(52)- Secure distributed storage and retrieval
- Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
- Perennial secure multi-party computation of universal Turing machine
- Approximate agreement under mobile Byzantine faults
- Adaptively secure distributed public-key systems.
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Communication-efficient proactive MPC for dynamic groups with dishonest majorities
- Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
- Fluid MPC: secure multiparty computation with dynamic participants
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
- Proof-of-reputation blockchain with Nakamoto fallback
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
- Secure publicly verifiable and proactive secret sharing schemes with general access structure
- Threshold cryptography based on Asmuth-Bloom secret sharing
- The reactive simulatability (RSIM) framework for asynchronous systems
- Provably secure threshold password-authenticated key exchange
- Authenticated broadcast with a partially compromised public-key infrastructure
- Secret sharing with secure secret reconstruction
- Communication-optimal proactive secret sharing for dynamic groups
- Proactive Secret Sharing with a Dishonest Majority
- Round-optimal perfectly secret message transmission with linear communication complexity
- Adaptively secure non-interactive threshold cryptosystems
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- A generic solution to realize public verifiability of signcryption
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Simplified Threshold RSA with Adaptive and Proactive Security
- Public-key puncturable encryption: modular and compact constructions
- Efficient ID-Based Key-Insulated Signature Scheme with Batch Verifications using Bilinear Pairings over Elliptic Curves
- Storing and retrieving secrets on a blockchain
- Cryptography and cryptographic protocols
- Identity-Based Threshold Key-Insulated Encryption without Random Oracles
- Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network
- Scalable public-key tracing and revoking
- Distributed protocols against mobile eavesdroppers
- An efficient publicly verifiable and proactive secret sharing scheme
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- State machine replication under changing network conditions
- Perfect MPC over layered graphs
- Distributed CONGEST Algorithms against Mobile Adversaries
- Forward-Secure Group Encryptions from Lattices
- Proactive secret sharing with constant communication
- SPRINT: high-throughput robust distributed Schnorr signatures
- Threshold encryption with silent setup
- Zero-knowledge RAM: doubly efficient and black-box
- Statistical layered MPC
- Proactive refresh for accountable threshold signatures
- Rumors MPC: GOD for dynamic committees, low communication via constant-round chat
- PUFF: maximally \underline{p}roactive sec\underline{u}rity \underline{f}or \underline{f}ree in perfectly secure mpc with guaranteed output delivery
- The infection time of graphs
- Tight bound on mobile Byzantine agreement
This page was built for publication: How to withstand mobile virus attacks (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255805)
