Scalable and Adaptively Secure Any-Trust Distributed Key Generation and All-hands Checkpointing

• URL: http://arxiv.org/abs/2311.09592v3
• Date: Sun, 5 May 2024 06:22:29 GMT
• Title: Scalable and Adaptively Secure Any-Trust Distributed Key Generation and All-hands Checkpointing
• Authors: Hanwen Feng, Tiancheng Mai, Qiang Tang,
• Abstract summary: We propose a practical DKG for DLog-based cryptosystems, which achieves (quasi-)linear and communication per-node cost with the help of a common coin. Our protocol is secure against adaptive adversaries, which can corrupt less than half of all nodes. We present a generic transformer that enables us to efficiently deploy a conventional distributed protocol like our DKG, even when the participants have different weights.
• Score: 3.1771413727096154
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The classical distributed key generation protocols (DKG) are resurging due to their widespread applications in blockchain. While efforts have been made to improve DKG communication, practical large-scale deployments are still yet to come due to various challenges, including the heavy computation and communication (particularly broadcast) overhead in their adversarial cases. In this paper, we propose a practical DKG for DLog-based cryptosystems, which achieves (quasi-)linear computation and communication per-node cost with the help of a common coin, even in the face of the maximal amount of Byzantine nodes. Moreover, our protocol is secure against adaptive adversaries, which can corrupt less than half of all nodes. The key to our improvements lies in delegating the most costly operations to an Any-Trust group together with a set of techniques for adaptive security. This group is randomly sampled and consists of a small number of individuals. The population only trusts that at least one member in the group is honest, without knowing which one. Moreover, we present a generic transformer that enables us to efficiently deploy a conventional distributed protocol like our DKG, even when the participants have different weights. Additionally, we introduce an extended broadcast channel based on a blockchain and data dispersal network (such as IPFS), enabling reliable broadcasting of arbitrary-size messages at the cost of constant-size blockchain storage.

Related papers

• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Generative AI-enabled Blockchain Networks: Fundamentals, Applications, and Case Study [73.87110604150315]
  Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
  arXiv  Detail & Related papers  (2024-01-28T10:46:17Z)
• TBDD: A New Trust-based, DRL-driven Framework for Blockchain Sharding in IoT [25.15169926146292]
  Integrating sharded blockchain with IoT presents a solution for trust issues and optimized data flow. Deep Reinforcement Learning adeptly handles dynamic, complex systems and multi-dimensional optimization. textscTbDd discerns node types and performs targeted resharding against potential threats.
  arXiv  Detail & Related papers  (2024-01-01T01:57:28Z)
• Communication-Efficient Decentralized Federated Learning via One-Bit Compressive Sensing [52.402550431781805]
  Decentralized federated learning (DFL) has gained popularity due to its practicality across various applications. Compared to the centralized version, training a shared model among a large number of nodes in DFL is more challenging. We develop a novel algorithm based on the framework of the inexact alternating direction method (iADM)
  arXiv  Detail & Related papers  (2023-08-31T12:22:40Z)
• Trustless Privacy-Preserving Data Aggregation on Ethereum with Hypercube Network Topology [0.0]
  We have proposed a scalable privacy-preserving data aggregation protocol for summation on the blockchain. The protocol consists of four stages as contract deployment, user registration, private submission and proof verification.
  arXiv  Detail & Related papers  (2023-08-29T12:51:26Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Distributed Information-theoretical Secure Protocols for Quantum Key Distribution Networks against Malicious Nodes [15.200383830307915]
  Quantum key distribution (QKD) networks are expected to enable information-theoretical secure (ITS) communication over a large-scale network. Current research on QKD networks primarily addresses passive attacks conducted by malicious nodes such as eavesdropping. We suggest a novel paradigm, inspired by distributed systems, to address the active attack by collaborate malicious nodes in QKD networks.
  arXiv  Detail & Related papers  (2023-02-14T11:53:22Z)
• Improved Semi-Quantum Key Distribution with Two Almost-Classical Users [1.827510863075184]
  We revisit a mediated semi-quantum key distribution protocol introduced by Massa et al. We show how this protocol may be extended to improve its efficiency and also its noise tolerance. We evaluate the protocol's performance in a variety of lossy and noisy channels.
  arXiv  Detail & Related papers  (2022-03-20T14:41:14Z)
• Secure Distributed Training at Scale [65.7538150168154]
  Training in presence of peers requires specialized distributed training algorithms with Byzantine tolerance. We propose a novel protocol for secure (Byzantine-tolerant) decentralized training that emphasizes communication efficiency.
  arXiv  Detail & Related papers  (2021-06-21T17:00:42Z)
• Sharing classical secrets with continuous-variable entanglement: Composable security and network coding advantage [0.913755431537592]
  We show that multi-partite entangled resources achieve a genuine advantage over point-to-point protocols for quantum communication. This is the first concrete compelling examples of multi-partite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication.
  arXiv  Detail & Related papers  (2021-04-21T17:37:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.