PATS: Let Parties Have a Say in Threshold Group Key Sharing

IF 1.3 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

IET Information Security Pub Date : 2024-06-09 DOI:10.1049/2024/7557514

Adnan Kılıç, Cansu Betin Onur, Ertan Onur

{"title":"PATS: Let Parties Have a Say in Threshold Group Key Sharing","authors":"Adnan Kılıç, Cansu Betin Onur, Ertan Onur","doi":"10.1049/2024/7557514","DOIUrl":null,"url":null,"abstract":"<div>\n <p>We present a password-authenticated (2, 3)-threshold group key share (PATS) mechanism. Although PATS resembles threshold secret sharing schemes, it has a different structure. The innovative perspective of the PATS mechanism that makes a difference from the standard secret-sharing schemes is that it involves parties in the generation of the shares. PATS allows parties to communicate securely to establish their shares over insecure channels. Parties (shareholders) construct a secret (key) using shares obtained at the end of the protocol. PATS takes advantage of zero-knowledge proofs compared to well-known threshold key exchange schemes and will tolerate the existence of semi-trusted parties. We present two variants of PATS, centralized and distributed, and then generalize PATS to (<i>t</i>, <i>n</i>)-threshold scheme. PATS supports the distributed operation and optionally facilitates group key verification by a trusted third party, which may also partake in group key sharing. In this paper, we present PATS, which employs finite fields and elliptic curves, along with its security and complexity analyses.</p>\n </div>","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"2024 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2024-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/2024/7557514","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Information Security","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/2024/7557514","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

We present a password-authenticated (2, 3)-threshold group key share (PATS) mechanism. Although PATS resembles threshold secret sharing schemes, it has a different structure. The innovative perspective of the PATS mechanism that makes a difference from the standard secret-sharing schemes is that it involves parties in the generation of the shares. PATS allows parties to communicate securely to establish their shares over insecure channels. Parties (shareholders) construct a secret (key) using shares obtained at the end of the protocol. PATS takes advantage of zero-knowledge proofs compared to well-known threshold key exchange schemes and will tolerate the existence of semi-trusted parties. We present two variants of PATS, centralized and distributed, and then generalize PATS to (t, n)-threshold scheme. PATS supports the distributed operation and optionally facilitates group key verification by a trusted third party, which may also partake in group key sharing. In this paper, we present PATS, which employs finite fields and elliptic curves, along with its security and complexity analyses.

Abstract Image

查看原文本刊更多论文

PATS：让各方在阈值群组密钥共享中发表意见

我们提出了一种密码验证（2，3）阈值群组密钥共享（PATS）机制。虽然 PATS 与阈值密钥共享机制相似，但它的结构却有所不同。PATS 机制有别于标准秘密共享方案的创新之处在于，它让各方都参与到密钥共享的生成过程中。PATS 允许各方在不安全的信道上进行安全通信，以建立他们的共享。各方（股东）使用协议结束时获得的份额构建秘密（密钥）。与众所周知的阈值密钥交换方案相比，PATS 利用了零知识证明的优势，并能容忍半信任方的存在。我们介绍了 PATS 的两种变体：集中式和分布式，然后将 PATS 推广到 (t, n) 门槛方案。PATS 支持分布式操作，并可选择由受信任的第三方进行群组密钥验证，该第三方也可参与群组密钥共享。本文介绍了采用有限域和椭圆曲线的 PATS 及其安全性和复杂性分析。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IET Information Security 工程技术-计算机：理论方法

CiteScore

3.80

自引率

7.10%

发文量

审稿时长

8.6 months

期刊介绍： IET Information Security publishes original research papers in the following areas of information security and cryptography. Submitting authors should specify clearly in their covering statement the area into which their paper falls. Scope: Access Control and Database Security Ad-Hoc Network Aspects Anonymity and E-Voting Authentication Block Ciphers and Hash Functions Blockchain, Bitcoin (Technical aspects only) Broadcast Encryption and Traitor Tracing Combinatorial Aspects Covert Channels and Information Flow Critical Infrastructures Cryptanalysis Dependability Digital Rights Management Digital Signature Schemes Digital Steganography Economic Aspects of Information Security Elliptic Curve Cryptography and Number Theory Embedded Systems Aspects Embedded Systems Security and Forensics Financial Cryptography Firewall Security Formal Methods and Security Verification Human Aspects Information Warfare and Survivability Intrusion Detection Java and XML Security Key Distribution Key Management Malware Multi-Party Computation and Threshold Cryptography Peer-to-peer Security PKIs Public-Key and Hybrid Encryption Quantum Cryptography Risks of using Computers Robust Networks Secret Sharing Secure Electronic Commerce Software Obfuscation Stream Ciphers Trust Models Watermarking and Fingerprinting Special Issues. Current Call for Papers: Security on Mobile and IoT devices - https://digital-library.theiet.org/files/IET_IFS_SMID_CFP.pdf