Scholarlink

<p>Secure communication among multiple parties is fundamental in modern networked environments where messages traverse shared communication channels. Existing secure multiparty computation, threshold cryptography, and verifiable computation schemes primarily focus on output correctness or robustness, whereas explicit detection of dishonest computation or message manipulation without revealing plaintext information is not their primary design objective. In this work, we introduce a new notion termed behavioral fairness, which captures the ability to detect dishonest execution or message manipulation by participating parties without decrypting plaintext messages. To achieve this, we integrate homomorphic encryption with Byzantine agreement and propose two multiparty protocols: a sequential scheme and a concurrent scheme. We formally define behavioral fairness, present both schemes, and analyze their security under standard homomorphic encryption assumptions. Furthermore, we demonstrate that while sequential scheme incurs linear interaction overhead, the concurrent scheme achieves constant communication rounds per party.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Ensuring Fairness of Parties via Homomorphic Encryption over Multiparty Protocol in Two Different Schemes

  • 期刊论文

  • 发表日期：

    2026年4月26日

查看全文
  • Akshit Aggarwal

摘要

Secure communication among multiple parties is fundamental in modern networked environments where messages traverse shared communication channels. Existing secure multiparty computation, threshold cryptography, and verifiable computation schemes primarily focus on output correctness or robustness, whereas explicit detection of dishonest computation or message manipulation without revealing plaintext information is not their primary design objective. In this work, we introduce a new notion termed behavioral fairness, which captures the ability to detect dishonest execution or message manipulation by participating parties without decrypting plaintext messages. To achieve this, we integrate homomorphic encryption with Byzantine agreement and propose two multiparty protocols: a sequential scheme and a concurrent scheme. We formally define behavioral fairness, present both schemes, and analyze their security under standard homomorphic encryption assumptions. Furthermore, we demonstrate that while sequential scheme incurs linear interaction overhead, the concurrent scheme achieves constant communication rounds per party.