Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation

被引:0
|
作者
Arpita Patra
Ashish Choudhury
C. Pandu Rangan
机构
[1] University of Bristol,Department of Computer Science
[2] Indian Institute of Technology Madras,Department of Computer Science and Engineering
来源
Journal of Cryptology | 2015年 / 28卷
关键词
Unconditional security; Fault tolerance; Communication complexity;
D O I
暂无
中图分类号
学科分类号
摘要
Secure Multi-Party Computation (MPC) providing information-theoretic security allows a set of n parties to securely compute an agreed function over a finite field, even if t parties are under the control of a computationally unbounded active adversary. Asynchronous MPC (AMPC) is an important variant of MPC, which works over an asynchronous network. It is well known that perfect AMPC is possible if and only if t<n/4, while statistical AMPC is possible if and only if t<n/3. In this paper, we study the communication complexity of AMPC protocols (both statistical and perfect) designed with exactly n=4t+1 parties. Our major contributions in this paper are as follows:Asynchronous Verifiable Secret Sharing (AVSS) is one of the main building blocks for AMPC protocols. In this paper, we design two AVSS schemes with 4t+1 parties: the first one is statistically-secure and has non-optimal resilience, while the second one is perfectly-secure and has optimal resilience. Both these schemes achieve a common interesting property, which was not achieved by the previous schemes. Specifically, our AVSS schemes allow to share a secret with the degree of sharing at most d, where t≤d≤2t. In contrast, the existing AVSS schemes allow the degree of sharing to be at most t. The new property of our AVSS schemes simplifies the degree-reduction step for the evaluation of multiplication gates in an AMPC protocol.Using our statistical AVSS scheme, we design a statistical AMPC protocol with n=4t+1 which requires an amortized communication of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {O}(n^{2})$\end{document} field elements per multiplication gate. Though this protocol has non-optimal resilience, it significantly improves the communication complexity of the existing statistical AMPC protocols.We then present a perfect AMPC protocol with n=4t+1 (using our perfect AVSS scheme), which also incurs an amortized communication of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{O}(n^{2})$\end{document} field elements per multiplication gate. This protocol improves on our statistical AMPC protocol as it has optimal resilience. This is the most communication efficient, optimally-resilient, perfect AMPC protocol.
引用
收藏
页码:49 / 109
页数:60
相关论文
共 50 条
  • [1] Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation
    Patra, Arpita
    Choudhury, Ashish
    Rangan, C. Pandu
    [J]. JOURNAL OF CRYPTOLOGY, 2015, 28 (01) : 49 - 109
  • [2] Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
    Patra, Arpita
    Choudhary, Ashish
    Rangan, C. Pandu
    [J]. INFORMATION THEORETIC SECURITY, 2010, 5973 : 74 - 92
  • [3] Subset Sum-Based Verifiable Secret Sharing Scheme for Secure Multiparty Computation
    Olalia, Romulo L., Jr.
    Sison, Ariel M.
    Medina, Ruji P.
    [J]. RECENT ADVANCES IN INFORMATION AND COMMUNICATION TECHNOLOGY 2018, 2019, 769 : 209 - 219
  • [4] Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience
    Shoup, Victor
    Smart, Nigel P.
    [J]. JOURNAL OF CRYPTOLOGY, 2024, 37 (03)
  • [5] Secret Sharing Based Multiparty Quantum Computation for Multiplication
    Kartick Sutradhar
    Hari Om
    [J]. International Journal of Theoretical Physics, 2021, 60 : 3417 - 3425
  • [6] Secret Sharing Based Multiparty Quantum Computation for Multiplication
    Sutradhar, Kartick
    Om, Hari
    [J]. INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2021, 60 (09) : 3417 - 3425
  • [7] Broadcast (and Round) Efficient Verifiable Secret Sharing
    Garay, Juan
    Givens, Clint
    Ostrovsky, Rafail
    Raykov, Pavel
    [J]. INFORMATION THEORETIC SECURITY, ICITS 2013, 2014, 8317 : 200 - 219
  • [8] Efficient Secure Multiparty Computation Protocol in Asynchronous Network
    Huang, Zheng
    Qiu, Weidong
    Li, Qiang
    Chen, Kefei
    [J]. ADVANCES IN INFORMATION SECURITY AND ASSURANCE, 2009, 5576 : 152 - 158
  • [9] Multiparty to multiparty quantum secret sharing
    Qin, Huawang
    Tang, Wallace K. S.
    Tso, Raylin
    [J]. MODERN PHYSICS LETTERS B, 2018, 32 (29):
  • [10] Efficient multiparty quantum-secret-sharing schemes
    Xiao, L
    Long, GL
    Deng, FG
    Pan, JW
    [J]. PHYSICAL REVIEW A, 2004, 69 (05): : 052307 - 1